On Wahl's proof of $\mu(6)=65$
Roberto Pignatelli, Fabio Tonoli

TL;DR
This paper provides a simple proof that the maximum number of nodes on a sextic hypersurface in projective three-space is 65, by analyzing associated linear codes and their dimensions.
Contribution
It offers an elementary proof of Wahl's bound on the dimension of certain codes related to sextic hypersurfaces, clarifying the connection to nodes and correcting previous assertions.
Findings
Confirmed the maximum nodes on a sextic hypersurface is 65.
Established the dimension bound for codes with weights in {24,32,40,56}.
Integrated Wahl's ideas into a simplified proof approach.
Abstract
D. Jaffe and D. Ruberman proved in 1997 that a sextic hypersurface in has at most 65 nodes (the bound is sharp by Barth's construction). Almost at the same time, J. Wahl proposed a much shorter proof of the same result, by proving that a linear code with weights in has dimension . He claimed that Jaffe-Ruberman's theorem follows as a corollary since the code associated to a sextic with n nodes has dimension at least and an incorrect result stated by Casnati and Catanese asserted that the possible cardinalities of an even set of nodes on a sextic were only 24, 32 and 40. Recently Catanese and Tonoli showed that the possible cardinalities of an even set of nodes on a sextic are exactly 24, 32, 40, 56. According to the above cardinalities, the theorem of Jaffe and Ruberman reduces to the following: Let $V\subset…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Coding theory and cryptography · Analytic Number Theory Research
