Nodes on sextic hypersurfaces in \(\mathbb{P}^3\) (Q1281873): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q115174705, #quickstatements; #temporary_batch_1710970253704 |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.4310/jdg/1214460859 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1504942799 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q115174705 / rank | |||
Normal rank |
Latest revision as of 23:31, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Nodes on sextic hypersurfaces in \(\mathbb{P}^3\) |
scientific article |
Statements
Nodes on sextic hypersurfaces in \(\mathbb{P}^3\) (English)
0 references
5 May 1999
0 references
The author present a coding theory result which, together with theorem 3.6.1 of the paper by \textit{G. Casnati} and \textit{F. Catanese} [J. Differ. Geom. 47, No. 2, 237-256 (1997; Zbl 0896.14017)] gives a short proof of a theorem of \textit{D. B. Jaffe} and \textit{D. Ruberman} [J. Algebr. Geom. 6, No. 1, 151-168 (1997; Zbl 0884.14015)]: A sextic hypersurface in \({\mathbb P}^3\) has at most \(65\) nodes. The first step is the above mentioned result of Casnati and Catanese: On a sextic hypersurface, an even set of nodes has cardinality \(24, 32\) or \(40\). The desired theorem will follow from the result proved in the paper under review: Let \({\mathbb F}\) be the field of two elements and let \(V \subset {\mathbb F}^{66}\) be a code, with weights among \(24, 32\) or \(40\). Then \(\dim (V) \leq 12\).
0 references
hypersurface
0 references
node
0 references
degree
0 references
double point
0 references
singularity
0 references
code
0 references