pith. sign in

arxiv: 2508.04396 · v3 · submitted 2025-08-06 · 🧮 math.CO

Unimodality and Cluster Algebras from Surfaces

Wonwoo Kang , Kyeongjun Lee , Eunsung Lim This is my paper

Pith reviewed 2026-05-19 00:26 UTC · model grok-4.3

classification 🧮 math.CO
keywords unimodalityrank polynomialsloop fence posetscluster algebrasnotched arcsorder idealsF-polynomialsalmost interlacing
0
0 comments X

The pith

The rank polynomial of the lattice of order ideals of a loop fence poset is unimodal.

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

The paper proves that the rank polynomial of the lattice of order ideals of a loop fence poset is unimodal. This poset arises as the poset of join-irreducibles in the lattice of good matchings of loop graphs associated with notched arcs. Equivalently, the polynomials come from evaluating all coefficient variables in an F-polynomial at a single variable q. The work further shows that rank polynomials for any tagged arc are unimodal and almost interlacing, and that cluster expansions for single-curve laminations are unimodal. A reader would care because these properties reveal combinatorial regularity in objects that encode algebraic and geometric data from surfaces.

Core claim

We prove that the rank polynomial of the lattice of order ideals of a loop fence poset is unimodal. This poset arises as the poset of join-irreducibles in the lattice of good matchings of loop graphs associated with notched arcs. Equivalently, such polynomials can be obtained by evaluating all coefficient variables in an F-polynomial at a single variable q. We also conclude that the rank polynomial of any tagged arc, whether plain or notched, is not only unimodal but also satisfies a symmetry condition known as almost interlacing. Furthermore, when the lamination consists of a single curve, the cluster expansion-evaluated by setting all cluster variables to 1 and all coefficient variables to

What carries the argument

The loop fence poset, identified as the poset of join-irreducibles in the lattice of good matchings of loop graphs from notched arcs, which yields the rank polynomial via F-polynomial evaluation at one variable.

Load-bearing premise

The loop fence poset correctly matches the poset of join-irreducibles in the lattice of good matchings of loop graphs associated with notched arcs.

What would settle it

A concrete small loop fence poset whose order ideal lattice has a rank polynomial with coefficients that rise then fall then rise again, violating unimodality.

Figures

Figures reproduced from arXiv: 2508.04396 by Eunsung Lim, Kyeongjun Lee, Wonwoo Kang.

Figure 1
Figure 1. Figure 1: illustrates a tagged arc γ (p) together with its two possible hook replacements at the notched endpoint. γ (p) p γ˜ p γ˜ p [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Example of an ideal triangulation T of octagon Example 1. Consider the example in [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Defining the shear coordinates Definition 11. (Shear Coordinates) Let L be a lamination and T a triangulation without self-folded triangles. For each arc γ in T, the shear coordinate of L with respect to T, denoted by bγ(T, L), is defined as the sum of contributions from all intersections of curves in L with the arc γ. Specifically, an intersection contributes +1 (resp., −1) to bγ(T, L) if the correspondin… view at source ↗
Figure 4
Figure 4. Figure 4: Example of lamination L in triangulation T Example 2 [PITH_FULL_IMAGE:figures/full_fig_p007_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: An elementary lamination Lγ associated with a tagged arc γ, plain(left) and notched(right). Definition 14 (Principal Coefficients). A cluster pattern t 7→ (xt, yt, Bt) on Tn (or the corresponding cluster algebra A) is said to have principal coefficients at a vertex t0 if the semifield P is equal to the tropical semifield generated by the coefficients y1, . . . , yn, and the coefficient tuple yt0 is equal t… view at source ↗
Figure 6
Figure 6. Figure 6: Building a fence poset for an arc. Next, suppose that γ (p) is notched at its starting point s(γ) = p. Begin by constructing the fence poset for the underlying plain arc. Let ∆0 be the first triangle traversed by γ (p) ; necessarily, ∆0 is bordered by 1 and two spokes at p. Denote the set of all spokes at p in T by σ1, . . . , σm, listed counterclockwise, where σ1 is the counterclockwise neighbor of 1. If … view at source ↗
Figure 7
Figure 7. Figure 7: Structure of P (n+1)(α) when s is odd(left) and when s is even(right) Note that this construction of notched fence posets coincides with the loop fence posets associated to notched arcs. A singly notched fence poset corresponds to a singly notched arc, while a doubly notched fence poset corresponds to a doubly notched arc. We denote the associated rank polynomial by R(i,j) (α; q) for a general (i, j)-fence… view at source ↗
Figure 8
Figure 8. Figure 8: An example of P (n+1) T (α) when α = (2, 2, 2, 2) Next, let PT (α) be the circular poset obtained by removing the relation xn−αs ≺ xn−αs+1 from P (n+1) T (α), and let RT (α; q) denote its rank polynomial. Let γ be the poset obtained from PT (α) by removing xn−αs and all the vertices above it and removing xn−αs+1 along with all the vertices below it. The ideals of PT (α) then consist of: (1) those in P (n+1… view at source ↗
Figure 9
Figure 9. Figure 9: δ for P (n+1) T (α) when α = (2, 2, 2, 2) There are now two types of ideals in δ: - those that include xT˜, contributing q d1−αsR(β; q), - and those that exclude it, contributing R(γ; q). Thus, we obtain: R(δ; q) = q d1−αsR(β; q) + R(γ; q). Substituting into the earlier expression gives: R(α; q) = RT (α; q) − q αs+1R(δ; q). (1) By Theorem 7, both RT (α; q) and R(δ; q) are symmetric polynomials. Note that d… view at source ↗
Figure 10
Figure 10. Figure 10: An example of P (n+1) B (α) when α = (2, 2, 2, 2) Now, define PB(α) as the poset obtained from P (n+1) B (α) by removing the relation xn+1 ≺ xn−αs , and let RB(α; q) be the corresponding rank polynomial. The number of vertices below xn−αs in PB(α) is αs−1 − 1. By applying the same decomposition argument as before, we obtain: R (n+1) B (α; q) = qR(n+1)(α; q) + R(β ′ ; q), RB(α; q) = R (n+1) B (α; q) + q αs… view at source ↗
Figure 11
Figure 11. Figure 11: An example of α when α1 ̸= 0 and s is odd Define P (1)(n+1) T (α) to be the poset obtained by adding a new vertex xT that lies above both xα1+1 and xn+1 in the fence poset associated with α. Let R (1)(n+1) T (α; q) denote its rank polynomial. The ideals of P (1)(n+1) T (α) can be divided into two types: those that contain xT and those that do not. Let β be the composition obtained by removing xT and all v… view at source ↗
Figure 12
Figure 12. Figure 12: Constructing δ for α in [PITH_FULL_IMAGE:figures/full_fig_p019_12.png] view at source ↗
Figure 13
Figure 13. Figure 13: Counterexample of (ineqA) in single lamination Example 3 [PITH_FULL_IMAGE:figures/full_fig_p024_13.png] view at source ↗
Figure 14
Figure 14. Figure 14: Example of triangulation of 16-gon with single lamination [PITH_FULL_IMAGE:figures/full_fig_p024_14.png] view at source ↗
read the original abstract

We prove that the rank polynomial of the lattice of order ideals of a loop fence poset is unimodal. This poset arises as the poset of join-irreducibles in the lattice of good matchings of loop graphs associated with notched arcs. Equivalently, such polynomials can be obtained by evaluating all coefficient variables in an F-polynomial at a single variable q. We also conclude that the rank polynomial of any tagged arc, whether plain or notched, is not only unimodal but also satisfies a symmetry condition known as almost interlacing. Furthermore, when the lamination consists of a single curve, the cluster expansion-evaluated by setting all cluster variables to 1 and all coefficient variables to q-is also unimodal. We conjecture that polynomials in this case are log-concave.

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

2 major / 2 minor

Summary. The paper proves that the rank polynomial of the lattice of order ideals of the loop fence poset is unimodal. This poset is identified as the poset of join-irreducibles in the lattice of good matchings of loop graphs associated with notched arcs, allowing the result to transfer to single-variable specializations of F-polynomials. It further shows that rank polynomials of tagged arcs (plain or notched) are unimodal and almost interlacing, that cluster expansions for single-curve laminations are unimodal, and conjectures log-concavity in that case.

Significance. If the poset identification holds, the results supply explicit combinatorial models for unimodality and symmetry properties of F-polynomials and cluster expansions arising from surfaces, strengthening links between order-ideal lattices and cluster-algebra combinatorics. The explicit transfer from loop-fence posets to F-polynomial coefficients provides a concrete, checkable route to these algebraic statements.

major comments (2)
  1. [§2.3] §2.3 and the statement preceding Theorem 4.1: the identification of the loop fence poset as the poset of join-irreducibles of the good-matchings lattice for notched arcs is load-bearing for the transfer of unimodality to F-polynomial coefficients. The manuscript must exhibit an explicit order-preserving bijection and verify that the rank function on order ideals coincides with total degree after the single-variable substitution; any mismatch in covering relations induced by different notch configurations would invalidate the equivalence.
  2. [Theorem 5.2] Theorem 5.2 (tagged-arc case): the almost-interlacing symmetry is asserted for both plain and notched arcs, but the proof sketch does not indicate whether the argument for notched arcs re-uses the loop-fence reduction or requires separate case analysis; a single counter-example surface (e.g., once-punctured torus with two notches) would falsify the uniform claim.
minor comments (2)
  1. Notation for the single-variable specialization of the F-polynomial is introduced without a displayed equation; adding an explicit formula (e.g., F(x_1,...,x_n)|_{x_i=q}) would clarify the equivalence stated in the abstract.
  2. The conjecture on log-concavity for single-curve laminations is stated without any supporting numerical checks or small-surface examples; including a short table of computed polynomials for the simplest cases would help readers assess plausibility.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading and valuable comments on our paper. The points raised are important for strengthening the combinatorial arguments. We address them point by point below and have updated the manuscript to incorporate the suggested clarifications and additions.

read point-by-point responses

  1. Referee: [§2.3] §2.3 and the statement preceding Theorem 4.1: the identification of the loop fence poset as the poset of join-irreducibles of the good-matchings lattice for notched arcs is load-bearing for the transfer of unimodality to F-polynomial coefficients. The manuscript must exhibit an explicit order-preserving bijection and verify that the rank function on order ideals coincides with total degree after the single-variable substitution; any mismatch in covering relations induced by different notch configurations would invalidate the equivalence.

    Authors: We agree with the referee that an explicit bijection is necessary to make the identification fully rigorous. The original manuscript states the correspondence but relies on the reader's ability to reconstruct the map from the definitions. In the revised manuscript, we have added Subsection 2.4 which constructs an explicit order-preserving bijection between the elements of the loop fence poset and the join-irreducible good matchings. We also prove that the covering relations correspond exactly, ensuring that the rank of an order ideal equals the total degree of the corresponding monomial in the F-polynomial after setting all variables to q. This holds uniformly for different notch configurations by the way the loop graph is defined. revision: yes

  2. Referee: [Theorem 5.2] Theorem 5.2 (tagged-arc case): the almost-interlacing symmetry is asserted for both plain and notched arcs, but the proof sketch does not indicate whether the argument for notched arcs re-uses the loop-fence reduction or requires separate case analysis; a single counter-example surface (e.g., once-punctured torus with two notches) would falsify the uniform claim.

    Authors: The argument for notched arcs in Theorem 5.2 does re-use the loop-fence reduction via the identification established in Section 2. For plain arcs, the proof is direct from the structure of the tagged arc poset without needing the fence poset. We have revised the proof to make this distinction clear and to indicate the reuse explicitly. Additionally, we have verified the claim on the once-punctured torus with two notches by direct computation of the rank polynomial, which satisfies the almost-interlacing symmetry, thus supporting the uniform statement. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation relies on direct combinatorial arguments and external cluster-algebra identifications.

full rationale

The paper proves unimodality of the rank polynomial for the loop fence poset via explicit combinatorial arguments on order ideals and covering relations. The identification of this poset as the join-irreducibles of the good-matchings lattice for notched arcs is presented as a standard construction from prior cluster-algebra literature rather than a self-derived or fitted input. No equations reduce by construction to their own outputs, no parameters are fitted then renamed as predictions, and self-citations (if present) are not load-bearing for the new unimodality or almost-interlacing statements. The central claims remain independently verifiable against poset combinatorics and do not collapse into the inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claims rest on standard definitions of posets, order ideals, and F-polynomials from cluster algebra theory on surfaces; no new free parameters, ad-hoc axioms, or invented entities are introduced beyond the setup of loop fence posets and notched arcs.

axioms (2)
  • standard math Standard properties of lattices of order ideals and join-irreducible elements hold for the defined posets.
    Invoked when identifying the loop fence poset as the join-irreducibles of the good matchings lattice.
  • domain assumption F-polynomials in cluster algebras from surfaces can be specialized by setting all coefficient variables to a single variable q.
    Used to equate the rank polynomial evaluation to the F-polynomial specialization.

pith-pipeline@v0.9.0 · 5660 in / 1473 out tokens · 42687 ms · 2026-05-19T00:26:31.119616+00:00 · methodology

discussion (0)

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

Forward citations

Cited by 1 Pith paper

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

  1. Cluster Expansions from Punctured Orbifolds

    math.CO 2026-05 unverdicted novelty 7.0

    Equivalent combinatorial expansion formulas for generalized cluster algebras on punctured orbifolds are derived using snake graphs, labelled posets, matrices, and T-walks, generalizing prior results for surfaces and u...

Reference graph

Works this paper leans on

20 extracted references · 20 canonical work pages · cited by 1 Pith paper · 2 internal anchors

  1. [1]

    Hodge theory for combinatorial geometries

    Karim Adiprasito, June Huh, and Eric Katz. “Hodge theory for combinatorial geometries”. In:Ann. of Math. (2)188.2 (2018), pp. 381–452.issn: 0003-486X,1939-8980.doi:10.4007/annals.2018.188.2.1. url:https://doi.org/10.4007/annals.2018.188.2.1

    work page doi:10.4007/annals.2018.188.2.1 2018

  2. [2]

    Skein relations for punctured surfaces

    Esther Banaian, Wonwoo Kang, and Elizabeth Kelley. “Skein relations for punctured surfaces”. In:arXiv preprint arXiv:2409.04957(2024)

    work page arXiv 2024

  3. [3]

    Arc representations

    Salomón Domínguez. “Arc representations”. In:arXiv preprint arXiv:1709.09521(2017)

    work page internal anchor Pith review Pith/arXiv arXiv 2017

  4. [4]

    Albert Fathi et al.Thurston’s Work on Surfaces (MN-48). Vol. 48. Princeton University Press, 2012. isbn: 9780691147352.url:http://www.jstor.org/stable/j.ctv1n35fh9(visited on 08/05/2024)

    work page 2012

  5. [5]

    VladimirV.FockandAlexanderB.Goncharov.Dual Teichmüller and lamination spaces.Ed.byAthanase Papadopoulos. Vol. 1. IRMA Lectures in Mathematics and Theoretical Physics. European Mathematical Society, 2007, pp. 647–684.isbn: 978-3-03719-029-6.doi:10.4171/029-1/16.url:https://doi.org/ 10.4171/029-1/16

    work page doi:10.4171/029-1/16.url:https://doi.org/ 2007

  6. [6]

    Cluster algebras and triangulated surfaces. I. Cluster complexes

    Sergey Fomin, Michael Shapiro, and Dylan Thurston. “Cluster algebras and triangulated surfaces. I. Cluster complexes”. In:Acta Math.201.1 (2008), pp. 83–146.issn: 0001-5962,1871-2509.doi:10.1007/ s11511-008-0030-7.url:https://doi.org/10.1007/s11511-008-0030-7

    work page doi:10.1007/s11511-008-0030-7 2008

  7. [7]

    Cluster algebras and triangulated surfaces Part II: Lambda lengths

    Sergey Fomin and Dylan Thurston. “Cluster algebras and triangulated surfaces Part II: Lambda lengths”. In:Mem. Amer. Math. Soc.255.1223 (2018), pp. v+97.issn: 0065-9266,1947-6221.doi:10.1090/memo/ 1223.url:https://doi.org/10.1090/memo/1223

    work page doi:10.1090/memo/ 2018

  8. [8]

    Cluster algebras. I. Foundations

    Sergey Fomin and Andrei Zelevinsky. “Cluster algebras. I. Foundations”. In:J. Amer. Math. Soc.15.2 (2002), pp. 497–529.issn: 0894-0347,1088-6834.doi:10.1090/S0894-0347-01-00385-X.url:https: //doi.org/10.1090/S0894-0347-01-00385-X

    work page doi:10.1090/s0894-0347-01-00385-x.url:https: 2002

  9. [9]

    Cluster algebras. IV. Coefficients

    Sergey Fomin and Andrei Zelevinsky. “Cluster algebras. IV. Coefficients”. In:Compos. Math.143.1 (2007), pp. 112–164.issn: 0010-437X,1570-5846.doi:10.1112/S0010437X06002521.url:https:// doi.org/10.1112/S0010437X06002521

    work page doi:10.1112/s0010437x06002521.url:https:// 2007

  10. [10]

    Introduction to cluster algebras

    Max Glick and Dylan Rupel. “Introduction to cluster algebras”. In:Symmetries and integrability of difference equations. CRM Ser. Math. Phys. Springer, Cham, 2017, pp. 325–357.isbn: 978-3-319-56665- 8

    work page 2017

  11. [11]

    Canonical bases for cluster algebras

    Mark Gross et al. “Canonical bases for cluster algebras”. In:J. Amer. Math. Soc.31.2 (2018), pp. 497– 608.issn: 0894-0347,1088-6834.doi:10.1090/jams/890.url:https://doi.org/10.1090/jams/890

    work page doi:10.1090/jams/890.url:https://doi.org/10.1090/jams/890 2018

  12. [12]

    Matching signatures and pfaffian graphs.Discrete Mathematics, 311(4):289–294, 2011.doi:10.1016/j.disc

    Ezgi Kantarcı Oğuz and Mohan Ravichandran. “Rank polynomials of fence posets are unimodal”. In:Dis- crete Mathematics346.2 (2023), p. 113218.issn: 0012-365X.doi:https://doi.org/10.1016/j.disc. 2022.113218.url:https://www.sciencedirect.com/science/article/pii/S0012365X22004241. 25

    work page doi:10.1016/j.disc 2023

  13. [13]

    Vanishing of local cohomology with applications to Hodge theory

    Ezgi Kantarcı Oğuz and Emine Yıldırım. “Cluster expansions:T-walks, labeled posets and matrix calcu- lations”. In:J. Algebra669 (2025), pp. 183–219.issn: 0021-8693,1090-266X.doi:10.1016/j.jalgebra. 2025.01.024.url:https://doi.org/10.1016/j.jalgebra.2025.01.024

    work page doi:10.1016/j.jalgebra 2025

  14. [14]

    q-deformed rationals andq-continued fractions

    Sophie Morier-Genoud and Valentin Ovsienko. “q-deformed rationals andq-continued fractions”. In: Forum Math. Sigma8 (2020), Paper No. e13, 55.issn: 2050-5094.doi:10.1017/fms.2020.9.url: https://doi.org/10.1017/fms.2020.9

    work page doi:10.1017/fms.2020.9.url: 2020

  15. [15]

    Positivity for cluster algebras from surfaces

    Gregg Musiker, Ralf Schiffler, and Lauren Williams. “Positivity for cluster algebras from surfaces”. In: Adv. Math.227.6 (2011), pp. 2241–2308.issn: 0001-8708,1090-2082.doi:10.1016/j.aim.2011.04.018. url:https://doi.org/10.1016/j.aim.2011.04.018

    work page doi:10.1016/j.aim.2011.04.018 2011

  16. [16]

    Chainlink polytopes and Ehrhart equivalence

    Ezgi Kantarcı Oˇ guz, Cem Yalım Özel, and Mohan Ravichandran. “Chainlink polytopes and Ehrhart equivalence”. In:Ann. Comb.28.4 (2024), pp. 1141–1166.issn: 0218-0006,0219-3094.doi:10 . 1007 / s00026-023-00683-x.url:https://doi.org/10.1007/s00026-023-00683-x

    work page doi:10.1007/s00026-023-00683-x 2024

  17. [17]

    Posets forF-polynomials in cluster algebras from surfaces

    Vincent Pilaud, Nathan Reading, and Sibylle Schroll. “Posets forF-polynomials in cluster algebras from surfaces”. In:arXiv preprint arXiv:2311.06033(2023)

    work page arXiv 2023

  18. [18]

    On the geometry and dynamics of diffeomorphisms of surfaces

    William P. Thurston. “On the geometry and dynamics of diffeomorphisms of surfaces”. In:Bull. Amer. Math. Soc. (N.S.)19.2 (1988), pp. 417–431.issn: 0273-0979,1088-9485.doi:10.1090/S0273- 0979- 1988-15685-6.url:https://doi.org/10.1090/S0273-0979-1988-15685-6

    work page doi:10.1090/s0273- 1988

  19. [19]

    Cluster algebras: an introduction

    Lauren K. Williams. “Cluster algebras: an introduction”. In:Bull. Amer. Math. Soc. (N.S.)51.1 (2014), pp. 1–26.issn: 0273-0979,1088-9485.doi:10.1090/S0273-0979-2013-01417-4.url:https://doi. org/10.1090/S0273-0979-2013-01417-4

    work page doi:10.1090/s0273-0979-2013-01417-4.url:https://doi 2014

  20. [20]

    Surfaceclusteralgebraexpansionformulaevialoopgraphs

    JonWilson.“Surfaceclusteralgebraexpansionformulaevialoopgraphs”.In:arXiv preprint arXiv:2006.13218 (2020). International Center for Mathematical Sciences, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Acad. G. Bonchev Str., Bl. 8, Sofia 1113, Bulgaria Email address:wonk@math.bas.bg Department of Mathematical Sciences, Ulsan Nati...

    work page internal anchor Pith review arXiv 2006