Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2007.15163

Octonions and the two strictly projective tight 5-designs

Benjamin Nasmith
View original source ↗Read source document ↗Export metadata ↓

Abstract

In addition to the vertices of the regular hexagon and icosahedron, there are precisely two strictly projective tight 5-designs: one constructed from the short vectors of the Leech lattice and the other corresponding to a generalized hexagon structure in the octonion projective plane. This paper describes a new connection between these two strictly projective tight 5-designs -- a common construction using octonions. Certain octonion involutionary matrices act on a three-dimensional octonion vector space to produce the first 5-design and these same matrices act on the octonion projective plane to produce the second 5-design. This result uses the octonion construction of the Leech lattice due to Robert Wilson and provides a new link between the generalized hexagon Gh(2,8) and the Leech lattice.

Explore related subjects

math.COmath.GR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Benjamin Nasmith. 2022-09-03. Octonions and the two strictly projective tight 5-designs. https://doi.org/10.5802/alco.215

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

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗