pith. sign in

arxiv: 2512.23006 · v1 · submitted 2025-12-28 · 🧮 math.CO

On subdivisions of the permutahedron and flags of lattice path matroids

Carolina Benedetti This is my paper

Pith reviewed 2026-05-16 19:21 UTC · model grok-4.3

classification 🧮 math.CO
keywords permutahedronBruhat interval polytopeslattice path matroidspositroidsflag varietyhyperplane splitspolytope subdivisions
0
0 comments X

The pith

Subdivisions of the permutahedron into Bruhat interval polytopes arise uniquely from lattice path matroid flags via hyperplane splits.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper studies how the permutahedron can be divided into two subpolytopes corresponding to flags of lattice path matroids. It establishes that the coarsest such divisions are the only ones that can be achieved by cutting the permutahedron with a hyperplane to obtain Bruhat interval polytopes. The specific hyperplanes that produce these polytopes are described in detail. These subdivisions connect to points in the complete nonnegative flag variety.

Core claim

The coarsest subdivisions of the permutahedron Π_n into subpolytopes corresponding to flags of lattice path matroids are the only subdivisions of Π_n via hyperplane splits into subpolytopes corresponding to Bruhat interval polytopes. The hyperplanes whose intersection with Π_n give rise to these BIPs are described, showing that the subdivisions are polytopes coming from points in the complete nonnegative flag variety.

What carries the argument

Bruhat interval polytope defined as the convex hull of all permutations in a Bruhat interval [u,v] in the symmetric group S_n, used to characterize the hyperplane splits of the permutahedron.

If this is right

  • These subdivisions correspond exactly to points in the complete nonnegative flag variety.
  • The hyperplanes for producing BIPs are explicitly characterized.
  • Coarsest LPFM subdivisions are the unique hyperplane splits for BIPs.
  • Subpolytopes are flags of positroids in particular lattice path matroids.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • This may allow enumeration of all such splits for small n to verify the classification.
  • Connections to other positroid subdivisions could be explored using similar hyperplane techniques.
  • The link to the flag variety suggests algebraic interpretations for the combinatorial splits.

Load-bearing premise

The relevant subdivisions of the permutahedron are precisely those into two subpolytopes from flags of positroids or lattice path matroids, where BIPs are convex hulls of Bruhat intervals.

What would settle it

A hyperplane split of the permutahedron into two BIPs that does not correspond to any flag of lattice path matroids would disprove the uniqueness claim.

Figures

Figures reproduced from arXiv: 2512.23006 by Carolina Benedetti.

Figure 1
Figure 1. Figure 1: A basis in the diagram of the LPM M[1246, 3568]. d1 < · · · < ds−1 < ds. Such a flag F can be thought of as a full rank ds×n matrix A whose first di rows are a basis for Vi , for all i. Hence, such a matrix A represents a sequence of matroids (M1, . . . , Ms−1, Ms) on [n] where Mi is the matroid represented by the submatrix Ai formed by the first di-rows of A. The flag F is a full flag if s = n. The partia… view at source ↗
Figure 2
Figure 2. Figure 2: Left: M = M[1247, 3568]. Center: elementary quotient of M. Right: a (not elementary) quotient of M. Remark 3.9. Definition 3.1 is a particular case of strong maps between matroids (see [23]). Our choice of notation M ≤q N whenever M is a quotient of N is inspired by the fact that matroids on a fixed ground set can be endowed with a partial order structure ≤ such that M ≤ N if and only if M ≤q N. In [1] the… view at source ↗
Figure 3
Figure 3. Figure 3: Left: Π4 obtained as the uniform flag. Right: an LPFM poly￾tope with two of its vertices highlited. 9 [PITH_FULL_IMAGE:figures/full_fig_p009_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: ℓ1 is a good pair with either 2, 6, 8. It is known that the 2-dimensional faces of Πn are either hexagonal or quadrilateral. Using [11, Theorem 4.3], [7, Theorem A] one has that a hyperplane H gives a split of Πn into flags of positroids corresponding to BIPs if quadrilaterals do not split, and if a hexagonal face splits then the minimal and maximal permutations of that face are in distinct sides of H. Def… view at source ↗
Figure 5
Figure 5. Figure 5: Left: Bad H-split with H : x1 + x2 = 5. Right: Bad H-split with H : x3 = 3 Proposition 4.5. Consider a split of Πn with maximal cells F1, F2. If F1 and F2 are Bruhat interval polytopes then they are LPFMs. Proof. Since F1 and F2 correspond to two intervals whose union is Πn, we can assume without loss of generality that e ∈ F1, and hence ω ∈ F2. That is the Bruhat interval of F1 and F2 are of the form [e, … view at source ↗
Figure 6
Figure 6. Figure 6: Left: Flag F corresponding to [e, 316542]. Right: dual of F corresponding to [461235, ω] Elaborating on Remark 4.6 it follows that [e, v] ∗ = [v ∗ , ω] and [u, ω] ∗ = [e, u∗ ]. Letting H be the affine span of F1 ∩ F2, we define the dual of the split hyperplane H, or simply, the dual of the H-split as the hyperplane H∗ -split of Πn where H∗ is the affine span of F ∗ 1 ∩F ∗ 2 where F ∗ 1 , F∗ 2 are the polyt… view at source ↗
Figure 7
Figure 7. Figure 7: Poset L4 of split subdivisions of Π4 by refinement. In [7, [PITH_FULL_IMAGE:figures/full_fig_p018_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: A refinement of two minimal elements of L4 that is not in L4. Nonetheless, an observation regarding this problem is that some obvious common re￾finements come from hyperplanes with the same normals and different level sets. For instance, in L5 a subdivision comes from the common refinement of the hyperplanes x1 = 2, x1 = 3, x1 = 4. On the other hand, notice from [PITH_FULL_IMAGE:figures/full_fig_p019_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Finest subdivisiones of Π4 as points in maximal cones of fan structure of T r>0Fl4 dual to the associahedron. Finally, we point out that in [21] (see also [13]) the authors study decompositions of Πn into cubes, which turn out to be BIPs. Notice that the finest subdivisions of Π4 into LPFMs are such that not all of its maximal faces are cubes. However, we would like to understand which LPFMs are cubes. Ref… view at source ↗
read the original abstract

In this manuscript we study the subdivisions of the permutahedron $\Pi_n$ into two subpolytopes corresponding to flags of positroids, which are in particular flags of lattice path matroids (LPFMs). A subpolytope $P_{[u,v]}$ of $\Pi_n$ is a Bruhat Interval Polytope (BIP) if $P_{[u,v]}$ is the convex hull of all the permutations (viewed as points in $\RR^n$) in the interval $[u,v]$ in the Bruhat order of $\S_n$. We show that the coarsest subdivisions we obtain into LPFMs are the only subdivisions of $\Pi_n$ via hyperplane splits, into subpolytopes corresponding to BIPs. More specifically, we describe the hyperplanes whose intersection with $\Pi_n$ give rise to BIPs. Hence, these subdivisions are polytopes coming from points in the complete nonnegative flag variety.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The manuscript studies subdivisions of the permutahedron Π_n into two subpolytopes corresponding to flags of positroids (in particular, flags of lattice path matroids, or LPFMs). It defines a Bruhat interval polytope (BIP) P_{[u,v]} as the convex hull of the points in ℝ^n corresponding to permutations in a Bruhat interval [u,v] ⊆ S_n. The central claims are that the coarsest hyperplane subdivisions of Π_n into LPFM subpolytopes are precisely the subdivisions into BIPs, and that the splitting hyperplanes are explicitly describable; consequently these subdivisions arise from points in the complete nonnegative flag variety.

Significance. If the proofs are complete, the explicit characterization of the splitting hyperplanes and the identification of the coarsest LPFM subdivisions with BIPs would provide a concrete combinatorial bridge between the polyhedral geometry of the permutahedron, the Bruhat order on S_n, and the geometry of positroid varieties. The result supplies a parameter-free description of certain hyperplane splits and ties them directly to flag varieties, which could be useful for further work on positroid subdivisions and their combinatorial invariants.

minor comments (3)
  1. [§2] §2: The definition of lattice path matroids and their flags is introduced via reference to prior work; adding a self-contained example for small n (e.g., n=3 or 4) would improve readability without lengthening the paper substantially.
  2. [Abstract and §4] The statement that the subdivisions 'are the only subdivisions of Π_n via hyperplane splits, into subpolytopes corresponding to BIPs' would benefit from an explicit sentence clarifying whether the result is restricted to two-piece splits or extends to multi-piece subdivisions.
  3. [§5] Figure captions and the statement of the main theorem could cross-reference the precise equation or proposition number that gives the hyperplane description, to make the logical flow easier to follow.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript, the clear summary of our results, and the recommendation for minor revision. We have incorporated several clarifications to improve readability and have addressed all points raised in the report.

Circularity Check

0 steps flagged

No circularity detected; derivation is self-contained

full rationale

The manuscript defines Bruhat interval polytopes (BIPs) directly as convex hulls of permutations in a Bruhat interval [u,v] and studies their relation to flags of lattice path matroids via hyperplane splits of the permutahedron. The central claim—that the coarsest such splits are precisely those producing BIPs—is presented as a theorem to be proved from the definitions of the Bruhat order, positroids, and matroid flags, none of which are shown to reduce to fitted inputs, self-referential equations, or load-bearing self-citations within the paper. No ansatz smuggling, renaming of known results, or uniqueness theorems imported from the authors' prior work appear in the provided text. The derivation therefore rests on independent combinatorial facts rather than circular reduction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The paper builds on established objects from prior literature: the permutahedron, Bruhat order on S_n, positroids, lattice path matroids, and the nonnegative flag variety. No new free parameters or invented entities are introduced in the abstract.

axioms (2)
  • standard math Standard properties of the Bruhat order on the symmetric group S_n and convex hulls of permutation points
    Invoked to define Bruhat interval polytopes (BIPs) as convex hulls of intervals [u,v].
  • domain assumption Definitions and basic properties of positroids and lattice path matroids (LPFMs)
    Used to identify the subpolytopes in the subdivisions of Π_n.

pith-pipeline@v0.9.0 · 5451 in / 1327 out tokens · 44717 ms · 2026-05-16T19:21:46.219671+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

24 extracted references · 24 canonical work pages

  1. [1]

    Carolina Benedetti, Anastasia Chavez, and Daniel Tamayo,Quotients of uniform matroids, Elec. J. Comb.29(2022), no. 1. 7

    work page 2022

  2. [2]

    3, 621–650

    Carolina Benedetti-Vel´ asquez and Kolja Knauer,Lattice path matroids and quotients, Combinatorica 44(2024), no. 3, 621–650. MR 4748225 2, 3, 6, 7, 10, 14

    work page 2024

  3. [3]

    7, 937–951

    Stefan Blum,Base-sortable matroids and koszulness of semigroup rings, European Journal of Com- binatorics22(2001), no. 7, 937–951. 1

    work page 2001

  4. [4]

    Joseph Bonin, Anna de Mier, and Marc Noy,Lattice path matroids: enumerative aspects and Tutte polynomials, J. Combin. Theory Ser. A104(2003), no. 1, 63–94. MR 2018421 1

    work page 2003

  5. [5]

    Bonin, Anna de Mier, and Marc Noy,Lattice path matroids: enumerative aspects and Tutte polynomials, J

    Joseph E. Bonin, Anna de Mier, and Marc Noy,Lattice path matroids: enumerative aspects and Tutte polynomials, J. Combin. Theory Ser. A104(2003), no. 1, 63–94. 4

    work page 2003

  6. [6]

    Jonathan Boretsky,Totally nonnegative tropical flags and the totally nonnegative flag dressian, arxiv:2208.09128v2 (2022). 20

    work page arXiv 2022

  7. [7]

    and Number Theroy18(2024), no

    Jonathan Boretsky, Chris Eur, and Lauren Williams,Polyhedral and tropical geometry of flag positroids, Alg. and Number Theroy18(2024), no. 7, 1333–1374. 2, 3, 6, 12, 17, 18, 20

    work page 2024

  8. [8]

    Borovik, I

    Alexandre V. Borovik, I. M. Gelfand, and Neil White,Coxeter matroids, pp. 151–197, Birkh¨ auser Boston, Boston, MA, 2003. 6, 8, 10, 13

    work page 2003

  9. [9]

    Selected papers based on the presentations at the workshop, Magdeburg, Germany, September 14–16, 2017, Cham: Springer, 2022, pp

    Amanda Cameron, Rodica Dinu, Mateusz Micha lek, and Tim Seynnaeve,Flag matroids: algebra and geometry, Interactions with lattice polytopes. Selected papers based on the presentations at the workshop, Magdeburg, Germany, September 14–16, 2017, Cham: Springer, 2022, pp. 73–114 (English). 6

    work page 2017

  10. [10]

    Gelfand, R.M

    I.M. Gelfand, R.M. Goresky, R.D. MacPherson, and V.V. Serganova,Combinatorial geometries, convex polyhedra, and schubert cells, Advances in Mathematics63(1987), no. 3, 301–316. 1 21

    work page 1987

  11. [11]

    19, 16748– 16777

    Michael Joswig, Georg Loho, Dante Luber, and Jorge Alberto Olarte,Generalized permutahedra and positive flag dressians, International Mathematics Research Notices2023(2023), no. 19, 16748– 16777. 3, 10, 12, 20

    work page 2023

  12. [12]

    Michael Joswig and Benjamin Schroter,Matroids from hypersimplex splits, JCTA151(2017), 254–

    work page 2017

  13. [13]

    Allen Knutson, Mario Sanchez, and Melissa Sherman-Bennett,Permutahedral subdivisions and class formulas from coxeter elements, S´ eminaire Lotharingien de Combinatoire (2025). 21

    work page 2025

  14. [14]

    in Math.244(2013), 979–1032

    Yuji Kodama and Lauren Williams,The deodhar decomposition of the grassmannian and the regularity of kp solitons, Adv. in Math.244(2013), 979–1032. 4, 12

    work page 2013

  15. [15]

    ,The full kostant-toda hierarchy on the positive flag variety, Commun. Math. Phys335(2015), 247–283. 2, 10

    work page 2015

  16. [16]

    21, Oxford University Press, Oxford, 2011

    James Oxley,Matroid theory, second ed., Oxford Graduate Texts in Mathematics, vol. 21, Oxford University Press, Oxford, 2011. MR 2849819 3

    work page 2011

  17. [17]

    Alexander Postnikov,Total positivity, grassmannians, and networks, 2006. 1

    work page 2006

  18. [18]

    6, 1026–1106

    ,Permutohedra, associahedra, and beyond, International Mathematics Research Notices2009 (2009), no. 6, 1026–1106. 7

    work page 2009

  19. [19]

    13, 207–273

    Alexander Postnikov, Victor Reiner, and Lauren Williams,Faces of generalized permutohedra, Doc- umenta Mathematica2008(2009), no. 13, 207–273. 7, 10, 11

    work page 2009

  20. [20]

    Ayush Tewari and Ahmed Umer Ashraf,Lattice path matroidal subdivisions, positive grassmannian and amplituhedron, arxiv:2307.04180 (202e). 4

    work page arXiv

  21. [21]

    Vasu Tewari and Phillip Nadeau,Lattice path matroidal subdivisions, positive grassmannian and amplituhedron, Forum of Mathematics, Sigma (2023). 21

    work page 2023

  22. [22]

    in Math.285(2015), 766–810

    Emanuel Tsukerman and Lauren Williams,Bruhat interval polytopes, Adv. in Math.285(2015), 766–810. 10

    work page 2015

  23. [23]

    Neil White (editor),Theory of matroids, Cambridge University Press, 1986. 5, 7

    work page 1986

  24. [24]

    Ziegler,Lectures on polytopes, Grad

    G¨ unter M. Ziegler,Lectures on polytopes, Grad. Texts Math., vol. 152, Berlin: Springer-Verlag, 1995 (English). 7 (C. Benedetti)Department of Mathematics, Universidad de los Andes Email address:c.benedetti@uniandes.edu.co 22

    work page 1995