Pith. sign in

REVIEW 6 minor 1 cited by

Combinatorial interpretation of the coefficients of the order polynomial of fence posets

T0 review · 0 major / 6 minor · reviewed 2026-07-14 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read A new block statistic on permutations counts the coefficients of the order polynomial of every fence poset.

desk verdict Solid combinatorial answer to two named open questions via a new block statistic on fences; the main identity is proved by recurrence matching and the proof checks out. read the letter →

arxiv 2607.11225 v1 pith:OLIDFE2W submitted 2026-07-13 math.CO

Yakob Kahane This is my paper · ORCID
classification math.CO MSC 05A1505B3506A0752B20
keywords orderpolynomialfenceposetblockstatisticEhrhartSchubertmatroidlatticepathhypersimplexlinearextensions
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The order polynomial of a poset records how many ways its elements can be labeled by integers from 1 to t while respecting the order relations. Its coefficients are integers that are not always positive, and a combinatorial explanation of those coefficients has been missing even for the simplest non-trivial families. This paper supplies that explanation for fence posets: every labeling of a fence is uniquely partitioned into “blocks” by a left-to-right greedy rule, and the number of blocks is a statistic whose generating function is exactly the order polynomial. Because the base polytopes of lattice-path (and therefore Schubert) matroids decompose into order polytopes of fences, the same statistic also interprets the Ehrhart polynomials of those polytopes, answering a long-standing question of Stanley. As a quick payoff the statistic yields the first non-trivial lower bound on the linear coefficient of any order polytope’s Ehrhart polynomial.

What carries the argument

The unique valid block partition of a labeled fence: a left-to-right greedy decomposition into maximal convex subposets whose roots satisfy the ascent/descent inequalities forced by the labeling; bl_P(σ) simply counts those blocks.

What would settle it

Compute the order polynomial of a small fence by the classical ideal-chain formula and the block-statistic generating function by exhaustive enumeration of the n! labelings; any mismatch of coefficients disproves the identity.

Watch

Extended reading notes

Core claim

For every fence poset P of size n the order polynomial satisfies n! Ω(P;t) = sum over all permutations σ of t raised to the power bl_P(σ), where bl_P(σ) is the number of blocks in the unique valid block partition of the labeled fence (P,σ). The same identity, after a truncation of the fence, interprets the Ehrhart polynomial of every Schubert matroid base polytope.

Load-bearing premise

The proof that every labeled fence has exactly one valid block partition relies on the linear (path-like) shape of the fence; uniqueness is only conjectured once the poset becomes a skew shape or a cycle.

Editorial extensions

If this is right

  • The coefficients of the order polynomial of every fence are non-negative and equal the number of labelings with a fixed number of blocks.
  • The Ehrhart polynomial of every Schubert matroid (and every hypersimplex) acquires an explicit positive combinatorial formula as a sum of truncated block statistics.
  • The linear coefficient of the Ehrhart polynomial of any order polytope is bounded below by a sum of harmonic numbers determined by the lengths of its ascending and descending runs.
  • If the conjectured block statistics for skew shapes and circular fences are valid, the same combinatorial interpretation extends to those larger families.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The greedy block construction is essentially a generalized Foata cycle map for zigzag posets; further specialization may recover classical permutation statistics.
  • The same uniqueness argument may adapt to other series-parallel or path-like posets, potentially giving Ehrhart interpretations for a wider class of matroid polytopes.
  • A probabilistic reading of the block statistic immediately produces higher-moment formulae for all coefficients of the Ehrhart polynomial, not only the linear term.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

0 major / 6 minor

Summary. The paper defines a statistic bl_P on the labelings (permutations) of a fence poset P of size n, given by the number of blocks in the unique valid block partition of (P,σ). It proves that n! Ω(P;t) equals the generating function ∑ t^{bl_P(σ)} over S_n (Theorem 3.8), answering a question of Ferroni–Morales–Panova. The same statistic, after truncation, yields a combinatorial interpretation of the Ehrhart polynomial of the base polytope of any Schubert matroid (Theorem 6.7), and therefore of hypersimplices, answering Stanley’s 1999 question. As an application the authors obtain a lower bound on the linear Ehrhart coefficient of the order polytope of a fence (Theorem 5.3). Analogous statistics are defined for skew-shape and circular fence posets and conjectured to give the same generating functions.

Significance. The result supplies the first explicit combinatorial interpretation of all coefficients of the order polynomial for the important class of fence posets, which appear as the building blocks in the recent Ehrhart-positivity proof for lattice-path matroids. The interpretation for Schubert matroids / hypersimplices resolves a long-standing open problem of Stanley. The lower bound on the linear coefficient, obtained by linearity of expectation on the indicator variables for roots, is the first nontrivial bound of its kind. The uniqueness of the valid block partition (Lemma 3.3) is proved by a short, self-contained induction that uses only the path geometry of a fence; the subsequent recurrence-matching argument is fully written out. These are genuine combinatorial advances that will be useful for further work on order polytopes and matroid polytopes.

minor comments (6)
  1. Numerous typographical and grammatical errors appear throughout (e.g., “decompostions”, “coonected filter”, “my Ferroni”, “e≤µ”, “P n k=0 ak =n!”, inconsistent capitalization of “Theorem”, missing articles). A careful copy-edit is needed before publication.
  2. Notation for the generating function is introduced twice: A(P;t) is defined as (1/n!)∑ t^{bl_P(σ)} in Definition 3.5, yet the main theorem equates Ω(P;t) with A(P;t). It would be cleaner to work exclusively with the integer-coefficient polynomial n!Ω or to state the equality of generating functions once and for all.
  3. Figures 6–8 and 10–12 are helpful but the captions and the surrounding text do not always make the colour coding (roots red, ascents blue, descents green) explicit; a single sentence in the caption of Figure 6 would suffice for all later figures.
  4. In the abstract and introduction the lower-bound application is phrased as holding for “an order polytope”; the statement proved (Theorem 5.3) is only for fences. A one-word clarification (“of a fence poset”) would avoid any possible over-reading.
  5. Section 7 is long and cancellation-heavy. While the algebra checks out, a short roadmap paragraph at the beginning of the section (listing the four groups of terms that cancel via Lemmas 7.1–7.2) would make the argument far easier to follow.
  6. The symbol S_n(P) appears in Conjectures 4.4 and 4.8 without definition; it is clear from context that it means the set of all labelings, but a one-line definition would remove any ambiguity.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: the block statistic is defined combinatorially and matched to the order polynomial by independent recurrence comparison.

full rationale

The central claim (Theorem 3.8) equates n! Ω(P;t) to the generating function of the newly defined statistic bl_P(σ). The statistic is introduced via an explicit, self-contained combinatorial construction (unique valid block partition of a labeled fence, Lemma 3.3, proved by left-to-right induction that uses only the path structure and ascent/descent dichotomy). A(P;t) is then defined directly from that count. Both A and Ω are shown to obey matching recurrences (Lemma 3.6 from the greedy block construction; Theorem 3.7 from the known convex-subposet decomposition restated as Theorem 2.9). Equality follows by induction plus elementary term-by-term cancellation that invokes only the closed formula for the linear coefficient c1 of a fence (Lemma 2.5, taken from FMP25). Self-citations (Kahane 2025 for the language of standard decompositions; FMP25/FMP26 for positivity, c1 and the matroid decomposition) supply background facts used as black boxes; none of them redefine the target polynomial or force the statistic by construction. The matroid and hypersimplex interpretations are direct specializations of the same identity. Conjectures for skew and circular cases are left open and do not affect the proved theorem. The derivation is therefore self-contained against external benchmarks; the single minor self-citation is not load-bearing.

Assumptions & free parameters 0 free parameters · 3 assumptions · 2 invented entities

The paper works entirely inside classical poset and Ehrhart theory. No free parameters are fitted. The only non-standard objects are the combinatorial constructions (blocks, valid partitions, truncated fences) introduced to prove the main identity; they are defined explicitly and do not rely on external existence claims beyond ordinary set theory.

assumptions (3)
  • domain assumption The order polynomial Ω(P;t) is a polynomial of degree n whose leading coefficient is e(P)/n! and whose linear coefficient for a fence is given by the explicit factorial formula of Ferroni–Morales–Panova.
    Invoked throughout §§2–3 and in the recurrence of Theorem 3.7; taken from Stanley and from [FMP25, Prop. 3.3].
  • domain assumption Every standard decomposition of a poset into convex subposets induces a partial order on the blocks, and the coefficients of Ω admit the Shareshian–Wright–Zhao / Kahane expansion in terms of products of linear coefficients.
    Used to motivate the block statistic and to derive the recurrence for Ω; cited as Theorem 2.9.
  • standard math Ordinary set-theoretic induction and the uniqueness of greedy left-to-right constructions on paths.
    Underpins the uniqueness proof of Lemma 3.3 and the inductive argument of §7.
invented entities (2)
  • bl_P statistic and valid block partition of a labeled fence independent evidence
    purpose: To give a direct combinatorial interpretation of the coefficients of Ω(P;t).
    Defined in Definitions 3.1–3.5; uniqueness proved in Lemma 3.3; generating function shown equal to n!Ω in Theorem 3.8.
  • Truncated block statistic TrBl_P for Schubert matroids independent evidence
    purpose: To interpret the Ehrhart polynomial of the base polytope of a Schubert matroid as a sum of truncated fence statistics.
    Defined in Definition 6.6; used in Theorem 6.7 and Proposition 6.8.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Combinatorial interpretation of the coefficients of the order polynomial of fence posets." pith.science (2026). https://pith.science/paper/OLIDFE2W

@misc{pith2026260711225,
  author       = {Pith},
  title        = {Pith review of: Combinatorial interpretation of the coefficients of the order polynomial of fence posets},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/OLIDFE2W}},
  note         = {Machine review of arXiv:2607.11225}
}
read the original abstract

Given a fence poset P , we define a new statistic on permutations, denoted by blP, that provides a combinatorial interpretation of the coefficients of the order polynomial of P , answering a question of Ferroni, Morales, and Panova (2025). Using the fact that the base polytope of a lattice path matroid can be decomposed into order polytopes of fence posets, we also obtain a combinatorial interpretation of the coefficients of the Ehrhart polynomial of the base polytope of Schubert matroids, answering a question of Stanley (1999). As an application of this statistic, we establish the first nontrivial lower bound for the linear coefficient of the Ehrhart polynomial of an order polytope. Finally, we conjecture generalizations of this statistic to skew-shape posets and circular fence posets.

Figures

Figures reproduced from arXiv: 2607.11225 by the authors.

Figure 1
Figure 1. The fence poset of size 9 with descents at position {2, 3, 5, 8}, the circular fence poset of size 8 with descents at position {3, 4, 6, 8} and the skew shape poset Pλ/µ with λ/µ = 544221/11. 1 arXiv:2607.11225v1 [math.CO] 13 Jul 2026 [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. The shade of a lattice path. We construct a statistics inspired by decompositions into convex subposet to define new candidate statistics which could give an interpretation of the ak = n!ck. This approach gives positive results for fence posets. Given a fence poset P and a permutation, we introduced a statistic called blP (σ) in order to obtain Theorem (3.8). Let P be a fence poset of size n, then n! Ω(P, t) = X σ∈S… view at source ↗
Figure 3
Figure 3. A fence poset P. In blue the ascent set, in green the descent set [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figures from the paper (14 more)
Figure 4
Figure 4. Figure 4: The fence poset P/5. Let P be a fence poset of n elements. The position of the elements of P goes from left to right starting at 0. Let P[i,j] be the fence subposet consisting of element with position i ≤ ℓ ≤ j. Note that P[0,n−1] = P, P[j,i] = ∅ if j > i and P[i,i] is…
Figure 5
Figure 5. Figure 5: A standard decomposition µ and the induced poset. From the definition of subposets, we see that Pi≤eµPj if and only if i = j. However the relation ≤eµ is not a partial order relation yet. In order to create such a relation we need to consider a smaller class of decompo…
Figure 6
Figure 6. Figure 6: A block and the unique valid block partition of (P, σ). Here, blP (σ) = 7. Roots are represented as red squares, ascents as blue circles and descents as green disks. Given a fence poset P of size n, we can derive the following recurrence formula for A(P;t) by looking a…
Figure 7
Figure 7. Figure 7: The 4! possible labelings for a fence poset of size 4. Counting the number of blocks for each labeling gives A(P;t) = 1 4!(3t 4 + 10t 3 + 9t 2 + 2t). Similarly, the order polynomial Ω(P;t) also respects a recurrence formula that directly comes from Theorem 2.9. Theorem…
Figure 8
Figure 8. Figure 8: An example for the ascent chain case. The permutation 32614857 gives the block parti￾tion |32|614|857. Proof. d Ω(P[0,n−1];t) dt = d dt Xn k=0 t k k! X µ∈SDecompo(P ) µ={P1,...,Pk} e(µ) Yk i=1 c1(Pi)  = Xn k=0 t k−1 (k − 1)! X µ∈Decompo(P ) µ={P1,...,Pk} e(µ) Yk i=1…
Figure 9
Figure 9. Figure 9: The skew shape 431/1 and its associated skew shape poset. Given a vertex associated to a cell (i, j), we call respectively left child, right child, left parent, right parent, the vertices associated at respective position (i + 1, j), (i, j + 1), (i, j − 1), (i − 1, j).…
Figure 10
Figure 10. Figure 10: A block whose labeling respects the inequal￾ities. 10 1 5 2 4 8 7 9 11 12 14 15 16 18 19 21 22 2013 3 17 6 [PITH_FULL_IMAGE:figures/full_fig_p010_10.png]
Figure 12
Figure 12. Figure 12: Illustration of the way of construction B from B′ . For example, for i = 2, σ(x−) = 7 and since y1 is in the block whose root has label 8 σ(x+) = 8, therefore, y2 is in the same block as x−. Given a skew shape poset P and a labeling of its elements, we denote by ˜blP …
Figure 13
Figure 13. Figure 13: A circular fence poset of size 14. We extend the definition of desc(P) and asc(P) on cycle cover naturally and saying that z1 ∈ asc(P) (since it is greater that the ”element at his left” which is zn). Convex subposets of a circular fence poset P are either fence poset…
Figure 14
Figure 14. Figure 14: The Upper and lower paths for the skew shape λ/µ = 66642/311. A lattice path is in M(λ/µ) if it stays between the blue and the red path. The Ehrhart polynomial of lattice path matroid M(λ/µ), denoted E(M(λ/µ)) is the Ehrhart polynomial of the polytope consisting of th…
Figure 16
Figure 16. Figure 16 [PITH_FULL_IMAGE:figures/full_fig_p014_16.png]
Figure 17
Figure 17. Figure 17: A lattice path x ∈ M[L, U] in red and sh(x) in blue. Combining Theorem 6.2 and Lemma 6.4, we can therefore express the Ehrhart polynomial of a a lattice path matroid using as a sum over its elements. Proposition 6.5. Let λ/µ be a skew shape, Then the Ehrhart polynomia…
Figure 18
Figure 18. Figure 18: The truncated poset obtained after removing the first descent chain and the last ascent chain. Here, T rBlP (σ) = 3. This give a combinatorial interpretation of the coefficients of the Ehrhart polynomial of Schubert matroids. Theorem 6.7. Let U be a lattice path and M…
Figure 19
Figure 19. Figure 19: An exemple with x = 4, y = 4, r = 3, s = 6. Proof. Assume that the equality holds for all fence posets of size ≤ n − 1. (7.1) d nA(P[0,n−1]) dt = X i∈ asc(P ) dA(P[0,i−1]) dt · t · A(P[f(i),n−1]) + X i∈asc(P) A(P[0,i−1])A(P[f(i),n−1]) + X i∈asc(P ) A(P[0,i−1]) · t · d…

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Bernstein Transfers and Greedy Records for Fence and Circular-Fence Order Polynomials

    math.CO 2026-07 accept novelty 7.0 of 10

    A greedy permutation record statistic matches the order polynomial of every fence poset, and a cyclic version proves the circular-fence order-polynomial conjecture.

Reference graph

Works this paper leans on

64 extracted references · 14 canonical work pages · cited by 1 Pith paper

  1. [1]

    2015 , PAGES =

    Beck, Matthias and Robins, Sinai , TITLE =. 2015 , PAGES =

    2015

  2. [2]

    Recent trends in algebraic combinatorics , pages=

    On positivity of Ehrhart polynomials , author=. Recent trends in algebraic combinatorics , pages=. 2019 , publisher=

    2019

  3. [3]

    2003 , eprint=

    A New Approach to Order Polynomials of Labeled Posets and Their Generalizations , author=. 2003 , eprint=

    2003

  4. [4]

    Transactions of the American Mathematical Society , volume=

    Excited Young diagrams and equivariant Schubert calculus , author=. Transactions of the American Mathematical Society , volume=

  5. [5]

    Advances in Mathematics , volume=

    Correlation inequalities for linear extensions , author=. Advances in Mathematics , volume=. 2024 , publisher=

    2024

  6. [6]

    arXiv preprint arXiv:2203.15942 , year=

    Combinatorics of triangular partitions , author=. arXiv preprint arXiv:2203.15942 , year=

    arXiv

  7. [7]

    arXiv preprint math/0412289 , year=

    Some positive differences of products of Schur functions , author=. arXiv preprint math/0412289 , year=

    arXiv

  8. [8]

    , label =

    OEIS Foundation Inc. , label =. http://oeis.org , title =

Show all 64 references
  1. [9]

    Sage Developers, The , key =

  2. [10]

    2008 , PAGES =

    Haglund, James , TITLE =. 2008 , PAGES =

    2008

  3. [11]

    Knutson, Allen and Miller, Ezra and Yong, Alexander , TITLE =. J. Reine Angew. Math. , FJOURNAL =. 2009 , PAGES =. doi:10.1515/CRELLE.2009.033 , URL =

    2009 doi

  4. [12]

    Ikeda, Takeshi and Naruse, Hiroshi , TITLE =. Trans. Amer. Math. Soc. , FJOURNAL =. 2009 , NUMBER =. doi:10.1090/S0002-9947-09-04879-X , URL =

    2009 doi

  5. [13]

    Chen, William Y. C. and Yan, Guo-Guang. and Yang, Arthur L. B. , TITLE =. J. Algebraic Combin. , VOLUME =. 2005 , NUMBER =

    2005

  6. [14]

    and Grassl, Richard M

    Hillman, Abraham P. and Grassl, Richard M. , TITLE =. J. Combinatorial Theory Ser. A , FJOURNAL =. 1976 , NUMBER =. doi:10.1016/0097-3165(76)90065-0 , URL =

    1976 doi

  7. [15]

    Discrete Anal

    Chan, Swee Hong and Pak, Igor and Panova, Greta , TITLE =. Discrete Anal. , FJOURNAL =. 2021 , PAGES =. doi:10.19086/da , URL =

    2021 doi

  8. [16]

    and Robinson, Gilbert de B

    Frame, James S. and Robinson, Gilbert de B. and Thrall, Robert M. , year =. Can. J. Math. , title =. doi:10.4153/cjm-1954-030-1 , number =

    1954 doi

  9. [17]

    European J

    Lascoux, Alain and Pragacz, Piotr , TITLE =. European J. Combin. , FJOURNAL =. 1988 , NUMBER =. doi:10.1016/S0195-6698(88)80053-2 , URL =

    1988 doi

  10. [18]

    math/0512204 , archivePrefix=

    Victor Kreiman , year=. math/0512204 , archivePrefix=

    arXiv

  11. [19]

    and Zhu, Daniel , TITLE =

    Morales, Alejandro H. and Zhu, Daniel , TITLE =. S\'. 2020 , PAGES =

    2020

  12. [20]

    and Pak, Igor and Panova, Greta , TITLE =

    Morales, Alejandro H. and Pak, Igor and Panova, Greta , TITLE =. J. Combin. Theory Ser. A , FJOURNAL =. 2018 , PAGES =

    2018

  13. [21]

    , TITLE =

    Stanley, Richard P. , TITLE =. 2012 , PAGES =

    2012

  14. [22]

    , TITLE =

    Stanley, Richard P. , TITLE =. 1999 , PAGES =

    1999

  15. [23]

    and Pak, Igor and Panova, Greta , TITLE =

    Morales, Alejandro H. and Pak, Igor and Panova, Greta , TITLE =. SIAM J. Discrete Math. , FJOURNAL =. 2017 , NUMBER =. doi:10.1137/16M1099625 , URL =

    2017 doi

  16. [24]

    Morales and Igor Pak and Greta Panova , year =

    Alejandro H. Morales and Igor Pak and Greta Panova , year =. Algebr. Comb. , title =. doi:10.5802/alco.67 , eprint =

    doi

  17. [25]

    Algebraic Combinatorics , publisher =

    Naruse, Hiroshi and Okada, Soichi , title =. Algebraic Combinatorics , publisher =. 2019 , pages =. doi:10.5802/alco.54 , language =

    2019 doi

  18. [27]

    Chan, Swee Hong and Pak, Igor , title =. Adv. Math. , issn =. 2024 , language =. doi:10.1016/j.aim.2024.109954 , keywords =

    2024 doi

  19. [28]

    , title =

    Stanley, Richard P. , title =. Combinatorics and graphs. Selected papers based on the presentations at the 20th anniversary conference of IPM on combinatorics, Tehran, Iran, May 15--21, 2009. Dedicated to Reza Khosrovshahi on the occasion of his 70th birthday , isbn =. 2010 , ...

    2009

  20. [29]

    2024 , eprint=

    A Triangulation of the Flow Polytope of the Zigzag Graph , author=. 2024 , eprint=

    2024

  21. [30]

    Forum Math

    Morier-Genoud, Sophie and Ovsienko, Valentin , TITLE =. Forum Math. Sigma , FJOURNAL =. 2020 , PAGES =. doi:10.1017/fms.2020.9 , URL =

    2020 doi

  22. [31]

    and Pak, Igor and Panova, Greta , TITLE =

    Morales, Alejandro H. and Pak, Igor and Panova, Greta , TITLE =. Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI) , FJOURNAL =. 2021 , NUMBER =

    2021

  23. [32]

    Electron

    Park, GaYee , TITLE =. Electron. J. Combin. , FJOURNAL =. 2022 , NUMBER =. doi:10.37236/10444 , URL =

    2022 doi

  24. [33]

    Andrei Okounkov and Grigori Olshanski , year =. St. Petersburg Math. J. , title =

  25. [34]

    Schubert calculus and hook formula , howpublished =

    Hiroshi Naruse , year =. Schubert calculus and hook formula , howpublished =

  26. [35]

    A bijective proof of the hook-length formula for skew shapes , doi =

    Matja. A bijective proof of the hook-length formula for skew shapes , doi =. 2020 , journal =

    2020

  27. [36]

    Hook, line and sinker:

    Matja. Hook, line and sinker:. 2020 , journal =. doi:10.1016/j.ejc.2019.103079 , eid =

    2020 doi

  28. [37]

    Electron

    Jiradilok, Pakawut and McConville, Thomas , TITLE =. Electron. J. Combin. , FJOURNAL =. 2023 , NUMBER =. doi:10.37236/10753 , URL =

    2023 doi

  29. [38]

    Combinatorial and geometric representation theory (

    Ram, Arun , TITLE =. Combinatorial and geometric representation theory (. 2003 , MRCLASS =. doi:10.1090/conm/325/05670 , URL =

    2003 doi

  30. [39]

    Selecta Math

    Garver, Alexander and Patrias, Rebecca and Thomas, Hugh , TITLE =. Selecta Math. (N.S.) , FJOURNAL =. 2023 , NUMBER =. doi:10.1007/s00029-023-00831-4 , URL =

    2023 doi

  31. [40]

    , TITLE =

    Gansner, Emden R. , TITLE =. J. Combin. Theory Ser. A , FJOURNAL =. 1981 , NUMBER =. doi:10.1016/0097-3165(81)90041-8 , URL =

    1981 doi

  32. [41]

    SIAM Journal on Discrete Mathematics , volume =

    Kim, Jang Soo and Yoo, Meesue , title =. SIAM Journal on Discrete Mathematics , volume =. 2021 , doi =

    2021

  33. [42]

    S\'eminaire Lotharingien de Combinatoire , year =

    Pak, Igor , title =. S\'eminaire Lotharingien de Combinatoire , year =. doi:10.1007/s00184-019-00760-3 , URL =

    doi

  34. [43]

    2018 , issn =

    Asymptotics of the number of standard Young tableaux of skew shape , journal =. 2018 , issn =

    2018

  35. [44]

    Cassels, Peter , title =

  36. [45]

    Journal of Combinatorial Theory, Series A , volume=

    Another probabilistic method in the theory of Young tableaux , author=. Journal of Combinatorial Theory, Series A , volume=. 1984 , publisher=

    1984

  37. [46]

    arXiv preprint arXiv:0912.4240 , year=

    A survey of alternating permutations , author=. arXiv preprint arXiv:0912.4240 , year=

    arXiv

  38. [47]

    European Journal of Combinatorics , volume=

    Zig-zag Eulerian polynomials , author=. European Journal of Combinatorics , volume=. 2025 , publisher=

    2025

  39. [48]

    2025 , eprint=

    Hilbert-Kunz multiplicity of quadrics via Ehrhart theory , author=. 2025 , eprint=

    2025

  40. [49]

    Cambridge studies in advanced mathematics , year=

    Enumerative combinatorics volume 1 second edition , author=. Cambridge studies in advanced mathematics , year=

  41. [50]

    arXiv preprint arXiv:2503.16403 , year=

    Skew shapes, Ehrhart positivity and beyond , author=. arXiv preprint arXiv:2503.16403 , year=

    arXiv

  42. [51]

    Mathematische Annalen , volume=

    The Hilbert-Kunz function , author=. Mathematische Annalen , volume=. 1983 , publisher=

    1983

  43. [52]

    Nagoya Mathematical Journal , volume=

    Hilbert-Kunz multiplicity of three-dimensional local rings , author=. Nagoya Mathematical Journal , volume=. 2005 , publisher=

    2005

  44. [53]

    Sur une classe de problemes de d

    Kreweras, Germain , journal=. Sur une classe de problemes de d

  45. [54]

    Discrete & Computational Geometry , volume=

    Two poset polytopes , author=. Discrete & Computational Geometry , volume=. 1986 , publisher=

    1986

  46. [55]

    2025 , eprint=

    Analysis in Hilbert-Kunz theory , author=. 2025 , eprint=

    2025

  47. [56]

    Séminaire Lotharingien de Combinatoire , year =

    Kahane, Yakob and Mishna, Marni , title =. Séminaire Lotharingien de Combinatoire , year =

  48. [57]

    Proceedings of the Genetic and Evolutionary Computation Conference Companion , pages=

    Hot off the Press: The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem , author=. Proceedings of the Genetic and Evolutionary Computation Conference Companion , pages=

  49. [58]

    2020 , eprint=

    The h^* -polynomial of the order polytope of the zig-zag poset , author=. 2020 , eprint=

    2020

  50. [59]

    1991 , journal =

    Counting linear extensions , author =. 1991 , journal =

    1991

  51. [60]

    Extensions of partial cyclic orders and consecutive coordinate polytopes , volume=

    Ayyer, Arvind and Josuat-Vergès, Matthieu and Ramassamy, Sanjay , year=. Extensions of partial cyclic orders and consecutive coordinate polytopes , volume=. doi:10.5802/ahl.33 , journal=

    doi

  52. [61]

    arXiv preprint arXiv:2512.20442 , year=

    A Proof of a conjecture of Watanabe--Yoshida via Ehrhart Theory , author=. arXiv preprint arXiv:2512.20442 , year=

  53. [62]

    Yakob Kahane , title =

  54. [63]

    2025 , eprint=

    Order polytopes of crown posets , author=. 2025 , eprint=

    2025

  55. [64]

    Decompositions of rational convex polytopes , author=. Ann. Discrete Math , volume=

  56. [65]

    2026 , eprint=

    Ehrhart positivity for lattice path matroids , author=. 2026 , eprint=

    2026

Pith tools

Reviewed July 14, 2026 · model on record in the stance chip above.