Ehrhart positivity for paving positroids
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.
Ada: I'm Ada.
Emmy: And I'm Emmy, here with Kolya.
Ada: We're looking at the paper: "Ehrhart positivity for paving positroids".
Emmy: Here's the gist of the paper. A central conjecture of Ferroni, Jochemko, and Schröter posits that every positroid is Ehrhart positive; this paper proves that the base polytope of any paving positroid has positive Ehrhart coefficients Ehrhart positivity means a lattice polytope P is said to be Ehrhart positive if all coefficients ci > 0 for all i.
Ada: While this has been verified for classes like lattice path matroids and series-parallel matroids, the general conjecture remains open The paper focuses on the Ehrhart positivity of paving positroid.
Emmy: Geometric Description of Paving Positroids The geometry of paving positroids is described by cyclic interval constraints and disjoint forbidden regions Lemma 2.1 states that for a connected rank-r paving positroid on a cyclically ordered set E of size n, the base polytope P(M) is given by P(M) = conv
x ∈ ∆(r, n): x(Hi) ≤ r − 1 for 1 ≤ i ≤ l: .
Ada: Each Hi is an interval in the same cyclic order, and Hi ∩ Hj ≤ r − 2 (where 1 ≤ i < j ≤ l).
Paper summary: Ada: So we're wrapping up this talk on Ehrhart positivity for paving positroids by Liu and Zhang. They started by looking at a big conjecture about every positroid being Ehrhart positive, and they focused their work on the paving case.
Emmy: Their finding is that for any paving positroid, the base polytope of that matroid has positive Ehrhart coefficients, which is a significant step forward because some other examples were known not to be positive <ref:2610.21501#pg2>.
Kolya: What this means in simpler terms for someone who just wants to know what it changes is that we have found a new class of positroids that we can guarantee have positive Ehrhart polynomials, moving beyond what was previously known.
Ada: They proved that the structure of paving positroid base polytopes, defined by those cyclic interval constraints and disjoint forbidden regions, results in coefficients for the Ehrhart polynomial that are all strictly positive up to a certain degree.
Emmy: The authors used a rooted count and a binomial transform to show that this positivity holds through an identity involving integration over v from zero to one. This connection between the combinatorial counting and the geometric shape is where they make their main structural point <ref:2610.21501#pg5>.
Kolya: The limitation they flag, which is important for us to know, is that this proof only works for paving positroids; it doesn't cover every single type of positroid out there. They specifically focused on the structure imposed by those cyclic interval constraints.
Ada: So the implication is that even though we still don't have a general proof for all positroids, we now have a concrete, proven class—paving ones—where we know exactly what the coefficients look like and that they are positive.
Emmy: It’s about showing that the geometric constraints defining these paving structures force the resulting polynomial to behave nicely with respect to counting lattice points. That connection between geometry and counting is what makes this result interesting for algebraic geometry too <ref:2610.21501#pg3>.
Conclusion: Ada: So, we're wrapping up this talk on Ehrhart positivity for paving positroids by Liu and Zhang. They focused on showing that even in this specific class of matroids, the geometric shapes they describe have positive lattice point counts inside them.
Emmy: Exactly. The main point is that for any paving positroid, the base polytope—the geometric shape defined by those cyclic interval constraints—always has positive Ehrhart coefficients up to a certain degree. It’s a very specific result tied directly to how those forbidden regions are arranged cyclically.
Kolya: From my side, what this means is that we have a concrete class of objects where the counting function behaves predictably and positively. It confirms that the structure of paving positroids isn't just random geometry; it imposes enough constraints to guarantee these positive coefficients hold.
Ada: Right, so they’ve taken a very broad conjecture about all positroids and found a specific family where the answer is yes, definitively showing those coefficients are all strictly greater than zero in that range. It settles that part of the question for paving structures.
Emmy: And the way they proved it uses this connection between counting and integration—that root summation identity involving that binomial transform—to show those positive coefficients aren't just theoretical; they arise from a solid structure in the underlying geometry.
Kolya: The caveat, as always, is that this proof is strictly for paving positroids. It doesn't cover every single positroid out there; it’s focused on those specific cyclic interval constraints they defined earlier. We still need to figure out how to handle the other cases where the structure isn't quite as regular.
Ada: So, the title itself, "Ehrhart positivity for paving positroids," points directly at this success with paving structures, suggesting that understanding the geometry of those specific interval constraints is a key step toward solving that broader problem.
Emmy: And since we’ve established this solid result for paving cases, it opens up a new avenue to explore how those geometric rules dictate the counting behavior across more complex matroid types.
Center for Combinatorics, Nankai University · School of Mathematics and Statistics, Beijing Institute of Technology
math.CO
Submitted: 2026-10-15
Updated: 2026-11-09
Comments: 24 pages
License: http://creativecommons.org/licenses/by/4.0/
Importance score: 92/100
The gist: A central conjecture of Ferroni, Jochemko, and Schröter posits that every positroid is Ehrhart positive…
Key concepts
- Ehrhart Positivity
- A lattice polytope is Ehrhart positive if all coefficients in its Ehrhart polynomial are strictly greater than zero. This property has been tested for certain structures, but the general case remains unproven.
- Paving Positroids
- These are specific combinatorial objects whose geometry is defined by cyclic interval constraints and disjoint forbidden regions. Their base polytope, which represents their structure, is the focus of this study.
- Root Summation Identity
- This identity relates a rooted count polynomial to an integral involving a function $\Gamma_v(Ge)$. The paper uses this to show that the coefficientwise nonnegativity of certain terms implies Ehrhart nonnegativity for the structure's polynomial representation.
Terminology
Summary
A central conjecture of Ferroni, Jochemko, and Schröter posits that every positroid is Ehrhart positive; this paper proves that the base polytope of any paving positroid has positive Ehrhart coefficients
Introduction to Ehrhart Positivity
Ehrhart positivity means a lattice polytope P is said to be Ehrhart positive if all coefficients ci > 0 for all i. While this has been verified for classes like lattice path matroids and series-parallel matroids, the general conjecture remains open The paper focuses on the Ehrhart positivity of paving positroid. p. 0 While Ehrhart positivity has recently been verified for notable classes such as lattice
path matroids and series-parallel matroids, the general conjecture remains open. In this paper,
we prove that the base polytope of any paving positroid has positive Ehrhart coefficients.Where the paper says it
Geometric Description of Paving Positroids
The geometry of paving positroids is described by cyclic interval constraints and disjoint forbidden regions Lemma 2.1 states that for a connected rank-r paving positroid on a cyclically ordered set E of size n, the base polytope P(M) is given by P(M) = conv[x ∈ ∆(r, n): x(Hi) ≤ r − 1 for 1 ≤ i ≤ l]. p. 3 Ardila, Rincón, and Williams states that a matroid in a specified order is a positroid if
and only if its base polytope is described, in the hyperplane x(E) = r(M), by upper bounds on
cyclic interval sums [1, Proposition 5. Let M be a connected rank-r paving positroid on a cyclically ordered set E of size n,
where 2 ≤ r ≤ n − 2. All integrals are Riemann integrals over finite intervals or polytopes. 2 The geometry of paving positroids
A cyclic interval consists of consecutive elements in the cyclic order; it may cross the chosen first
element.Where the paper says it
Where the paper says it
Root Summation and Polynomial Representation
The rooted count Fe(a, t) is represented on its integer triangle by a polynomial of total degree at most q − 1. The binomial transform Ge(t, X) = (N Fe)(t, X) satisfies the root summation identity ehrM(t) = Ge(t, 1) + t Z 1 0 Γv(Ge) dv. p. 3 Section 2 establishes the cyclic interval constraints and disjoint
forbidden regions, and introduces a running example. Section 3 gives the root-summation identity
and a periodic integral representation of the binomial transform. The root sum will then take the form
ehrM(t) = Ge(t, 1) + t
Z 1
0
Γv(Ge) dv. 1)
Thus coefficientwise nonnegativity of the local term Ge(t, 1) and of Γv(Ge) will imply Ehrhart
nonnegativity.Where the paper says it
Where the paper says it
Proof of Positivity in Every Degree
Proposition 5.4 proves that for every 0 < v < 1, each coefficient of Γv(Ge) in degrees 0,. p. 3 It proves polynomiality of the rooted counts and uses disjointness in the
common path representation to obtain coefficient nonnegativity. Section 5 recovers the Ehrhart
polynomial by root summation and uses connected coordinate faces to supply a positive integral in
every required degree. com
§ Email address: zihao-zhang@foxmail. com
October 19, 2026
Abstract
A central conjecture of Ferroni, Jochemko, and Schröter posits that every positroid is Ehrhart
positive. com
§ Email address: zihao-zhang@foxmail. com
October 19, 2026
Abstract
A central conjecture of Ferroni, Jochemko, and Schröter posits that every positroid is Ehrhart
positive. It proves polynomiality of the rooted counts and uses disjointness in the
common path representation to obtain coefficient nonnegativity. Section 5 recovers the Ehrhart
polynomial by root summation and uses connected coordinate faces to supply a positive integral in
every required degree.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Conclusion on Ehrhart Positivity
The proof concludes that all positive-degree coefficients of sGp,k(t, s) are nonnegative. This establishes that the rooted count Fe(a, t) is represented on its integer triangle by a polynomial of total degree at most q − 1. p. 4 , q, and its constraint is x(E \ Hi) ≥ t. Polynomiality of this rooted count on the whole integer triangle will be proved in Lemma 4. The root sum will then take the form
ehrM(t) = Ge(t, 1) + t
Z 1
0
Γv(Ge) dv. 1)
Thus coefficientwise nonnegativity of the local term Ge(t, 1) and of Γv(Ge) will imply Ehrhart
nonnegativity. It proves polynomiality of the rooted counts and uses disjointness in the
common path representation to obtain coefficient nonnegativity. Section 5 recovers the Ehrhart
polynomial by root summation and uses connected coordinate faces to supply a positive integral in
every required degree. The root sum will then take the form
ehrM(t) = Ge(t, 1) + t
Z 1
0
Γv(Ge) dv. 1)
Thus coefficientwise nonnegativity of the local term Ge(t, 1) and of Γv(Ge) will imply Ehrhart
nonnegativity. Each coordinate contributes a zero
or unit step with an evaluation weight, or an integrated step in [0, 1] with a factor of t. Section 4
imposes each interval constraint on a consecutive block of steps and computes its nonnegative
boundary correction.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Positroid Ehrhart Positivity Verification: The system can verify that every paving positroid has positive Ehrhart coefficients by leveraging Theorem 1.2, which states
Every paving positroid is Ehrhart positive,
and Lemma 4.5, which proves "For every 0 < v < 1, each coefficient of Gamma v(Ge) in degrees 0,..., q − 1 is positive." -
Ehrhart Polynomial Calculation: The system can compute the Ehrhart polynomial ehrM(t) for any matroid base polytope P(M) by applying the root summation formula:
ehrM(t) = Ge(t, 1) + t Z 1 0 Gamma v(Ge) dv,
where Ge is derived from the rooted count Fe. -
Geometric Constraint Enforcement: The system can enforce hyperplane constraints on positroid base polytopes by using the description: "P(M) = X d j=0 cj t j, cj > 0 for 0 ≤ j ≤ d,
and Lemma 2.1, which provides the geometric description of P(M) as
P(M) = X [Delta (r, n): x(Hi) ≤ r − 1 for 1 ≤ i ≤ l]." -
Nonnegative Coefficient Proof Generation: The system can generate proofs for the nonnegativity of Ehrhart polynomial coefficients by utilizing Proposition 4.8, which states
For every finite piecewise constant w: [0, 1] → [0, 1] and all alpha, beta ∈ [0, 1], the polynomial Gamma w(Ge) has nonnegative coefficients in t.
-
Root Slice Analysis: The system can analyze root slices by employing Lemma 5.3 to show that "For every 0 < v < 1, each coefficient of Gamma v(Ge) in degrees 0,..., q − 1 is positive," which establishes the positivity of [t j−1]Gamma v(Ge).
Abstract
A central conjecture of Ferroni, Jochemko, and Schröter posits that every positroid is Ehrhart positive. While Ehrhart positivity has recently been verified for notable classes such as lattice path matroids and series-parallel matroids, the general conjecture remains open. In this paper, we prove that the base polytope of any paving positroid has positive Ehrhart coefficients. This establishes a new class of Ehrhart positive positroids and provides substantial evidence supporting this conjecture.
Sources
- Ehrhart positivity for lattice path matroids
- The Sign Pattern Problem for Ehrhart Polynomials
- Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern
- Transversal Positroids
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Nonlinear lower-tail large deviations at criticality
- An involution on Dyck paths in the region at most (,) that interchanges area and dinv