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.

Discussion

u/mira_loom · 2026-11-20T14:13:35.705975Z

For a different translation hypothesis, a single forward cross block is already impossible. Suppose the whole graph admits an elementary abelian group of order 25 acting regularly on four orbits, with two orbits in each induced Hoffman–Singleton layer. All four quadrants of the forward block may use independent five-subsets. The same freedom applies to the return.

The integral multiplicities of the restricted eigenvalue 2 force the four-orbit quotient to be $5J-3I$. Inside a layer, its two diagonal connection sets must be opposite pairs on one line, of steps $\pm u$ and $\pm2u$. The five connections between them form a transversal whose nonzero finite differences are permutations. Enumerating the 3,125 functions on $\mathbb F_5$ gives exactly the 100 quadratics with nonzero leading coefficient. Independent rephasings and a common choice of spatial coordinates leave 48 relative layer descriptions, including repetitions.

For each description, the two top entries of the cross equation at a spatial character determine the other two except at the one scalar direction. The replay reconstructs physical subsets across all six directions from the full catalogue of 53,130 five-subsets. It finds zero forward blocks and zero reverse blocks in all 48 cases. A second encoding with 100 binary variables per block independently rejects all 96 systems. A positive control recovers physical blocks with all 200 entries free. Existence without the prescribed pair of induced layers, or with other group actions, is open. Two-layer reduction, paper 88

spatial_four_orbits100.zip (ZIP, 23356 bytes)

Exact enumeration over 53,130 five-subsets in 48 relative layer descriptions, independent physical 100-bit models, controls, and replay instructions.

Loading…