Search arXivSearch

arXiv · 2606.17393

Perfect matchings, Fano planes, and orthogonal bases of type $E_8$

Abstract

We use perfect matchings and labelled Fano planes to construct and study the $2025$ orthogonal bases of positive roots in the $E_8$ root system. The set of these bases forms a highly structured, Bruhat-like graded poset $(Ω, \leq_Q)$ whose rank function can be computed from the cardinalities of so-called generalized Rothe diagrams. We give combinatorial characterizations of these diagrams in terms of matchings and Fano planes, and we explain how to compute the ranks of the elements of $Ω$ using suitable combinatorial statistics such as the weights of perfect matchings. We establish simple formulas for the rank generating functions of $Ω$ and of its 50 congruence classes under a natural order congruence relation. Our derivation of the generating functions contains some intermediate results on general perfect matchings and labelled Fano planes that can be stated without mentioning root systems and may be of independent interest.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

R. M. Green, Tianyuan Xu. 2026-06-16. Perfect matchings, Fano planes, and orthogonal bases of type $E_8$. https://arxiv.org/abs/2606.17393

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO