arxiv: 2604.15253 · v2 · submitted 2026-04-16 · 🧮 math.CO

Recognition: unknown

A matroidal twist on a formula of Brion

Matthias Beck , Caroline Klivans , Dustin Ross

Authors on Pith no claims yet

Pith reviewed 2026-05-10 10:36 UTC · model grok-4.3

classification 🧮 math.CO

keywords matroidsgeneralized permutohedraBrion's formulaLaurent polynomialsEuler characteristiclattice pointsreciprocityrecursion

0 comments

The pith

A matroid-dependent twist on the vertex rational functions in Brion's formula for generalized permutohedra produces a Laurent polynomial Q_M(P) that mirrors lattice-point behaviors and evaluates to the matroid Euler characteristic.

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

The paper modifies the rational functions attached to vertices in Brion's formula by incorporating a given matroid M, but only in the case where the polytope P is a generalized permutohedron. Summing the adjusted functions defines a new Laurent polynomial Q_M(P) that satisfies recursion relations and a reciprocity law in the same manner as the ordinary generating function for lattice points inside P. Evaluating Q_M(P) at 1 recovers the matroid Euler characteristic introduced by Larson, Li, Payne, and Proudfoot. A reader would care because the construction supplies a direct polyhedral sum that computes this invariant without passing through other combinatorial machinery.

Core claim

Brion's Formula realizes the Laurent polynomial of lattice points in a lattice polytope P as the sum of rational functions associated to the vertices of P. In this paper, we consider the special case where P is a generalized permutohedron. We study a modification of the rational functions associated to the vertices of P depending on a given matroid M. Upon summing these rational functions, we describe how the resulting Laurent polynomial Q_M(P) behaves in certain ways like the lattice points of P, exhibiting natural recursive and reciprocity behaviors. Furthermore, upon evaluating Q_M(P) at 1, we recover the matroid Euler characteristic of Larson, Li, Payne, and Proudfoot, so the CombinatorI

What carries the argument

The matroid M-dependent modification of the rational functions at the vertices of a generalized permutohedron P, whose sum is the Laurent polynomial Q_M(P).

If this is right

Q_M(P) satisfies recursion relations analogous to those satisfied by the lattice-point enumerator of P.
Q_M(P) obeys a reciprocity law.
The value of Q_M(P) at 1 equals the matroid Euler characteristic.
The construction supplies a combinatorial route to these quantities via sums of vertex contributions.

Where Pith is reading between the lines

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

The same twisting technique might be tested on other families of polytopes to see whether similar lattice-like polynomials arise.
Explicit formulas for Q_M(P) on small examples could be used to generate new tables of matroid Euler characteristics.
Reciprocity of Q_M(P) may translate into a duality statement that pairs a matroid with its dual inside the same polytope.

Load-bearing premise

A consistent matroid-dependent modification of the vertex rational functions can be defined for generalized permutohedra so that their sum Q_M(P) inherits the stated recursive, reciprocity, and evaluation properties.

What would settle it

A concrete generalized permutohedron P together with a matroid M for which the explicitly constructed Q_M(P) fails to obey the claimed recursion or reciprocity relation, or for which the value of Q_M(P) at 1 differs from the matroid Euler characteristic computed by other means.

Figures

Figures reproduced from arXiv: 2604.15253 by Caroline Klivans, Dustin Ross, Matthias Beck.

**Figure 1.** Figure 1: depicts an example of Brion’s Formula. See [2] for expositions of this and adjacent results. (0, 0) 1 (1−x)(1−y) + (3, 0) x 3 (1−x −1)(1−x −1y) + (0, 3) y 3 (1−y −1)(1−xy −1) = (0, 0) (3, 0) (0, 3) y 3 +y 2 + xy 2 +y + xy + x 2y +1 + x + x 2 + x 3 [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗

**Figure 2.** Figure 2: Sliding a facet. Moreover, the facet FT can naturally be viewed as the product of two generalized permutohedra, which we denote P|T ⊂ R T and P/T ⊂ R T c [17]. Thus, we obtain a recursion purely in the context of generalized permutohedra: (3) q(P) = q(PT ) + q(P|T)q(P/T) [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗

**Figure 3.** Figure 3: The braid fan Σ3 [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗

**Figure 4.** Figure 4: A generalized permutohedron and its normal fan. [PITH_FULL_IMAGE:figures/full_fig_p006_4.png] view at source ↗

**Figure 5.** Figure 5: Geometric interpretations of Sn(µ). Given a piecewise Laurent polynomial f = {fσ : σ ∈ Sn} ∈ PLaur(Σn), we define Laurent polynomials gµ,j ∈ Z[x ±1 1 , . . . , x ±1 n ] for µ ∈ Sn−1 and j = 1, . . . , n − 1 by the formula gµ,j := fµj − fµj+1 xn − xµ(j) . The gµ,j are well defined because µj = µj+1 ◦ τj with µj (j) = n while µj (j + 1) = µ(j). Furthermore, for each µ ∈ Sn−1, we define the Laurent polynomial… view at source ↗

**Figure 6.** Figure 6: Identifying lattice points contributing to [PITH_FULL_IMAGE:figures/full_fig_p010_6.png] view at source ↗

**Figure 7.** Figure 7: Sliding a facet again. If P ⊂ R E is a nondegenerate generalized permutohedron, then the vertices of P indexed by SE,T are those that lie in the facet of P that maximizes the dot product with eT . For example, if E = [3] and T = {2, 3}, then SE,T = {231, 321}, and if P is the generalized permutohedron in [PITH_FULL_IMAGE:figures/full_fig_p016_7.png] view at source ↗

read the original abstract

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.

Desk Editor's Note private letter to a colleague

The paper modifies Brion's vertex rational functions using a matroid to produce a Laurent polynomial Q_M(P) that satisfies recursion and reciprocity and evaluates to the matroid Euler characteristic at 1.

read the letter

The key thing to know is that the authors take Brion's formula for the generating function of lattice points in a polytope and modify the vertex rational functions in a way that depends on a matroid. For generalized permutohedra, the sum Q_M(P) ends up being a Laurent polynomial with recursive and reciprocity properties, and evaluating it at 1 gives the matroid Euler characteristic of Larson, Li, Payne, and Proudfoot. They do well in making the construction precise and showing that the modified rational functions sum to something with the desired algebraic properties. The proofs appear to establish the pole cancellations independently, so Q_M(P) is well-defined as a polynomial. This approach offers a geometric route to studying the Euler characteristic that feels natural given how generalized permutohedra encode matroids. The soft spots are limited. The construction works specifically for generalized permutohedra because they have a matroid structure built in, so the extension to other polytopes is not addressed and might not be straightforward. There could be more discussion of how this compares to other known formulas for the Euler characteristic, but the core result stands on its own. No evidence of circularity in the arguments. This paper is for people in combinatorial geometry and matroid theory. A reader who is comfortable with Brion's theorem and the papers on matroid Euler characteristics will find it accessible and potentially useful for generating new examples or proving properties. It deserves a serious referee because the ideas are original, the technical details are handled, and the result adds a geometric perspective without overreaching. I recommend sending this to peer review.

Referee Report

1 major / 2 minor

Summary. The paper extends Brion's formula, which equates the lattice-point generating function of a lattice polytope P to a sum of vertex rational functions, to the case of generalized permutohedra. For a matroid M, it defines a matroid-dependent modification of these vertex rational functions; their sum is asserted to be a Laurent polynomial Q_M(P) that satisfies recursive and reciprocity laws analogous to those of the lattice-point enumerator, and Q_M(P) evaluated at 1 recovers the matroid Euler characteristic of Larson, Li, Payne, and Proudfoot.

Significance. If the construction is rigorous, the work supplies a geometric-combinatorial interpretation of the matroid Euler characteristic and a new source of recursive/reciprocity identities for it. The explicit link to Brion's formula and generalized permutohedra could facilitate further applications of polyhedral methods to matroid invariants.

major comments (1)

The load-bearing step is the definition of the matroid-dependent modification of the vertex rational functions (introduced after the statement of Brion's formula) and the subsequent proof that their sum Q_M(P) is a Laurent polynomial, i.e., that all poles cancel. This cancellation must be established directly from the geometry of generalized permutohedra and the matroid structure; it cannot be derived from the later evaluation at 1 or from the claimed recursive/reciprocity properties, or the argument risks circularity.

minor comments (2)

The introduction should include a brief comparison with other known modifications or extensions of Brion's formula in the matroid or polytope literature.
Notation for the modified rational functions and the resulting Q_M(P) should be introduced with an explicit example (e.g., for a small matroid and permutohedron) before the general statements.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the detailed report and for recognizing the potential significance of the construction. We address the single major comment below, focusing on the logical structure of the proof that Q_M(P) is a Laurent polynomial.

read point-by-point responses

Referee: The load-bearing step is the definition of the matroid-dependent modification of the vertex rational functions (introduced after the statement of Brion's formula) and the subsequent proof that their sum Q_M(P) is a Laurent polynomial, i.e., that all poles cancel. This cancellation must be established directly from the geometry of generalized permutohedra and the matroid structure; it cannot be derived from the later evaluation at 1 or from the claimed recursive/reciprocity properties, or the argument risks circularity.

Authors: We agree that the cancellation of poles in the sum defining Q_M(P) must be proved directly from the geometry of generalized permutohedra and the matroid M, without relying on the evaluation at 1 or on the recursive/reciprocity laws proved later. In the manuscript this is done in Section 3: after defining the matroid-twisted vertex functions, the proof proceeds by examining the denominators along the edges of the polytope, using the matroid's rank function and the fact that the normal fan is a coarsening of the braid fan to exhibit explicit cancellations of poles. These arguments invoke only the combinatorial properties of the vertices and the matroid, together with the standard Brion decomposition; they make no reference to the results of Sections 4 or 5. To eliminate any possible perception of circularity we will add, at the start of Section 3, an explicit statement that the Laurent-polynomial claim is established independently of the later identities, and we will include a short diagram of the logical dependencies among the sections. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation of Q_M(P) is self-contained

full rationale

The paper defines a matroid-dependent modification of the vertex rational functions from Brion's formula, forms their sum Q_M(P) for generalized permutohedra, and then establishes (via the polytope geometry and matroid structure) that Q_M(P) satisfies recursive and reciprocity properties analogous to lattice-point enumerators. The evaluation Q_M(P)(1) equaling the matroid Euler characteristic of Larson-Li-Payne-Proudfoot is presented as a derived consequence, not a definitional identity or fitted input. No steps reduce by construction to prior inputs, self-citations are not load-bearing for the central claims, and the modification is not asserted without independent verification of pole cancellation and the listed behaviors. The chain is a standard constructive proof with external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract provides no information on free parameters, axioms, or invented entities; the construction is described as building directly on Brion's formula and existing matroid theory.

pith-pipeline@v0.9.0 · 5419 in / 1152 out tokens · 35225 ms · 2026-05-10T10:36:15.168483+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

19 extracted references · 1 canonical work pages

[1]

Math.365(2020), 36 pp., Id/No 107039

Federico Ardila, Federico Castillo, Christopher Eur, and Alexander Postnikov,Coxeter submodular functions and deformations of Coxeter permutahedra, Adv. Math.365(2020), 36 pp., Id/No 107039

2020
[2]

Intelligencer31(2009), no

Matthias Beck, Christian Haase, and Frank Sottile, (Formulas of Brion, Lawrence, and Varchenko on rational generating functions for cones), Math. Intelligencer31(2009), no. 1, 9–17

2009
[3]

Matthias Beck and Raman Sanyal,Combinatorial Reciprocity Theorems: An Invitation to Enumerative Geometric Combinatorics, Grad. Stud. Math., vol. 195, Providence, RI: American Mathematical Society (AMS), 2018

2018
[4]

Andrew Berget, Christopher Eur, Hunter Spink, and Dennis Tseng,Tautological classes of matroids, Invent. Math. 233(2023), no. 2, 951–1039

2023
[5]

Michel Brion,Points entiers dans les poly` edres convexes, Ann. Sci. ´Ecole Norm. Sup. (4)21(1988), no. 4, 653–663

1988
[6]

Michel Brion and Michele Vergne,An equivariant Riemann–Roch theorem for complete, simplicial toric varieties, Journal f¨ ur die Reine und Angewandte Mathematik482(1997), 67–92

1997
[7]

Melody Chan, Emily Clader, Caroline Klivans, and Dustin Ross,K-rings of smooth toric varieties via piecewise- exponential functions, 2025

2025
[8]

Melody Chan, Emily Clader, Caroline Klivans, and Dustin Ross,Piecewise-exponential functions and Ehrhart fans, Preprint, arXiv:2503.22636 [math.CO], 2025

work page arXiv 2025
[9]

Eug` ene Ehrhart,Sur les poly` edres rationnels homoth´ etiques ` andimensions, C. R. Acad. Sci. Paris254(1962), 616–618

1962
[10]

Christopher Eur, Alex Fink, and Matt Larson,Vanishing theorems for combinatorial geometries, 2025

2025
[11]

Masa-Nori Ishida,Polyhedral Laurent series and Brion’s equalities, Internat. J. Math.1(1990), no. 3, 251–265

1990
[12]

Math.441(2024), 43 pp., Id/No 109554

Matt Larson, Shiyue Li, Sam Payne, and Nicholas Proudfoot,K-rings of wonderful varieties and matroids, Adv. Math.441(2024), 43 pp., Id/No 109554

2024
[13]

Macdonald,Polynomials associated with finite cell-complexes, J

Ian G. Macdonald,Polynomials associated with finite cell-complexes, J. London Math. Soc. (2)4(1971), 181–192

1971
[14]

Merkurjev,Comparison of the equivariant and the standard K-theory of algebraic varieties, Algebra i Analiz9(1997), no

Alexander S. Merkurjev,Comparison of the equivariant and the standard K-theory of algebraic varieties, Algebra i Analiz9(1997), no. 4, 175–214. 24 M. BECK, C. KLIVANS, AND D. ROSS

1997
[15]

James Oxley,Matroid theory, Handbook of the Tutte polynomial and related topics, Chapman & Hall/CRC, Boca Raton, FL, 2022, pp. 44–85

2022
[16]

Alexander Postnikov,Permutohedra, associahedra, and beyond, Int. Math. Res. Not. (2009), no. 6, 1026–1106

2009
[17]

Math.13(2008), 207–273

Alexander Postnikov, Victor Reiner, and Lauren Williams,Faces of generalized permutohedra, Doc. Math.13(2008), 207–273

2008
[18]

2, 161–185

Aleksandr Pukhlikov and Askold Khovanskii,Finitely additive measures of virtual polyhedra, Algebra i Analiz4(1992), no. 2, 161–185

1992
[19]

4, 188–216

,The Riemann-Roch theorem for integrals and sums of quasipolynomials on virtual polytopes, Algebra i Analiz4(1992), no. 4, 188–216. Department of Mathematics, San Francisco State University, United States of America Email address:mattbeck@sfsu.edu Department of Mathematics, Brown University, United States of America Email address:caroline klivans@brown.ed...

1992