A quintic hypersurface in \(\mathbb{P}^ 4\) with 130 nodes (Q1319607)

A classical problem is to determine the maximum number \(N_ n(d)\) of ordinary double points on the hypersurface of degree \(d\) in \(\mathbb{P}^ n\). The best known upper bound was obtained by \textit{A. Varchenko} [Sov. Math., Dokl. 27, 575-579 (1983); translation from Dokl. Akad. Nauk SSSR 270, 267-270 (1983; Zbl 0537.14002)]. For example, his formula gives that \(N_ 4(5) \leq 135\). Let \(S_ i\) be the \(i\)-th elementary symmetric function in \(X_ 0\), \(X_ 1, \dots, X_ s\), homogeneous coordinates. Let \(\mathbb{P}^ 4\) be the hyperplane defined by \(S_ 1 = 0\) and in this hyperplane, \(M\) the hypersurface defined by \(S_ 5 + S_ 2S_ 3 = 0\). The author proves that \(M\) has exactly 130 nodes, which form three orbits under the permutation group \({\mathfrak S}_ 6\). So: \(130 \leq N_ 4 (5) \leq 135\). -- The other quintics in the pencil \(aS_ 5 + bS_ 2 S_ 3\) have in general 100 nodes and never more than 106 nodes.