Rook Matroids and Their Combinatorial Structures

• Rook matroids are defined from non-nesting rook placements on skew Ferrers boards, where the construction uses occupied rows and unoccupied columns to satisfy the basis-exchange axiom.
• They exhibit robust properties such as closure under duality and direct sums, while distinguishing themselves from lattice-path matroids by avoiding configurations like 332/1.
• Their enumerative theory proves ultra-log-concavity of non-nesting rook polynomials and connects to width-two P-Eulerian polynomials, linking geometry, order theory, and combinatorics.

Searching arXiv for papers on rook matroids and related work. Rook matroids are matroids defined from non-nesting rook placements on skew Ferrers boards. Given a skew shape $\lambda/\mu$ with $r$ rows and $c$ columns, one considers rook placements that are simultaneously non-attacking and non-nesting, and encodes each placement by the union of its occupied row labels and unoccupied column labels. The resulting family of $c$-subsets satisfies the basis-exchange axiom and therefore defines a matroid $R_{\lambda/\mu}$ on the ground set $[r+c]$ (Alexandersson et al., 2024). The theory places these objects at the intersection of Ferrers-board combinatorics, transversal matroid theory, lattice-path matroids, positroids, and the study of log-concavity phenomena in rook and $P$-Eulerian polynomials. Subsequent work has further developed their positroidal structure, including a characterization in terms of Grassmann necklaces and a description of cyclic flats (Jal, 25 Sep 2025).

1. Definition from non-nesting rook placements

Let $\lambda \supset \mu$ be partitions of length at most $r$, and let $B(\lambda/\mu)\subseteq [r]\times[r+c]$ be the skew Ferrers board with rows labeled $r$0 from top to bottom and columns labeled $r$1 from left to right (Alexandersson et al., 2024). A non-attacking rook placement $r$2 is a subset containing at most one cell in each row and at most one cell in each column. Two rooks $r$3 and $r$4 are said to nest if $r$5 and $r$6. A non-nesting rook placement is a non-attacking placement with no nesting pair; the set of such placements is denoted $r$7 (Alexandersson et al., 2024).

For $r$8, let $r$9 denote the occupied rows and let $c$0 denote the unoccupied columns. Then $c$1, and one defines

$c$2

The rook matroid $c$3 is the matroid on ground set $c$4 whose bases are $c$5 (Alexandersson et al., 2024).

The key foundational result is that these sets satisfy the basis-exchange axiom. The proof proceeds by relating placements to transversals of a column-to-row set system

$c$6

and then “straightening” nestings by exchanges within the skew Ferrers board (Alexandersson et al., 2024). In the later formulation of the theory, the same construction is presented as a matroid of rank $c$7 on $c$8 with basis set

$c$9

and the basis-exchange property is cited as established in [AJ–AL, Thm. 3.3], as summarized in (Jal, 25 Sep 2025).

A point requiring care is that the literature contains two closely related descriptions of the placement data, depending on conventions about board dimensions and full versus partial placements. The invariant definition of the matroid is the basis family built from row labels used by the placement and column labels omitted by it. This suggests that the central combinatorial object is not the rook placement alone, but the induced $c$0-subset of the total label set.

2. Basic examples and first structural phenomena

Several examples illustrate the range of behavior of rook matroids. For the $c$1 rectangle $c$2, the number of non-nesting placements of size $c$3 is $c$4, and the resulting rook matroid is isomorphic to a uniform matroid $c$5 (Alexandersson et al., 2024). More generally, in the positroidal treatment, for a rectangular board $c$6 with $c$7 and $c$8, one has $c$9 (Jal, 25 Sep 2025). Its Grassmann necklace is explicitly

$R_{\lambda/\mu}$0

cyclically, and there are no nontrivial inner- or outer-corner cyclic flats (Jal, 25 Sep 2025).

A more distinctive skew example arises from $R_{\lambda/\mu}$1 and $R_{\lambda/\mu}$2, where $R_{\lambda/\mu}$3 and $R_{\lambda/\mu}$4. In this case there are exactly $R_{\lambda/\mu}$5 non-nesting placements of $R_{\lambda/\mu}$6 rooks, so $R_{\lambda/\mu}$7 has $R_{\lambda/\mu}$8 bases of size $R_{\lambda/\mu}$9 (Jal, 25 Sep 2025). The associated Grassmann necklace is listed explicitly as

$[r+c]$0

and the inner corners at cells $[r+c]$1 and $[r+c]$2 yield cyclic flats that reflect the nontrivial geometry of the matroid (Jal, 25 Sep 2025).

One example is especially important for separating rook matroids from lattice-path matroids. For $[r+c]$3, one has $[r+c]$4 and $[r+c]$5, and the rank-$[r+c]$6 bases are

$[r+c]$7

This family fails basis exchange and therefore cannot be the full basis set used in the defining construction (Alexandersson et al., 2024). At the same time, the same skew shape yields a rook matroid isomorphic to $[r+c]$8, the rank-$[r+c]$9 quaternary excluded minor for lattice-path matroids (Alexandersson et al., 2024). The example therefore serves as a structural obstruction rather than a failure of the rook-matroid definition itself.

This dual role of $P$0 is central: it identifies a specific skew subshape at which rook matroids diverge from lattice-path matroids, while still remaining inside the broader classes of transversal matroids and positroids.

3. Closure properties and relations to other matroid classes

Rook matroids satisfy several natural closure properties. If $P$1 is the conjugate skew shape, then

$P$2

so the class is closed under duality (Alexandersson et al., 2024). It is also closed under direct sums:

$P$3

where the Ferrers diagrams are appended northeast of one another (Alexandersson et al., 2024).

By contrast, rook matroids are not minor-closed. Deleting a row or column corresponds to removing that row or column from the skew shape, and contraction has an analogous interpretation, but the class fails closure under taking minors: for example, $P$4 is not a rook matroid (Alexandersson et al., 2024). This non-minor-closed behavior distinguishes the class from many familiar matroid families defined by forbidden-minor characterizations.

Rook matroids lie inside several broader matroid classes. First, they are transversal matroids. Using the set system

$P$5

one obtains a transversal presentation, and $P$6 is the transversal matroid of $P$7 (Alexandersson et al., 2024). The later positroid-focused account phrases this as an embedding into the transversal matroid of the bipartite graph $P$8 determined by the board, with the non-nesting restriction selecting a subfamily of transversals while preserving matroidality (Jal, 25 Sep 2025).

Second, rook matroids are closely related to lattice-path matroids. If $P$9 and $\lambda \supset \mu$0 are the upper and lower boundary paths of $\lambda \supset \mu$1, then the lattice-path matroid $\lambda \supset \mu$2 is another transversal matroid on the same ground set, constructed from admissible east-step indices in each column (Alexandersson et al., 2024). There is a bijection between non-crossing or non-nesting placements and lattice paths obtained by sending rooks to valleys of a path, and this yields

$\lambda \supset \mu$3

Moreover,

$\lambda \supset \mu$4

equivalently iff $\lambda \supset \mu$5 is not a minor (Alexandersson et al., 2024). The same source states that the isomorphism can be made explicit via a “spine path” and a “path permutation.” The Tutte polynomials also coincide:

$\lambda \supset \mu$6

(Alexandersson et al., 2024).

Third, rook matroids are positroids. In the initial treatment, this is shown using Oh’s criterion: for the natural labeling $\lambda \supset \mu$7 on rows and $\lambda \supset \mu$8 on columns, the Grassmann necklace term $\lambda \supset \mu$9 is the lexicographically minimal basis in the $r$0-order, and one checks that it is the $r$1-extremal rook placement (Alexandersson et al., 2024). The later work gives a new proof through sort-closedness: if $r$2 are bases arising from non-nesting rook placements, then the sorted pairs $r$3 and $r$4 also arise from non-nesting rook placements, so the basis family is sort-closed, and hence the matroid is a positroid by the Lam–Postnikov criterion (Jal, 25 Sep 2025).

4. Grassmann necklaces, positroidal characterization, and cyclic flats

A major refinement of the theory is the characterization of rook matroids among positroids by means of Grassmann necklaces (Jal, 25 Sep 2025). For a loop- and coloop-free positroid $r$5 of rank $r$6 on $r$7, with Grassmann necklace

$r$8

the paper introduces row and column data extracted from each $r$9:

$B(\lambda/\mu)\subseteq [r]\times[r+c]$0

$B(\lambda/\mu)\subseteq [r]\times[r+c]$1

together with ordered complements

$B(\lambda/\mu)\subseteq [r]\times[r+c]$2

The main theorem states that $B(\lambda/\mu)\subseteq [r]\times[r+c]$3 for some skew shape $B(\lambda/\mu)\subseteq [r]\times[r+c]$4 if and only if five explicit conditions hold, including the normalization $B(\lambda/\mu)\subseteq [r]\times[r+c]$5, inequalities governing the row minima and column maxima, and compatibility rules that produce inner-corner and outer-corner data from gaps in the necklace (Jal, 25 Sep 2025). In that case the skew board $B(\lambda/\mu)\subseteq [r]\times[r+c]$6 is uniquely recovered from the inner- and outer-corner sets $B(\lambda/\mu)\subseteq [r]\times[r+c]$7, and the necklace of $B(\lambda/\mu)\subseteq [r]\times[r+c]$8 is exactly $B(\lambda/\mu)\subseteq [r]\times[r+c]$9 (Jal, 25 Sep 2025).

This result answers a question of Thomas Lam and gives an intrinsic recognition theorem for rook matroids inside the class of positroids (Jal, 25 Sep 2025). Conceptually, it replaces the external Ferrers-board construction by internal necklace data. A plausible implication is that rook matroids can be studied through the combinatorial infrastructure of positroids without always referring back to rook placements.

The same work identifies an important subclass of cyclic flats. In a rook matroid $r$00, the essential cyclic flats are the cyclic intervals associated to inner and outer corners of the skew shape (Jal, 25 Sep 2025). If $r$01 is an inner corner, then

$r$02

is a cyclic flat of rank

$r$03

If $r$04 is an outer corner, then

$r$05

is a cyclic flat of rank

$r$06

(Jal, 25 Sep 2025).

These connected cyclic flats generate the facet-defining inequalities of the base polytope:

$r$07

$r$08

$r$09

(Jal, 25 Sep 2025). This description makes the positroidal geometry of rook matroids concrete and links the Ferrers-board combinatorics directly to polyhedral data.

5. Enumerative theory and ultra-log-concavity

For a skew shape $r$10 with $r$11 columns, the non-nesting rook polynomial is defined by

$r$12

where $r$13 is the number of non-nesting placements of size $r$14 (Alexandersson et al., 2024). A multivariate refinement is the basis polynomial

$r$15

This polynomial records the row/column encoding that defines the matroid itself (Alexandersson et al., 2024).

The central enumerative result is ultra-log-concavity. The argument invokes the Stanley–Yan theorem: for any matroid $r$16 on ground set $r$17 and subset $r$18, if

$r$19

then the sequence $r$20 is ultra-log-concave with no internal zeros (Alexandersson et al., 2024). Applying this to $r$21 and $r$22 equal to the set of row labels gives the inequality

$r$23

so the coefficient sequence of $r$24 is ultra-log-concave (Alexandersson et al., 2024).

This contrasts sharply with the classical theory of unrestricted rook placements. The non-nesting rook polynomial need not be real-rooted in general; an explicit counterexample is given by the skew shape $r$25 (Alexandersson et al., 2024). Thus the principal regularity property is ultra-log-concavity rather than real-rootedness. This distinction is structurally important: it shows that the matroidal mechanism supplies strong coefficient inequalities even when zero distributions of the generating polynomial do not exhibit the strongest expected behavior.

Additional symmetry phenomena occur in special cases. The polynomial $r$26 is palindromic if and only if $r$27 decomposes into “squarecases,” described as the condition that outer corners lie on the northwest diagonal (Alexandersson et al., 2024). In that situation $r$28 is $r$29-positive and satisfies

$r$30

(Alexandersson et al., 2024). These results place non-nesting rook polynomials in a broader family of enumerative objects where strong coefficient constraints survive in the absence of general real-rootedness.

6. Width-two posets and $r$31-Eulerian polynomials

One of the most consequential applications of rook matroids is to the Eulerian theory of width-two posets (Alexandersson et al., 2024). Starting from the spine path of a skew shape, the rows and columns are labeled by the steps of that path: north steps are labeled bottom-to-top and east steps left-to-right, producing two chains $r$32 and $r$33 of lengths $r$34 and $r$35 (Alexandersson et al., 2024). Cover relations are then imposed as follows: for each outer corner one declares $r$36 with $r$37 and $r$38, while for each inner corner one declares $r$39 (Alexandersson et al., 2024). The resulting poset is a naturally labeled width-two poset $r$40.

The multivariate $r$41-Eulerian polynomial is defined by

$r$42

where

$r$43

and

$r$44

(Alexandersson et al., 2024). The key theorem states that under the bijection between the skew shape and the width-two poset,

$r$45

and in particular the specialization $r$46, $r$47 recovers the non-nesting rook polynomial $r$48 (Alexandersson et al., 2024).

As a consequence, for any naturally labeled width-two poset $r$49, the univariate $r$50-Eulerian polynomial $r$51 is ultra-log-concave (Alexandersson et al., 2024). The same result states that the stronger multivariate polynomial is Lorentzian (Alexandersson et al., 2024). In the language of conjectural Eulerian positivity and log-concavity, this establishes that the log-concavity part of Brenti’s conjecture holds for width $r$52, and it “completes the story of the Neggers–Stanley conjecture for naturally labeled width two posets” (Alexandersson et al., 2024).

The significance of this correspondence is methodological as well as enumerative. It transfers a matroid-theoretic coefficient theorem to a poset-linear-extension problem by way of a geometric-combinatorial encoding through skew Ferrers boards. This suggests that rook matroids function as an intermediary object connecting matroid basis enumeration and descent-type statistics on linear extensions.

7. Position within current research

The initial development of rook matroids establishes a self-contained framework including definitions, structural theorems, connections to transversal matroids, lattice-path matroids, and positroids, together with enumerative consequences for non-nesting rook polynomials and $r$53-Eulerian polynomials (Alexandersson et al., 2024). A central message is that non-nesting restrictions, unlike classical rook-placement conditions, produce a matroidal class with unusually rich interaction between geometry, enumeration, and order theory.

Subsequent work shifts emphasis to the positroidal viewpoint (Jal, 25 Sep 2025). The Grassmann-necklace characterization gives necessary and sufficient conditions for a positroid to arise as a rook matroid, thereby answering a question of Lam. The determination of essential cyclic flats and corresponding facet inequalities further situates rook matroids within the combinatorics of positroid polytopes (Jal, 25 Sep 2025). This indicates that the class is not merely a special family of transversal matroids defined by Ferrers-board data, but also a recognizable subclass of positroids with explicit necklace and polyhedral signatures.

Several structural boundaries are now clear. Rook matroids are closed under duals and direct sums but not minors (Alexandersson et al., 2024). They coincide with lattice-path matroids exactly in the $r$54-avoiding regime, and the appearance of $r$55 marks the obstruction (Alexandersson et al., 2024). Their enumerative generating polynomials are ultra-log-concave, but not generally real-rooted (Alexandersson et al., 2024). These contrasts are not incidental; they delineate a class that is simultaneously robust enough to support matroidal and positroidal machinery, yet narrow enough to display distinctive behavior not shared by better-known families.

Within algebraic and geometric combinatorics, rook matroids therefore occupy a specific niche: they encode non-nesting configurations on skew Ferrers boards as bases of matroids, inherit transversal and positroidal structure, interface sharply with lattice-path matroids through the excluded configuration $r$56, and furnish a matroid-based route to ultra-log-concavity results for width-two $r$57-Eulerian polynomials (Alexandersson et al., 2024, Jal, 25 Sep 2025).