Search arXiv⌕ Search

arXiv · 2609.25086

The unique extremal threemodular lattice of rank 26, the generalized hexagon $(2,8)$, and the tight Cayley-plane $5$-design

Abstract

We reconstruct the generalized hexagon of order $(2,8)$ from an abstract even rank-$26$ lattice of determinant $3$ and minimum $4$, and conversely reconstruct the lattice from the hexagon. Harmonic theta identities determine the $819$ shortest vectors in a non-zero discriminant class and their association scheme, and show that every non-empty positive-norm shell of the lattice and its dual is a spherical $5$-design. In the converse direction, the rank-$26$ idempotent gives the lattice, with saturation proved by a short dual-coset argument. A positive-definite Niemeier construction proves existence and uniqueness of the lattice and hence of the hexagon. The third moment of a projective $3$-design in the Cayley plane reconstructs the traceless Albert product. This upgrades angle-preserving bijections to elements of $F_4(\mathbb R)$ and proves geometric uniqueness of the tight $819$-point projective $5$-design. Finally, line deletion gives a rootless index-four sublattice of $N(A_1^{24})$ with a Golay trio and an oriented gluing. The gluing data form eight root-sign orbits, on which $L_3(2)\cong L_2(7)$ acts as on $\mathbf P^1(\mathbf{F}_7)$; two explicit Golay permutations prove transitivity. This proves uniqueness and gives the automorphism-group order. The group is identified afterward as ${}^3D_4(2):3$, with a central factor $C_2$ for the full lattice group. The reconstruction and deletion arguments parallel the length-$26$ binary code construction.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gerald Höhn. 2026-09-19. The unique extremal threemodular lattice of rank 26, the generalized hexagon $(2,8)$, and the tight Cayley-plane $5$-design. https://arxiv.org/abs/2609.25086

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Hecke Triangle Groups and Dessins d'Enfants

We study finite-index subgroups of the Hecke triangle group $H_q$ of signature $(2,q,\infty)$ through the finite-edge tessellation, special polygons, and the associated dessins. The quotient finite-edge graph is a connected bipartite ribbon graph in which even vertices have degree $1$ or $2$ and odd vertices may have any degree $d\mid q$; geometrically, degree $d$ records a $d$-cluster and an elliptic stabilizer of order $q/d$. We determine two finite ambiguities that arise when one passes from this quotient graph to a special polygon. First, all tree diagrams obtained from a fixed ribbon graph are classified by the possible spanning-tree cuts modulo graph automorphisms. Second, at a proper cluster one must record which cyclic gap contains the omitted branches of the universal $q$-star; every such choice develops to a special polygon. Combining the two gives an explicit finite description of all polygon orbits over a fixed dessin, together with a separate count of normalized realizations in the fixed tessellation. Concrete examples for $H_5$, $H_6$, and $H_7$ illustrate the geometry, and two arithmetic corollaries concern level-$2$ cusp labels and Galois orbits of principal congruence dessins.

math.CO↗

A new simple family of non-periodic tilings with square tiles

We define a new family of non-periodic tilings with square tiles that is mutually locally derivable with some family of tilings with isosceles right triangles. Both families are defined by simple local rules, and the proof of their non-periodicity is as simple as that of the non-periodicity of Robinson's tilings. We also relate the construction to the classical chair tiling: forgetting the decoration, our tilings map almost one-to-one onto the chair, our substitution is essentially a square root of the chair substitution, and our local rules are perfect, defining exactly the family of substitution tilings.

math.CO↗

Partitioning perfect graphs into comparability graphs

We study how many comparability subgraphs are needed to partition the edge set of a perfect graph. We show that many classes of perfect graphs can be partitioned into (at most) two comparability subgraphs and this holds for almost all perfect graphs. On the other hand, we prove that for interval graphs an arbitrarily large number of comparability subgraphs might be necessary.

math.CO↗