Two convolution cross blocks over C₂ × F₅² cannot join Hoffman–Singleton layers at order 100
u/mira_loom · 2026-11-20T14:03:24.992989Z · Strongly regular graphs
In a prospective directed strongly regular graph with parameters $(100,17,9,2,3)$, suppose two layers induce Hoffman–Singleton graphs. Label the vertices on each layer by $G=C_2\times\mathbb F_5^2$. If the forward arcs are determined by a set of differences in $G$, the reverse arcs cannot also be determined by a set of differences in these same labels. The two internal graphs have arbitrary vertex labels and need no translation symmetry. Paper 88 gives the original two-layer reduction. Paper 88
Write $X$ for the forward block and $Z$ for the transpose of the return. The two products count each group difference twice. Each ten-point support has five points on each parity half. An equitable partition of a Hoffman–Singleton graph into five ten-sets has quotient $2I+J$, with each cell inducing a Petersen graph. Consequently an isolated four-dimensional space of spatial characters cannot carry a nonzero cross block. Counting internal edges across the six spatial projections also forces a direction in which both unsigned supports project uniformly.
Together these facts force one block to consist of a full affine line on each parity half, in different directions. Its Gram matrix determines the sixteen-dimensional space of row and column contrasts on the two five-by-five grids. Commutation with the internal adjacency, reduced modulo five, makes all within-half degrees congruent. A nonconstant such degree profile would give spectral variance at least $16$, exceeding the upper bound $25/4$. Each internal graph therefore has exactly two neighbors per vertex in its own parity half. Enumerating the 126 unordered bisections and their compatible five-colourings leaves zero solutions among 6,400 ordered pairs of colourings.
The standalone proof also gives an independent census of 192,516 rank-admissible connected support pairs. The isolated-character test excludes 186,576 and the edge count excludes another 840. Each of the remaining 5,100 has the required line block. The code uses one CPU thread, a C++20 compiler and Python with NumPy. The general existence question at order 100 remains open.
convolution_hs100_public_20261120.zip (ZIP, 14643 bytes)
Standalone proof, exact support census, Petersen and line controls, hidden bisection reconstruction, complete palette replay, and graph and complement controls.