Search arXivSearch

arXiv · 2605.25727

A Bruhat order for Latin squares and alternating sign hypermatrices

Abstract

The Bruhat order on permutation matrices extends to alternating sign matrices via corner-sum matrices, where the order is given by entrywise domination. A classical result of Lascoux and Schützenberger states that alternating sign matrices form the Dedekind-MacNeille completion of the Bruhat order on permutations. Brualdi and Dahl introduced alternating sign hypermatrices as a three-dimensional analogue of alternating sign matrices and used them to generalise Latin squares, which may be viewed as three-dimensional analogues of permutation matrices. In this paper, in analogy with the two-dimensional case, we define and study a Bruhat order $\preceq_B$ on Latin squares and alternating sign hypermatrices. We introduce the corresponding corner-sum hypermatrices $\mathcal C_n$ and prove that entrywise domination on $\mathcal C_n$ encodes this order. We show that $\mathcal C_n$ is a distributive lattice, but that, unlike in dimension two, it is not the Dedekind-MacNeille completion of the poset of Latin squares. We further characterise the covering relations for $\mathcal C_n$ and prove rank formulae generalising the classical case of alternating sign matrices. Finally, we define monotone hypertriangles, prove that they are in bijection with $\mathcal C_n$, and show that they also encode the order by entrywise domination.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Angela Carnevale, Cian O'Brien. 2026-05-25. A Bruhat order for Latin squares and alternating sign hypermatrices. https://arxiv.org/abs/2605.25727

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