Concept

Togliatti surface

In algebraic geometry, a Togliatti surface is a nodal surface of degree five with 31 nodes. The first examples were constructed by . proved that 31 is the maximum possible number of nodes for a surface of this degree, showing this example to be optimal.

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.
Concepts associés (3)
Barth surface
NOTOC In algebraic geometry, a Barth surface is one of the complex nodal surfaces in 3 dimensions with large numbers of double points found by . Two examples are the Barth sextic of degree 6 with 65 double points, and the Barth decic of degree 10 with 345 double points. For degree 6 surfaces in P3, showed that 65 is the maximum number of double points possible. The Barth sextic is a counterexample to an incorrect claim by Francesco Severi in 1946 that 52 is the maximum number of double points possible.
Endrass surface
In algebraic geometry, an Endrass surface is a nodal surface of degree 8 with 168 real nodes, found by . , it remained the record-holder for the most number of real nodes for its degree; however, the best proven upper bound, 174, does not match the lower bound given by this surface.
Nodal surface
In algebraic geometry, a nodal surface is a surface in (usually complex) projective space whose only singularities are nodes. A major problem about them is to find the maximum number of nodes of a nodal surface of given degree. The following table gives some known upper and lower bounds for the maximal number of nodes on a complex surface of given degree. In degree 7, 9, 11, and 13, the upper bound is given by , which is better than the one by .

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.