On Wahl's proof of $\mu(6)=65$
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 be a code with weights in . Then . In this short note we give an elementary proof of this theorem using and integrating Wahl's ideas.
Keywords
Cite
@article{arxiv.0706.4358,
title = {On Wahl's proof of $\mu(6)=65$},
author = {Roberto Pignatelli and Fabio Tonoli},
journal= {arXiv preprint arXiv:0706.4358},
year = {2007}
}
Comments
5 pages