Pith. sign in

REVIEW 1 major objections 6 minor 20 references

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

T0 review · 1 major / 6 minor · reviewed 2026-08-04 · deepseek-v4-flash

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

Pith's one-line read Greedy right-to-left records count the order polynomial of every fence poset, and a cyclic version proves the circular-fence conjecture.

desk verdict Strong, original work on fence and circular-fence order polynomials, with the caveat that the circular-fence conjecture depends on an under-verified external lemma. read the letter →

arxiv 2607.22767 v2 pith:UC4DQHEW submitted 2026-07-24 math.CO

Pyuyi Chufeng Huang This is my paper · ORCID
classification math.CO MSC 05A1505A1905E0506A07
keywords fenceposetorderpolynomialpermutationstatisticgreedyrecordsBernsteinbasiscircularcycliclinearextensions
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

This paper shows that the order polynomial of any fence poset — the number of order-preserving maps from the poset to a chain — is governed by a simple greedy statistic on permutations. Scan the permutation from right to left and record an entry whenever it beats the current threshold according to the local orientation of the fence; the generating function of these record counts equals n! times the order polynomial. The proof works by transferring a continuous random-threshold recurrence into a finite count using the Bernstein basis. The same construction, with a canonical root chosen on a cycle, gives an analogous identity for circular fences and settles a conjecture about their order polynomials. Along the way the paper produces explicit bijections and finer refinements by record set, direction, and terminal value.

What carries the argument

The load-bearing device is the Bernstein basis b_{m,k}(x) = binom(m-1,k-1) x^{k-1}(1-x)^{m-k}. A continuous record process with threshold x satisfies integral recurrences whose solution H_w^{(m)}(x) is a polynomial; the transfer lemma expresses H_w^{(m)}(x) as a Bernstein-basis combination whose coefficients are precisely the endpoint-refined counts C_w^{(m)}(k) of order-preserving maps with a specified value at the rightmost vertex. For cycles, the same counts are packaged into transfer matrices N_+(x) and N_-(x), and the derivative of their trace telescopes into a sum over all possible record roots, yielding the cyclic identity.

What would settle it

For a fixed small cycle, say the 6-vertex orientation with signs (+,+,-,+,-,-), enumerate all 720 permutations, compute the cyclic record statistic crec_η(π), and compare the polynomial Σπ t^crec_η(π) to 720·Ω(C_η;t); any mismatch would disprove the cyclic identity. The closing lemma can be tested independently on the same example by cutting at the maximum ascent vertex and checking that the resulting path block partition re-closes uniquely.

Watch

Extended reading notes

Core claim

The central discovery is a pair of exact identities. For every orientation ε of an n-vertex path, the generating function over permutations weighted by the greedy ε-record count rec_ε(π) equals n! times the order polynomial Ω(P_ε; t). For every nonconstant orientation η of a cycle, the analogous cyclic-record count crec_η(π) equals n! times Ω(C_η; t). The path identity is proved by conditioning on the rightmost value in a continuous uniform model, expanding the expected value of m^records in the Bernstein basis, and identifying the coefficients with endpoint-refined counts of order-preserving maps. The cyclic identity is proved by a trace identity for transfer matrices, where the derivative

Load-bearing premise

The circular-fence proof leans on a borrowed lemma guaranteeing that a greedy block partition of the cut path closes uniquely to a valid circular block partition; if that lemma is false or does not apply, the identification between cyclic records and block counts would need to be re-established from scratch.

Editorial extensions

If this is right

  • For alternating signs, the path identity solves the zig-zag problem posed in the literature: n! times the zig-zag order polynomial equals the generating function of the greedy record statistic.
  • For the monotone orientation, the statistic reduces to the classical number of right-to-left maxima, recovering the classical identity t(t+1)...(t+n-1).
  • The finite Bernstein transfer gives an explicit bijection between pairs (σ, f) with f order-preserving from P_ε to [m] and pairs (π, λ) assigning labels to the record positions, valid for m ≤ n and extended algorithmically to all m by an inclusion-exclusion sieve.
  • Refining by the complete record set identifies every fixed fiber with linear extensions of a record poset whose cover graph is a caterpillar; a known recursion for tree-like posets then computes the terminal-value spectrum in quadratic time.
  • The cyclic record identity proves the circular-fence conjecture: for every circular fence whose Hasse diagram is a cycle, n! Ω(C; t) equals the generating function of a block statistic over permutations.

Reading between the lines

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

  • The method suggests a general dictionary: any scan-and-compare statistic whose local comparisons follow the signs of a poset may have its generating function equal to n! times an order polynomial, with the Bernstein basis acting as a natural threshold basis.
  • The finite bijection for arbitrary alphabets might be turned into an efficient exact sampler for order-preserving maps weighted by records, leveraging the caterpillar record posets to compute record-set distributions quickly.
  • The cyclic trace-derivative identity is a new instance of a 'records from a trace derivative' phenomenon that could extend to other cyclic posets, such as crown-like posets, yielding cyclic analogues of the record-set refinement.
  • Because record-set fibers are linear extensions of caterpillars, the paper implicitly connects fence order-polynomial coefficients to tree-extension enumeration, which may lead to closed formulas for specific orientations.
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

1 major / 6 minor

Summary. The paper defines a greedy right-to-left record statistic rec_ε on S_n for an oriented path fence P_ε and a cyclic analogue crec_η for oriented cycles C_η. The main results are a Bernstein-basis transfer proof that ∑_{π∈S_n} t^{rec_ε(π)} = n! Ω(P_ε; t) (Theorem 1.1), a cyclic analogue ∑_{π∈S_n} t^{crec_η(π)} = n! Ω(C_η; t) (Theorem 4.3), finite and bijective versions of the transfer (Theorems 5.8, 6.6, 6.7), refinements by record set, direction, terminal value, and P-partitions (Sections 7 and 8), and a reflection identification with Kahane's block statistic (Proposition 2.4). The paper further claims Kahane's circular-fence conjecture as Corollary 4.6, via Lemma 4.4 and Proposition 4.5.

Significance. If the proofs are correct, this is an elegant and substantial contribution. Theorems 1.1 and 4.3 give permutation-statistic interpretations of order polynomials for all fences and oriented cycles, resolving the zig-zag specialization posed by Ferroni--Morales--Panova and supplying a new proof of Kahane's circular-fence conjecture. The Bernstein transfer is parameter-free and explicit, and the paper goes beyond equidistribution with concrete bijections (Lemma 6.3, Theorem 6.6), record-poset refinements, and a linear-extension recursion with an O(n^2) complexity bound. The main identities are supported by checkable recurrences and appear internally consistent. The principal reservation is that the final step to the circular-fence conjecture rests on an unverified external lemma, detailed below.

major comments (1)
  1. [§4, Lemma 4.4 and Corollary 4.6] Corollary 4.6, one of the paper's headline claims, depends on Lemma 4.4, which asserts that cutting a circular fence at the maximal ascent vertex and taking the path's greedy block partition yields the unique valid circular block partition. The manuscript's direct verification covers pairwise block-validity relations, but the substantive existence, maximality, and uniqueness steps are deferred to 'Inspection of that argument shows' and 'uniqueness follows again from [9, Lemma 4.7]'. The hypotheses of Kahane's Lemma 4.7 are never stated, so the reader cannot verify that the particular cut path satisfies them. This is load-bearing for Corollary 4.6. Please either prove Lemma 4.4 in full, or state [9, Lemma 4.7] precisely and verify its hypotheses, including the maximality condition on the chosen ascent vertex.
minor comments (6)
  1. [§4, Proposition 4.5 proof] The sentence 'By Theorem 4.4, restoring the cut edge produces Kahane's unique valid circular partition' should refer to Lemma 4.4; there is no Theorem 4.4.
  2. [§4, before (7)] The definition of T_r(x) is written inline and contains n−1 matrices in a cyclic order; displaying it would improve readability and reduce the risk of misreading the order of multiplication.
  3. [§5, Definition 5.6] The factorial expression for κ_r^{(m)}(k,ℓ) is formally undefined outside the binomial range; the convention for binomial coefficients is stated after the formula, but placing it before would avoid ambiguity.
  4. [§6, Corollary 6.7] The phrase 'algorithmic bijection' for the arbitrary-alphabet case is accurate, but the bijection is obtained via the Garsia--Milne involution principle rather than a direct recursive rule; the wording could clarify this so readers do not expect a simple one-pass construction.
  5. [§7.4] The stable principal specialization formula ps_q(F_{S,n}) = q^{comaj_n(S)}/(q;q)_n is used without proof or reference; a citation or a one-line verification would make the section self-contained.
  6. [§3, Lemma 3.4] In the proof of (4), the case ℓ=m is dismissed with 'the binomial theorem'; the derivative argument works uniformly, so this one-sentence justification is slightly misleading.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity found; the main identities are proved via independent transfers, and the use of Kahane's Lemma 4.7 is an external dependency rather than a circular reduction.

full rationale

The central path identity, Theorem 1.1, is not circular: the statistic rec_epsilon is defined independently (Definition 2.2), and the proof proceeds through a Bernstein-basis transfer between the continuous record process and endpoint-refined order-preserving maps (Lemma 3.5, Lemma 3.2). No parameter is fitted to the order polynomial, and the identity is checked on all positive integers m before polynomial interpolation. The cyclic identity, Theorem 4.3, is likewise proved by a distinct trace-matrix argument (Proposition 4.1 and equation (8)); its derivation does not assume the final identity. The only substantive external dependency is Kahane's Lemma 4.7, invoked in Lemma 4.4 to close a path block partition to the unique valid circular block partition and to justify uniqueness. That is a reliance on another author's independent result, not a self-citation, and it is not the circular-fence conjecture itself: Corollary 4.6 still requires Theorem 4.3 plus the reflection identification (Proposition 4.5). Even if Kahane's lemma were false or insufficiently verified, that would be a correctness risk, not a circular step. There are no fitted inputs renamed as predictions, no load-bearing self-citations, and no known result merely re-labeled as new.

Assumptions & free parameters 0 free parameters · 7 assumptions · 0 invented entities

No free parameters: all constants are structural. The main external dependencies are standard poset/order-polynomial facts, Bernstein-basis identities, Garsia–Milne, Atkinson's tree recursion, and Kahane's Lemma 4.7 for closing path blocks to circular blocks. No physical or structural entities are postulated; the new statistics and record posets are internal combinatorial definitions with proofs.

assumptions (7)
  • standard math Ω(P;m) counts order-preserving maps P→[m]; the order polynomial is determined by these values.
    Used throughout; stated in Section 1 from Stanley [20, Ch. 3] and in Lemma 3.2.
  • standard math Relative order of n i.i.d. continuous random variables is uniform over S_n, and rec_ε / crec_η depend only on this relative order.
    Essential in the proofs of Theorem 1.1 and Theorem 4.3 to replace permutation sums by expectations.
  • standard math Bernstein basis identities: binomial summation, beta integral ∫ b_{m,k}=1/m, degree elevation.
    Used in Lemmas 3.4, 5.4, and 5.7; cited to Farouki [4].
  • standard math Garsia–Milne involution principle.
    Used in Corollary 6.7 to extend explicit bijections to arbitrary alphabets; cited [6].
  • domain assumption Atkinson's recursion for linear extensions of posets whose cover graph is a tree.
    Used in Proposition 8.2 to compute terminal-value spectra; cited [1].
  • domain assumption Kahane's block-statistic definitions and Lemma 4.7: a greedy path partition closes to a unique valid circular block partition when the cut vertex is a maximum ascent label.
    Used in Lemma 4.4 and Proposition 4.5 to identify cyclic records with circular blocks and prove Conjecture 4.6; deferred to [9].
  • standard math Gessel's fundamental quasisymmetric functions and the stable principal specialization ps_q(F_{S,n}) = q^{comaj_n(S)}/(q;q)_n.
    Used in Section 7.4, Corollary 7.6; cited [7,19].

how reviews work

0 comments
Cite this review

Pith. "Pith review of Bernstein Transfers and Greedy Records for Fence and Circular-Fence Order Polynomials." pith.science (2026). https://pith.science/paper/UC4DQHEW

@misc{pith2026260722767,
  author       = {Pith},
  title        = {Pith review of: Bernstein Transfers and Greedy Records for Fence and Circular-Fence Order Polynomials},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/UC4DQHEW}},
  note         = {Machine review of arXiv:2607.22767}
}
abstract

Let \(P_\eps\) be the fence poset associated with an orientation \(\eps\in\{+,-\}^{n-1}\) of a path. We define a greedy right-to-left record statistic \(\rec_\eps\) on \(S_n\) and prove \[ \sum_{\pi\in S_n}t^{\rec_\eps(\pi)}=n!\Omega(P_\eps;t), \] by a Bernstein-basis transfer between a continuous threshold recurrence and endpoint-refined order-preserving maps. Under reflection, this statistic agrees pointwise with Kahane's independently obtained greedy block statistic; the alternating specialization gives the zig-zag case posed by Ferroni, Morales, and Panova. A finite form of the transfer yields a direct recursive bijection for \(m\le n\), extended algorithmically to arbitrary alphabets. Refining by record set, direction, and terminal value identifies fixed fibers with decorated endpoint paths and pointed linear extensions of posets whose cover graphs are caterpillars. We also define cyclic records for every nonconstant orientation \(\eta\) of a cycle and prove \[ \sum_{\pi\in S_n}t^{\operatorname{crec}_\eta(\pi)} =n!\Omega(C_\eta;t). \] When the Hasse diagram is a cycle, reflection identifies these records with Kahane's circular blocks and establishes his circular-fence conjecture.

Figures

Figures reproduced from arXiv: 2607.22767 by the authors.

Figure 1
Figure 1. Two fence posets. A +-edge is directed downward from left to right, and a −-edge upward. (ii) The Bernstein recurrence lifts the path identity to endpoint-refined finite transfers and a direct recursive bijection for m ≤ n, with an algorithmic extension to arbitrary alphabets: Sn × {f : Pε → [m] order-preserving} ←→ {(π, λ) : π ∈ Sn, λ : Recε(π) → [m]}. (iii) Refining by the complete record set, record directions, a… view at source ↗

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

20 extracted references · 4 canonical work pages

  1. [1]

    M. D. Atkinson,On computing the number of linear extensions of a tree, Order7 (1990), no. 1, 23–25, doi:10.1007/BF00383170

    work page doi:10.1007/bf00383170 1990

  2. [2]

    H. Z. Q. Chen and P. B. Zhang,The unimodality of the Ehrhartδ-polynomial of the chain polytope of the zig-zag poset, arXiv:1603.08283, 2016

    arXiv 2016

  3. [3]

    J. I. Coons and S. Sullivant,Theh ∗-polynomial of the order polytope of the zig-zag poset, Electron. J. Combin.30(2023), no. 2, Paper No. 2.44, 20 pp

    2023

  4. [4]

    R. T. Farouki,The Bernstein polynomial basis: a centennial retrospective, Comput. Aided Geom. Design29(2012), no. 6, 379–419, doi:10.1016/j.cagd.2012.03.001

    doi:10.1016/j.cagd.2012.03.001 2012

  5. [5]

    Ferroni, A

    L. Ferroni, A. H. Morales, and G. Panova,Skew shapes, Ehrhart positivity and beyond, Proc. Lond. Math. Soc., to appear; arXiv:2503.16403v3, 2026

    arXiv 2026

  6. [6]

    A. M. Garsia and S. C. Milne,A Rogers–Ramanujan bijection, J. Combin. Theory Ser. A31(1981), no. 3, 289–339, doi:10.1016/0097-3165(81)90062-5

    work page doi:10.1016/0097-3165(81)90062-5 1981

  7. [7]

    I. M. Gessel,MultipartiteP-partitions and inner products of skew Schur functions, in Combinatorics and Algebra (Boulder, Colo., 1983), Contemp. Math., vol. 34, Amer. Math. Soc., Providence, RI, 1984, pp. 289–317

    1983

  8. [8]

    I. M. Gessel and C. Krattenthaler,Cylindric partitions, Trans. Amer. Math. Soc.349 (1997), no. 2, 429–479, doi:10.1090/S0002-9947-97-01791-1

    work page doi:10.1090/s0002-9947-97-01791-1 1997

Show all 20 references
  1. [9]

    Kahane,Combinatorial interpretation of the coefficients of the order polynomial of fence posets, arXiv:2607.11225v1 [math.CO], 13 July 2026

    Y. Kahane,Combinatorial interpretation of the coefficients of the order polynomial of fence posets, arXiv:2607.11225v1 [math.CO], 13 July 2026

    2026 arXiv

  2. [10]

    W. Kang, K. Lee, and E. Lim,Unimodality and cluster algebras from surfaces, Euro- pean J. Combin.136(2026), Paper No. 104392, doi:10.1016/j.ejc.2026.104392

    2026

  3. [11]

    Kantarcı Oğuz,Oriented posets, rank matrices andq-deformed Markov numbers, Discrete Math.348(2025), no

    E. Kantarcı Oğuz,Oriented posets, rank matrices andq-deformed Markov numbers, Discrete Math.348(2025), no. 2, Paper No. 114256, 17 pp., doi:10.1016/j.disc.2024.114256

    2025

  4. [12]

    Kantarcı Oğuz, C

    E. Kantarcı Oğuz, C. Y. Özel, and M. Ravichandran,Chainlink polytopes and Ehrhart equivalence, Ann. Comb.28(2024), no. 4, 1141–1166, doi:10.1007/s00026-023-00683- x

    2024 doi

  5. [13]

    Kantarcı Oğuz and M

    E. Kantarcı Oğuz and M. Ravichandran,Rank polynomials of fence posets are uni- modal, Discrete Math.346(2023), no. 2, Paper No. 113218, 20 pp

    2023

  6. [14]

    Lundström and L

    T. Lundström and L. Saud Maia Leite,Order polytopes of crown posets, European J. Combin.133(2026), Paper No. 104304, 24 pp., doi:10.1016/j.ejc.2025.104304

    2026

  7. [15]

    Morier-Genoud and V

    S. Morier-Genoud and V. Ovsienko,q-deformed rationals andq-continued fractions, Forum Math. Sigma8(2020), Paper No. e13, 55 pp

    2020

  8. [16]

    T. K. Petersen and Y. Zhuang,Zig-zag Eulerian polynomials, European J. Combin. 124(2025), Paper No. 104073, 30 pp., doi:10.1016/j.ejc.2024.104073

    2025

  9. [17]

    R. P. Stanley,Two poset polytopes, Discrete Comput. Geom.1(1986), no. 1, 9–23

    1986

  10. [18]

    R. P. Stanley,A survey of alternating permutations, inCombinatorics and Graphs, Contemp. Math., vol. 531, Amer. Math. Soc., Providence, RI, 2010, pp. 165–196

    2010

  11. [19]

    R. P. Stanley,Ordered structures and partitions, Mem. Amer. Math. Soc., no. 119, Amer. Math. Soc., Providence, RI, 1972

    1972

  12. [20]

    R. P. Stanley,Enumerative Combinatorics, Volume 1, second edition, Cambridge Studies in Advanced Mathematics, vol. 49, Cambridge University Press, Cambridge, 2012. School of Mathematics, Sichuan University, Chengdu 610064, China Email address:pyuyi233@gmail.com

    2012

Pith tools

Reviewed August 4, 2026 · model on record in the stance chip above.