Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2608.27762

Integral Orders for the Okubo Algebra and Idempotent Geometries of the $E_8$ Lattice

Daniele Corradetti·Alessio Marrani
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the Coxeter-Dickson $E_8$ order as a common integral support for the octonionic, para-octonionic and compact real Okubo products. The three algebra structures have the same additive lattice, the same positive composition norm and hence the same $240$ norm-one vectors, namely the roots of $E_8$ and the vertices of the Gosset polytope $4_{21}$. Their multiplicative structures are nevertheless different and this difference is already visible in the idempotents: among the same $240$ roots one finds respectively $1$, $57$ and $12$ nonzero integral idempotents. We show that these three counts organize the common root system in three increasingly polarized ways. The octonionic product leaves the full $E_8$ geometry unseparated; the $57$ para-octonionic idempotents reproduce the $E_7$ contact decomposition $1+56+126+56+1$; the $12$ Okubo idempotents split into four mutually orthogonal oriented $A_2$ triangles and hence determine canonically an $A_2^4$ subsystem. Choosing one triangle as the external $A_2$ then yields the $A_2+E_6$ Magic Star, while the remaining nine idempotents determine the trinification subsystem $A_2^3\subset E_6$. This provides an arithmetic interpretation of the $E_8\supset E_7$ and $E_8\supset E_6+A_2$ decompositions directly from integral idempotents.

Explore related subjects

math.RA

Keep this discovery

BibTeXRIS

Daniele Corradetti, Alessio Marrani. 2026-08-27. Integral Orders for the Okubo Algebra and Idempotent Geometries of the $E_8$ Lattice. https://arxiv.org/abs/2608.27762

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

KEEP EXPLORING

Related papers

arXiv2026

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA↗
arXiv2026

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA↗
arXiv2026

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA↗