Pith. sign in

REVIEW 2 major objections 5 minor 37 references

Cyclic Sieving for Staircase Plane Partitions via Crystals and Electrical Networks

T0 review · 2 major / 5 minor · reviewed 2026-08-02 · deepseek-v4-flash

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

Pith's one-line read This paper proves that promotion on height-two staircase plane partitions exhibits cyclic sieving, with the q-multi-Catalan product as the sieving polynomial.

desk verdict A genuinely interesting alternative proof of a known result, held back by an unproved invariance lemma and an overstated novelty claim. read the letter →

arxiv 2607.14028 v1 pith:2ZRLE5ZP submitted 2026-07-15 math.CO

Sam Hopkins , Jesse Kim , Stephan Pfannerer This is my paper
classification math.CO MSC 05E1805E10
keywords cyclicsievingphenomenonpromotionrowmotionstaircaseplanepartitionsq-multi-Catalannumberscrystalbaseselectricalnetworksbushbasis
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 paper proves a cyclic sieving result for the action of promotion on staircase plane partitions of height two. Cyclic sieving means that evaluating a certain product formula at roots of unity counts the points fixed by each power of the cyclic action, so one polynomial encodes the whole orbit structure. The proof interprets promotion on these partitions as rotation of 3-noncrossing perfect matchings, using crystals; it then identifies rotation with a natural cyclic action on the bush basis of the degree-two grove algebra, the coordinate ring of the space of electrical networks. A symplectic character computation turns the trace of that action into the q-multi-Catalan product formula. The paper also shows that existence of an electrical canonical basis in all degrees would extend the result to staircase plane partitions of arbitrary height.

What carries the argument

The central mechanism is the bush basis of the degree-two grove algebra. The grove algebra is the homogeneous coordinate ring of the space of electrical networks, and its degree-two part has a basis indexed by 3-noncrossing perfect matchings. A cyclic action on the electrical network space permutes this basis by rotation of the indexing matchings, mirroring promotion of height-two staircase plane partitions through a chain of equivariant bijections: staircase partitions to 2-fans of Dyck paths, then through the B₂ spin crystal to the C₂ vector crystal, and finally Sundaram's bijection to 3-noncrossing matchings. The trace of the cyclic action on the grove algebra is then evaluated as a sympl

What would settle it

For a small staircase, say n=5 and m=2, compute the number of height-two partitions fixed by the second power of promotion by brute force on 2-fans of Dyck paths, and compare it with the product formula Ω_{δ_5}(2; ζ^2) for ζ a primitive 12th root of unity. Alternatively, compute a bush-basis coefficient a_{σ,σ′,ξ} for one explicit trio using the full definition of valid opposite loopless resolutions and verify that the claimed simultaneous rotation invariance holds; a single counterexample would invalidate the basis-permutation step.

Watch

Extended reading notes

Core claim

The central discovery is that, for every n≥2, the pair (PP_2(δ_n), ⟨Row⟩ ≃ Z/2(n+1)Z, Ω_{δ_n}(2;q)) exhibits cyclic sieving, where Ω_{δ_n}(2;q) = ∏_{1≤i≤j≤n} (1−q^{i+j+4})/(1−q^{i+j}). Equivalently, for every k, the number of staircase plane partitions of size n and height two fixed by the k-th power of promotion equals Ω_{δ_n}(2; ζ^k), with ζ a primitive 2(n+1)-st root of unity. The polynomial is known to have nonnegative integer coefficients. The proof establishes an equivariant bijection from these partitions to 3-noncrossing perfect matchings under promotion versus rotation, then shows rotation permutes the bush basis of the degree-two grove algebra exactly as claimed. The trace of the c

Load-bearing premise

The load-bearing premise is an imported invariance of the bush-basis expansion coefficients under simultaneous rotation of the indexing matching and the associated complement operation on the two set partitions—the paper states this invariance without proof, so if it failed, the trace computation would count fixed points of a different action than promotion.

Editorial extensions

If this is right

  • Every symmetry class under promotion of height-two staircase plane partitions is enumerated by a product formula, because the sieving polynomial evaluates correctly at every root of unity.
  • The order of promotion, and hence of rowmotion, on PP_2(δ_n) is exactly 2(n+1) for n≥2.
  • The result adds an infinite family of posets for which the meta-conjecture about rowmotion cyclic sieving is now established.
  • If an electrical canonical basis exists in all degrees, the same trace computation yields cyclic sieving for promotion of staircase plane partitions of all heights.
  • The equivariant bijection lets one compute promotion on 3-noncrossing perfect matchings simply as rotation, giving a fast combinatorial model for the dynamics.

Reading between the lines

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

  • A natural testable extension is to search for the degree-three analogue of the bush basis; the paper's conditional result predicts exactly what its character must be, so a candidate basis could be verified numerically before a general construction is found.
  • The proof strategy—realizing a combinatorial cyclic action as rotation of a distinguished basis of a coordinate ring—suggests that other poset families from the meta-conjecture, such as shifted staircases, may be approachable through analogous bases of orthogonal Grassmannian coordinate rings, a direction the paper itself floats.
  • The paper notes a mysterious duality between spin invariants and Lagrangian-Grassmannian coordinate rings; if that duality is a manifestation of Howe duality, it might supply the missing structure needed for the all-degree electrical canonical basis.
  • Because the paper mentions an alternative crystal-only route, the theorem could be verified independently without relying on the imported bush-basis invariance; a contradiction between the two routes would pinpoint the unsupported step.
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

2 major / 5 minor

Summary. The paper proves Conjecture 1.1 for staircase posets P=δ_n and height m=2. Concretely, Theorem 1.3 establishes cyclic sieving for the pair (PP_2(δ_n), promotion, Ω_{δ_n}(2;q)) where Ω_{δ_n}(2;q)=∏_{1≤i≤j≤n}(1−q^{i+j+4})/(1−q^{i+j}). The proof combines two algebraic incarnations of promotion: first, promotion on staircase plane partitions is identified via crystals with promotion on 2-fans of Dyck paths (Pappe–Pfannerer–Schilling–Simone), then via the B_2/C_2 exceptional isomorphism with rotation of 3-noncrossing perfect matchings (Sundaram's map, Pfannerer–Rubey–Westbury). On the algebraic side, the paper uses the grove algebra G_{2,n} and its bush basis indexed by 3-noncrossing perfect matchings (Gao–Lam–Xu). A character computation for Sp(2n−2) then gives the desired trace and sieving polynomial. The paper also states a conditional generalization: an electrical canonical basis in all degrees would imply Conjecture 1.1 for all heights of staircase plane partitions.

Significance. If the proof is completed, this is a genuinely new instance of the cyclic sieving conjecture: it goes beyond the previously known rectangle and trapezoid cases and proves the conjecture for the staircase, a non-minuscule and (for κ=2) half-integer-root case. The paper's strategy is attractive: it ties rowmotion/promotion to electrical networks and the grove algebra, and the modular structure — promotion via crystals, rotation via B_2/C_2 duality, and sieving via symplectic character specialization — is well chosen. The paper is also honest in Remark 1.4 about an independent route through Westbury, Rubey–Westbury, and Krattenthaler, which is a strength: it shows the main theorem is not contingent on the electrical-network gap described below. The citations to [20] and [21] are to published, peer-reviewed work; the use of the authors' own prior paper [14] is contextual and not circular.

major comments (2)
  1. [§4.5, Lemma 4.7 / Theorem 4.6] The proof of Lemma 4.7 is load-bearing and is not supplied. The lemma asserts that the cyclic action c on G_{2,n} permutes the bush basis {B_ξ} by rotation of the indexing 3-noncrossing perfect matchings. The only evidence is Theorem 4.6, which expresses L_σ L_σ' = Σ a_{σ,σ',ξ} B_ξ, followed by the sentence: 'For our purposes, we do not need the precise definition of a valid opposite loopless resolution except to note that simultaneously rotating ξ and applying Kreweras complement to σ and to σ' preserves their number.' No proof or exact citation for this invariance is given. This is exactly the step that guarantees the trace of c^k computed in Lemma 4.5 counts fixed points of promotion on PP_2(δ_n). If the invariance fails, the bush basis is not a permutation basis for c, and #Fix(Pr^k)=tr(c^k|G_{2,n}) is not established. The gap is local and may be fillable — e.g. by quoting the releva
  2. [§4.5, Lemma 4.5] The trace computation needs one more check for the reader. The matrix c is defined on C^{2n}, and the paper states its characteristic polynomial is λ^{2n−1}/(λ^2−1) and lists eigenvalues ζ^{±1},…,ζ^{±(n−1)}. The dimensions and the possible missing eigenvalue (1 or −1) should be made explicit, since the action on the Lagrangian Grassmannian LG(n−1,V) is only on a 2n−2-dimensional subspace. This does not undermine the intended specialization argument, but it is a point where a reader cannot currently verify the computation without reconstructing the matrix and the invariant subspace.
minor comments (5)
  1. [§4.5, Lemma 4.5] The notation q^{-m(n2)} should be q^{-m\binom{n}{2}}; as typeset it is easy to misread. Please also spell out which symplectic group acts on which space, and whether c is taken on C^{2n} or on V.
  2. [§3.1, Lemma 3.1] Remark 3.2 notes the tensor-factor convention, but it would be helpful to state explicitly which direction is used in the identification of fans with (B_r^{spin})^{⊗2n}. A reader comparing with [20] must know whether the reordering changes promotion by an inverse.
  3. [Figure 2] The proof-outline diagram is extremely dense; the font sizes for the labels are too small in the printed version. Please enlarge or split into multiple figures, since it is otherwise a useful map of the proof.
  4. [§4.5, Theorem 4.6] Even if the precise definition is not needed, the phrase 'valid opposite loopless resolution' should be accompanied by a reference to the exact definition in [11], including a theorem or section number, so that the invariance claim can be located by a reader.
  5. [Remark 4.8] The assertion that the order of Row on PP_2(δ_n) is 2(n+1) is said to 'follow from the above'. It would be helpful to include a one-sentence justification, since cyclic sieving alone does not by itself force the order of the action if the generator has smaller order on the set.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the theorem is assembled from independent published inputs; the only weak point (Lemma 4.7's unproved rotation invariance) is a proof gap, not a circular reduction.

full rationale

The derivation of Theorem 1.3 is not circular. The promotion action on height-2 staircase plane partitions is connected to rotation of 3-noncrossing perfect matchings through a chain of independent, published results: Lemma 2.2 is proved in the paper; Lemma 3.1 is imported from Pappe–Pfannerer–Schilling–Simone [20]; Lemma 3.6 is imported from Pfannerer–Rubey–Westbury [21]; and the B2/C2 crystal isomorphism is a standard exceptional isomorphism. Although [20] and [21] are coauthored by Pfannerer, they are published, peer-reviewed, and their content is independent of the present argument; Remark 1.4 even sketches an entirely disjoint route to the theorem via Westbury, Rubey–Westbury, and Krattenthaler. The trace computation in Lemma 4.5 uses Proctor's symplectic character specialization, an external character-theoretic result, and no parameter is fitted to the target data. The only load-bearing concern is Lemma 4.7: the paper asserts, without proof, that simultaneously rotating ξ and applying Kreweras complement to σ and σ′ preserves the coefficients a_{σ,σ′,ξ}, and from this concludes that the cyclic action c permutes the bush basis by rotation. This is an unproved combinatorial symmetry claim and a genuine proof gap, but it is not circular: it is not assumed in the definition of c or of the bush basis, and it is not equivalent to the desired cyclic sieving statement. It is a checkable external fact about 'valid opposite loopless resolutions' that the paper declines to define. Thus the manuscript contains no self-definitional, fitted-prediction, or self-citation-forced reduction; the circularity score is 0.

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

No free parameters or invented entities are introduced. The proof rests on published external results—crystal promotion, the B2/C2 isomorphism, Sundaram's map, the bush-basis expansion, and Proctor's specialization—listed as axioms because the paper assumes rather than derives them. The only conjectural object, the electrical canonical basis, appears only in the conditional future-direction statement, not in the proof of Theorem 1.3.

assumptions (8)
  • standard math Crystal commutor σ_{B,B^{⊗(n−1)}} defines promotion on highest-weight weight-zero elements of tensor-product crystals (Henriques--Kamnitzer [12]).
    Used in (3.1) to define crystal promotion; also assumed natural under crystal isomorphisms in Theorem 3.7.
  • domain assumption Highest-weight weight-zero elements of (B_r^spin)^{⊗2n} are naturally identified with r-fans of Dyck paths, and crystal promotion equals fan promotion.
    Lemma 3.1, cited from Pappe--Pfannerer--Schilling--Simone [20]; central to transferring the problem into the crystal setting.
  • standard math Type B_2 spin crystal is isomorphic to type C_2 vector crystal via ψ, exchanging f_1 and f_2.
    Used in Section 3.3 and Figure 8 for the equivariant bijection in Theorem 3.7.
  • domain assumption Sundaram's growth-diagram map is a bijection from highest-weight weight-zero elements of (C_r^vec)^{⊗2n} to (r+1)-noncrossing perfect matchings, intertwining promotion and rotation.
    Lemma 3.6, cited from Pfannerer--Rubey--Westbury [21]; provides the rotation action on matchings.
  • domain assumption The electroid variety X_n is isomorphic to the Lagrangian Grassmannian LG(n−1,V) and carries the cyclic action c (Bychkov--Gorbounov--Kazakov--Talalaev [4, Thm 4.2]).
    Foundation of Section 4; connects electrical networks to symplectic representation theory.
  • domain assumption Degree-two grove monomials expand into the bush basis {B_ξ} indexed by 3-noncrossing perfect matchings, with coefficients invariant under simultaneous rotation of ξ and Kreweras complement of σ,σ′ (Gao--Lam--Xu [11, Thm 4.4]).
    Load-bearing for Lemma 4.7; the paper states the needed invariance without re-proving it.
  • domain assumption Proctor's symplectic character specialization: Sp_{2n−2}(mω_{n−1}; q,q^2,...,q^{n−1}) = q^{−m binom(n,2)} ∏_{1≤i≤j≤n−1} (1−q^{i+j+2m})/(1−q^{i+j}).
    Used at the end of Lemma 4.5 to identify tr(c^k) with Ω_{δ_{n−1}}(m; ζ^k).
  • domain assumption The lift of scalar multiplication by i to the degree-m piece G_{m,n} has trace i^{−m(n−1)}.
    Appears in the proof of Lemma 4.5 without derivation; it is a standard consequence of the Sp action but is not justified in the text.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Cyclic Sieving for Staircase Plane Partitions via Crystals and Electrical Networks." pith.science (2026). https://pith.science/paper/2ZRLE5ZP

@misc{pith2026260714028,
  author       = {Pith},
  title        = {Pith review of: Cyclic Sieving for Staircase Plane Partitions via Crystals and Electrical Networks},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/2ZRLE5ZP}},
  note         = {Machine review of arXiv:2607.14028}
}
read the original abstract

We prove a cyclic sieving result for the action of promotion on the staircase plane partitions of height two. Our proof has two major algebraic inputs: an interpretation of this promotion action in terms of tensor powers of the spin crystal that was recently studied by Pappe--Pfannerer--Schilling--Simone, and the bush basis of the degree two part of the coordinate ring of the space of electrical networks that was recently introduced by Gao--Lam--Xu. Moreover, we explain how the existence of an electrical canonical basis in all degrees would yield cyclic sieving for promotion of staircase plane partitions of all heights.

Figures

Figures reproduced from arXiv: 2607.14028 by the authors.

Figure 1
Figure 1. Examples of the families of posets to which Conjec￾ture 1.1 applies. For background on the cyclic sieving phenomenon (CSP), consult [25, 30]. Note in particular that when we have a CSP where the sieving polynomial has a product formula as a rational function, every symmetry class under the action is enumerated by a product formula. So Conjecture 1.1 says that rowmotion of P-partitions for these special families of p… view at source ↗
Figure 2
Figure 2. Outline of the proof of Theorem 1.3 [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. The toggle composites Fk and Rk on a staircase of size 5. Cells with the same label are toggled together in one composite; within each composite no two toggled cells are horizontal or vertical neighbors, so the corresponding local toggles commute. 2.2. Fans of Dyck paths. We now describe a different way of viewing promotion of staircase plane partitions. A Dyck path of semilength n (and length 2n) is a lattice walk … view at source ↗
Figures from the paper (5 more)
Figure 4
Figure 4. Figure 4: An example of the bijection Φ between staircase plane partitions and fans of Dyck paths. We also depict how promotion behaves on these objects. an m-fan of Dyck paths of semilength n. Then for each i = 1, . . . , 2n − 1, we define BKi(F) := (∅ = µ 0 , . . . , µi−1 , λi…
Figure 5
Figure 5. Figure 5: The local effect of BKi on one path. Solid blue shows the local shape before applying BKi , and dashed orange shows the local shape after applying it. In a fan, the resulting segments are sorted by height. We write F = (∅ = µ 0 , µ1 , . . . , µ2n = ∅) on the corners on…
Figure 6
Figure 6. Figure 6: The local path segments in the case N = x + a + d, W = x + a, S = x − b, and E = x − b − c. Orange denotes the peak segments, blue denotes the valley segments, and dashed gray denotes the straight segments fixed by the toggle. The multiplicities a and b are exchanged, …
Figure 7
Figure 7. Figure 7: The spin crystal B spin 3 for type B3. 3.1. Spin invariants and fans of Dyck paths. For type Br, the spin crystal B spin r consists of r-tuples (±, . . . , ±) with crystal operators acting by flipping adjacent signs. See for example [PITH_FULL_IMAGE:figures/full_fig_p…
Figure 8
Figure 8. Figure 8: The exceptional isomorphism between the type B2 spin crystal and the type C2 vector crystal. The dotted lines give the ver￾tex map ψ; red and blue arrows show that f2 in type B2 corresponds to f1 in type C2, and f1 in type B2 corresponds to f2 in type C2. Theorem 3.7. …

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

37 extracted references · 3 linked inside Pith

  1. [20]

    Pappe, S

    J. Pappe, S. Pfannerer, A. Schilling, and M. C. Simone. Promotion and growth diagrams for fans of Dyck paths and vacillating tableaux.J. Algebra, 655:794–842, 2024. CYCLIC SIEVING FOR STAIRCASE PLANE PARTITIONS 23

    2024

  2. [21]

    Pfannerer, M

    S. Pfannerer, M. Rubey, and B. Westbury. Promotion on oscillating and alternating tableaux and rotation of matchings and permutations.Algebr. Comb., 3(1):107–141, 2020

    2020

  3. [14]

    S. Hopkins. Order polynomial product formulas and poset dynamics. InOpen problems in algebraic combinatorics, volume 110 ofProc. Sympos. Pure Math., pages 135–157. Amer. Math. Soc., Providence, RI, 2024

    2024

  4. [1]

    Armstrong, C

    D. Armstrong, C. Stump, and H. Thomas. A uniform bijection between nonnesting and non- crossing partitions.Trans. Amer. Math. Soc., 365(8):4121–4151, 2013

    2013

  5. [2]

    Bodish, B

    E. Bodish, B. Elias, and D. E. V. Rose. Spin link homology.arXiv:2407.00189, 2024

    arXiv 2024

  6. [3]

    Bump and A

    D. Bump and A. Schilling.Crystal bases. World Scientific Publishing Co. Pte. Ltd., Hackensack, NJ, 2017. Representations and combinatorics

    2017

  7. [4]

    Bychkov, V

    B. Bychkov, V. Gorbounov, A. Kazakov, and D. Talalaev. Electrical networks, Lagrangian Grassmannians, and symplectic groups.Mosc. Math. J., 23(2):133–167, 2023

    2023

  8. [5]

    Ceballos, J.-P

    C. Ceballos, J.-P. Labb´ e, and C. Stump. Subword complexes, cluster complexes, and general- ized multi-associahedra.J. Algebraic Combin., 39(1):17–51, 2014

    2014

Show all 37 references
  1. [6]

    W. Y. C. Chen, E. Y. P. Deng, R. R. X. Du, R. P. Stanley, and C. H. Yan. Crossings and nestings of matchings and partitions.Trans. Amer. Math. Soc., 359(4):1555–1575, 2007

    2007

  2. [7]

    Chepuri, T

    S. Chepuri, T. George, and D. E. Speyer. Electrical networks and Lagrangian Grassmannians. Ann. Inst. Henri Poincar´ e D, 13(1):191–216, 2026

    2026

  3. [8]

    Einstein and J

    D. Einstein and J. Propp. Piecewise-linear and birational toggling. In26th International Con- ference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014), volume AT of Discrete Math. Theor. Comput. Sci. Proc., pages 513–524. Assoc. Discrete Math. Theor. Com- put. S...

    2014

  4. [9]

    Einstein and J

    D. Einstein and J. Propp. Combinatorial, piecewise-linear, and birational homomesy for prod- ucts of two chains.Algebr. Comb., 4(2):201–224, 2021

    2021

  5. [10]

    Galashin and P

    P. Galashin and P. Pylyavskyy. Ising model and the positive orthogonal Grassmannian.Duke Math. J., 169(10):1877–1942, 2020

    1942

  6. [11]

    Y. Gao, T. Lam, and Z. Xu. Electrical networks and the grove algebra.Canad. J. Math., 77(2):631–664, 2025

    2025

  7. [12]

    Henriques and J

    A. Henriques and J. Kamnitzer. Crystals and coboundary categories.Duke Math. J., 132(2):191–216, 2006

    2006

  8. [13]

    S. Hopkins. Cyclic sieving for plane partitions and symmetry.SIGMA Symmetry Integrability Geom. Methods Appl., 16:Paper No. 130, 40, 2020

    2020

  9. [15]

    Johnson and R

    J. Johnson and R. I. Liu. Plane partitions and rowmotion on rectangular and trapezoidal posets.arXiv:2311.07133, 2023

    2023 arXiv

  10. [16]

    S. N. Karp. Moment curves and cyclic symmetry for positive Grassmannians.Bull. Lond. Math. Soc., 51(5):900–916, 2019

    2019

  11. [17]

    Krattenthaler

    C. Krattenthaler. The major counting of nonintersecting lattice paths and generating functions for tableaux.Mem. Amer. Math. Soc., 115(552):vi+109, 1995

    1995

  12. [18]

    T. Lam. Electroid varieties and a compactification of the space of electrical networks.Adv. Math., 338:549–600, 2018

    2018

  13. [19]

    T. Lam. Cyclic Demazure modules and positroid varieties.Electron. J. Combin., 26(2):Paper No. 2.28, 20, 2019

    2019

  14. [22]

    Postnikov

    A. Postnikov. Total positivity, grassmannians, and networks.arXiv:math/0609764, 2006

    2006 arXiv

  15. [23]

    R. A. Proctor. Odd symplectic groups.Invent. Math., 92(2):307–332, 1988

    1988

  16. [24]

    R. A. Proctor. New symmetric plane partition identities from invariant theory work of De Concini and Procesi.European J. Combin., 11(3):289–300, 1990

    1990

  17. [25]

    Reiner, D

    V. Reiner, D. Stanton, and D. White. The cyclic sieving phenomenon.J. Combin. Theory Ser. A, 108(1):17–50, 2004

    2004

  18. [26]

    B. Rhoades. Cyclic sieving, promotion, and representation theory.J. Combin. Theory Ser. A, 117(1):38–76, 2010

    2010

  19. [27]

    Roby.Applications and Extensions of Fomin ’s Generalization of the Robinson–Schensted Correspondence to Differential Posets

    T. Roby.Applications and Extensions of Fomin ’s Generalization of the Robinson–Schensted Correspondence to Differential Posets. PhD thesis, Massachusetts Institute of Technology, 1991

    1991

  20. [28]

    Rubey and B

    M. Rubey and B. W. Westbury. Combinatorics of symplectic invariant tensors. InProceedings of FPSAC 2015, Discrete Math. Theor. Comput. Sci. Proc., pages 285–296. Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2015

    2015

  21. [29]

    D. B. Rush and X. Shi. On orbits of order ideals of minuscule posets.J. Algebraic Combin., 37(3):545–569, 2013

    2013

  22. [30]

    B. E. Sagan. The cyclic sieving phenomenon: a survey. InSurveys in combinatorics 2011, volume 392 ofLondon Math. Soc. Lecture Note Ser., pages 183–233. Cambridge Univ. Press, Cambridge, 2011

    2011

  23. [31]

    Serrano and C

    L. Serrano and C. Stump. Maximal fillings of moon polyominoes, simplicial complexes, and Schubert polynomials.Electron. J. Combin., 19(1):Paper 16, 18, 2012

    2012

  24. [32]

    C. S. Seshadri.Introduction to the theory of standard monomials, volume 46 ofTexts and Readings in Mathematics. Hindustan Book Agency, New Delhi, second edition, 2014

    2014

  25. [33]

    R. P. Stanley.Enumerative combinatorics. Volume 1, volume 49 ofCambridge Studies in Ad- vanced Mathematics. Cambridge University Press, Cambridge, second edition, 2012

    2012

  26. [34]

    Striker and N

    J. Striker and N. Williams. Promotion and rowmotion.European J. Combin., 33(8):1919–1942, 2012

    1919

  27. [35]

    Sundaram.On the combinatorics of representations of the symplectic group

    S. Sundaram.On the combinatorics of representations of the symplectic group. PhD thesis, Massachusetts Institute of Technology, 1986

    1986

  28. [36]

    Westbury

    B. Westbury. Does a symplectic group act on a tensor power of a spin representation? Math- Overflow question, 2011.https://mathoverflow.net/q/57244

    2011

  29. [37]

    B. W. Westbury. Invariant tensors and the cyclic sieving phenomenon.Electron. J. Combin., 23(4):Paper 4.25, 40, 2016. Email address:samuelfhopkins@gmail.com Department of Mathematics, Howard University, W ashington, DC, USA Email address:jesse.kim@ufl.edu Department of Mathema...

    2016

Pith tools

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