About: Nodal surface

An Entity of Type: bone, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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 .

Property Value
dbo:abstract
  • 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 . (en)
dbo:wikiPageID
  • 46573101 (xsd:integer)
dbo:wikiPageLength
  • 2872 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1110299050 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dct:subject
gold:hypernym
rdf:type
rdfs:comment
  • 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 . (en)
rdfs:label
  • Nodal surface (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License