Search arXivSearch

arXiv · 2511.03040

A partial order on the 240 packings of PG(3,2)

Abstract

It has long been known that the most symmetrical solutions of Kirkman's Schoolgirl Problem can be constructed from the $240$ packings of the projective space $PG(3, 2)$, but it seems to have escaped notice that these packings have the structure of a partially ordered set. In this paper, we construct a shellable Bruhat-like graded partial order on the packings of $PG(3, 2)$ that refines the partial order on the product of four chains $[8]\times[5]\times[3]\times[2]$ and defines a Lehmer code on the packings. The partial order exists because the packings of $PG(3, 2)$ form a quasiparabolic set (in the sense of Rains--Vazirani) that is in bijective correspondence with a certain collection of maximal orthogonal subsets of the $E_8$ root system. The $E_8$ construction also induces transitive actions of the Weyl groups of type $D_n$ on the packings for $5 \leq n \leq 8$, and these actions are faithful for $n < 8$. It is possible to define both the signed permutation action and the partial order using the combinatorics of labelled Fano planes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

R. M. Green. 2025-11-04. A partial order on the 240 packings of PG(3,2). https://arxiv.org/abs/2511.03040

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