Nodes on sextic hypersurfaces in \(\mathbb{P}^3\) (Q1281873): Difference between revisions

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\).