Pith. sign in

REVIEW 2 major objections 6 minor 3 cited by

Ordered set partition posets

T0 review · 2 major / 6 minor · reviewed 2026-08-06 · deepseek-v4-flash

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

Pith's one-line read Ordered partition posets are shellable; homology is explicit

desk verdict Solid first systematic study of ordered set partition posets; the main results hold up, with a few omitted details in Section 6 and some garbled displays. read the letter →

arxiv 2506.23355 v3 pith:DHOUI3SI submitted 2025-06-29 math.CO math.ATmath.GNmath.RT

Bruce E Sagan (Michigan State University) , Sheila Sundaram (University of Minnesota) This is my paper · ORCID
classification math.COmath.ATmath.GNmath.RT MSC 05A1806A0706A1120C3057Q05
keywords orderedsetpartitionslatticeshellabilityCohen-MacaulayWhitneyhomologyFrobeniuscharacteristicrankselectiontrivialrepresentation
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 establishes that the lattice of ordered set partitions of [n] whose block sizes are all divisible by a fixed d, with a bottom element adjoined, is CL-shellable and Cohen-Macaulay whenever d divides n. It then derives explicit formulas for the symmetric group action on the Whitney homology, the top homology, and the rank-selected and corank-selected homology of this lattice. In the divisible case, the multiplicity of the trivial representation in corank-selected homology is completely determined: it counts permutations of m-1 elements with a prescribed descent set, and vanishes exactly when the selected coranks include m-1. For the companion poset where every block size is congruent to 1 modulo d, the paper shows that interval Mobius values are, up to sign, generalized Catalan numbers. A sympathetic reader would care because these are the first systematic results treating ordered set partition posets as objects in their own right, converting structural questions into closed combinatorial answers.

What carries the argument

The load-bearing object is the upper-interval isomorphism [omega, hat 1] approximately B_{k-1} of Lemma 2.1(d), which is order-reversing and depends only on the number k of blocks of omega. This isomorphism drives the recursive atom ordering used in Theorem 2.7, the Whitney homology computation through induced modules from Young subgroups in Theorem 3.3, the rank-selection recurrence in Theorem 4.4, and the quotient-complex description in Proposition 5.4 that identifies trivial multiplicities with Boolean-lattice flag h-vectors. In the 1 mod d case, the analogous machinery is the interval isomorphism [psi, omega] approximately B^(d)_{rk(psi,omega)}, where B^(d)_n consists of subsets whose runs have length divisible by d, together with a sign-reversing involution on Motzkin paths that proves the k-Catalan Mobius formula.

What would settle it

Take any ordered set partition omega with three blocks and list all ordered partitions obtained by merging adjacent blocks; Lemma 2.1(d) predicts this interval is a diamond with exactly four elements (omega, two merges, and the top). If any such interval contains an additional element or fails to have the two expected covers, the central interval isomorphism and its consequences collapse.

Watch

Extended reading notes

Core claim

The central discovery is that the poset Omega_n^(d) admits a recursive atom ordering (Theorem 2.7), making it CL-shellable and therefore Cohen-Macaulay, with all homology concentrated in the top dimension. The shellability proof rests on a single interval fact: for every ordered partition omega with k blocks, the upper interval [omega, hat 1] is isomorphic to the Boolean lattice B_{k-1}. From this, the paper obtains explicit Frobenius characteristics for the Whitney homology of Omega_{dm}^(d) as sums of complete homogeneous symmetric functions h_{d $\alpha$}, a recurrence for the corank-selected homology, and a complete determination of the multiplicity of the trivial representation in that homology: b_m(T) counts permutations in S_{m-1} with descent set T and vanishes exactly when m-1 lies in T, while the restricted multiplicity b'_m(T) vanishes exactly when T contains both m-2 and m-1.

Load-bearing premise

The entire argument rests on the isomorphism between any upper interval [omega, hat 1] and a Boolean lattice of size one less than the number of blocks of omega; if that interval structure failed for some block-size restriction, the shellability, homology, and multiplicity formulas would all need reworking.

Editorial extensions

If this is right

  • The top homology of Omega_{dm}^(d) has dimension equal, up to sign, to the d-divisible Euler number E^(d)_{dm}.
  • The Frobenius characteristic of the top homology is the single Schur function indexed by a rim hook with m rows of length d.
  • Corank-selected homology satisfies a two-term recurrence whose solution is explicit in complete homogeneous symmetric functions, and the trivial multiplicities b_m(T) refine (m-1)! by descent sets.
  • The restricted trivial multiplicities b'_m(T), for the subgroup fixing dm, refine m! and vanish exactly when the selected coranks contain both m-2 and m-1.
  • The generating function identity expresses the beta^(d)_{dm} in terms of complete homogeneous functions and shows that the beta^(d)_{dm} are algebraically independent generators of the ring they generate.

Reading between the lines

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

  • The quotient-complex description in Proposition 5.4 suggests a purely bijective proof of Theorem 5.1 could be extracted by composing the orbit map with the Boolean-lattice chain bijection, avoiding the representation-theoretic detour.
  • The explicit recursive atom ordering could be refined into a full EL-labeling, which the paper leaves open in Question 2.8; such a labeling would yield a direct combinatorial basis of the top homology.
  • The k-Catalan Mobius result for the 1 mod d posets might extend to intervals containing the bottom element through the reduced-product formula, giving a generating function for the full Mobius function in terms of the newly defined remainder-1 Euler numbers.
  • The same upper-interval machinery could be probed for other block-size congruence classes, though the paper notes those posets are not graded; a filtered or relative shellability notion might still apply there.
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 / 6 minor

Summary. The paper studies the posets Ω_n^{(d)} of ordered set partitions of [n] in which every block size is divisible by d, and the posets Ω̆_n^{(d)} in which every block size is congruent to 1 modulo d. For Ω_n^{(d)} it proves a recursive atom ordering (Theorem 2.7), computes the Frobenius characteristics of the Whitney homology and top homology (Theorems 3.3–3.5), gives a recurrence for the rank-selected and corank-selected homology (Theorem 4.4), and completely determines the multiplicity of the trivial representation in corank-selected homology (Theorems 5.1 and 5.3). For the 1-mod-d posets it states structural properties (Theorem 6.1) and proves that the Möbius function of intervals is, up to sign, a generalized Catalan number (Theorems 6.3 and 6.4). The paper also derives several enumerative invariants and proposes open problems.

Significance. The results of Sections 2–5 form a substantial and useful contribution: they provide the first systematic treatment of ordered set partition posets, with explicit, parameter-free formulas for symmetric group actions on homology and complete descriptions of the trivial multiplicities. The proofs are mostly elementary and the small-case data in Table 1 are consistent with the theorems. The recursive atom ordering and the Whitney-homology computations extend known technology in a natural way and will likely be of interest to researchers working on refinement posets, shellability, and symmetric function representations. The Section 6 Catalan-type Möbius theorem is attractive, but its current proof relies on an interval statement that is false as written; the claim itself appears salvageable and the referee verified small cases after correcting the interval model.

major comments (2)
  1. [Section 6, Theorem 6.1(e)] The stated isomorphism [ψ,ω] ≅ B^{(d)}_{rk(ψ,ω)} is false as written. For example, take d=2, n=5, ψ=(1,2,3,4,5) and ω=(12345). Then rk(ψ,ω)=2, but the interval in Ω̆^{(2)}_5 has five elements: ψ, ω, and the three intermediate ordered partitions (1,2,345), (1,234,5), (123,4,5). On the other hand, B^{(2)}_2 = {∅, {1,2}} has only two elements. The correct model for an interval of rank r in Ω̆^{(d)} is the poset of compositions of dr+1 into parts congruent to 1 modulo d, ordered by refinement, not the poset B^{(d)}_r defined in the paper. Since the proof of Theorems 6.3 and 6.4 reduces arbitrary intervals to intervals of the form [ψ,\hat1] via this theorem, the proof needs to be reworked with the corrected interval model. The referee verified that the claimed Catalan Möbius value survives this correction for r=1,2,3, but the structural statement and its proof must be fixed.
  2. [Section 6, Theorem 6.4] The proof of Theorem 6.4 is presented as a sketch: the d-analogue of Lemma 6.2 is asserted but not stated or proved, and the sign-reversing involution for k-Motzkin paths is described only for d=2, with the general case left to the reader. In light of the incorrect interval reduction in Theorem 6.1(e), this is not merely an exposition issue. Please provide a complete proof for arbitrary intervals, including a precise statement and proof of the d-analogue of Lemma 6.2, a verification that the switching involution is fixed-point-free and sign-reversing for k-Motzkin paths, and a justification that every nontrivial k-Motzkin path has either a k-diagonal step or a k-corner.
minor comments (6)
  1. [Section 3, Theorem 3.4] Theorem 3.4 states 'For n ≥ 0' but the formulas use m throughout, such as C(m,k+1) and WH*_m, and part (b) refers to Ω^{(d)}_{dm}. These should be n and Ω_n, respectively.
  2. [Section 2, Equation (7)] The definition A^{(d)}_{dm} = {π ∈ S_dm | Des π = {d, 2d, ..., (m-1)d} is missing a closing brace; it should read Des π = {d, 2d, ..., (m-1)d} }.
  3. [Section 4, Theorem 4.4] In the statement of Theorem 4.4, 'Ω(dmd)' should be 'Ω^{(d)}_{dm}'.
  4. [Section 4, Corollary 4.3] The formula for β^{(d)}_{dm}(T) contains a typographical error: 'η_i(B^{(d))}_{dm})' should be 'η_i(B^{(d)}_{dm})'.
  5. [Section 3, introductory paragraph] The sentence 'The action of the symmetric group Ω_n is most conveniently described' should read 'The action of the symmetric group S_n on Ω_n'.
  6. [Section 6, Theorem 6.1] Parts (a)–(e) of Theorem 6.1 are stated without proof. Since part (e) is currently false as stated, please replace the omitted proof by a correct argument for the corrected interval model, and include at least a sketch for parts (d) and (e) because they are used later.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: the main derivations are self-contained given standard interval and rank-selection facts, with self-citations providing independent technical lemmas rather than baking in the target formulas.

full rationale

I walked the derivation chain and found no step where a claimed prediction or first-principles result reduces, by construction or by definition, to the paper's own inputs. The load-bearing interval fact, Lemma 2.1(d), is proved directly by an explicit bijection between [ω, hat 1] and the Boolean lattice B_{k-1}, and it, not any fitted parameter, drives the Whitney homology formula in Theorem 3.3, the corank-selection recurrence in Theorem 4.4, and the quotient-complex analysis in Proposition 5.4. The recursive atom ordering in Theorem 2.7 is constructed explicitly with a lexicographic order and verified against condition (R2), using only the standard criterion in Lemma 2.6. The cited results from the authors' earlier work—Theorem 2.2 from [Sag25], Proposition 3.1 and Proposition 3.2 from [Sun94a, Sun94b]—are external, parameter-free statements with clear hypotheses, and the paper's new claims do not assume their own conclusions; rather, they apply those lemmas to new posets. The trivial-multiplicity theorems 5.1 and 5.3 follow from Stanley's rank-selection theorem and ribbon multiplicity computations, not from the theorem statements being inserted as assumptions. There are no fitted constants, no definitions that secretly contain the target formulas, and no uniqueness claims imported solely from the authors' prior work. Minor typographical issues, such as the garbled display in Theorem 3.4 and the m=4 data notation, do not affect the logical structure. I therefore find no circularity requiring a step-by-step flag; the paper is a normal application of established technology to a new family of posets.

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

No free parameters or invented entities. The central results rest on standard poset-topology theorems and on several cited results, including the companion preprint [Sag25] and Sundaram's earlier work; all are parameter-free and externally checkable.

assumptions (4)
  • standard math Cohen-Macaulay posets have homology only in the top dimension, and the alternating-sum relations (11)-(12) between top homology and Whitney homology hold.
    Used throughout Section 3; imported from Baclawski and Sundaram [Sun94a, Sun94b].
  • domain assumption The Möbius value of Omega_n^(d) equals the d-divisible Euler number E_n^(d), and E_n^(d) is the signed sum of ordered d-divisible partitions.
    Theorem 2.4(b) and Theorem 2.2 are cited from [EJ13] and from the companion preprint [Sag25] by the first author; the paper does not reprove this identity, and it supports the dimension formula (18).
  • domain assumption For the reduced product of posets, Möbius values multiply with a sign, and the homology of reduced products decomposes as a tensor product under group actions.
    Cited from Sundaram [Sun94a, Proposition 2.5, 2.6, Remark 2.6.1]; used in Theorem 2.4(c) and in the lower-interval arguments of Section 3.
  • standard math Stanley's rank-selection theorem for the Boolean lattice and for barycentric subdivisions describes rank-selected homology by rim-hook Specht modules and by the coefficients c_{i,r}(T).
    Used in Section 4 to compute corank-selected homology and in Section 5 to derive the multiplicity formulas.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Ordered set partition posets." pith.science (2026). https://pith.science/paper/DHOUI3SI

@misc{pith2026250623355,
  author       = {Pith},
  title        = {Pith review of: Ordered set partition posets},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DHOUI3SI}},
  note         = {Machine review of arXiv:2506.23355}
}
abstract

A set partition is said to be ordered if the blocks of the partition are listed in a specific order. The ordered set partitions of $\{1,\ldots,n\}$, with a unique minimal element adjoined, form a lattice $\Om_n$ with respect to refinement. The lattice $\Om_n$ is well known to be the face lattice of the permutohedron. In this paper we study the combinatorics and topology of two subposets of $\Om_n$ with restricted block sizes, either all divisible by some fixed $d\ge2$, or all congruent to $1$ modulo $d$. For the $d$-divisible case we derive an explicit recursive atom ordering for the lattice, as well as formulas for the action of the symmetric group on the Whitney homology and the rank-selected homology, and also for the multiplicity of the trivial representation. In the 1 mod $d$ case we show that the poset has a curious interval structure related to the $k$-Catalan numbers. Our investigations lead to enumerative invariants in both cases. Open problems and avenues for future research are scattered throughout.

Figures

Figures reproduced from arXiv: 2506.23355 by the authors.

Figure 1
Figure 1. The poset Ω3 where when n = 0 the second set is considered to be empty. We will shorten Ω(1) n to just Ωn. And if we write ω ∈ Ω (d) n then we are tacitly assuming that ω is an ordered set partition in Ω (d) n , i.e., ω ̸= ˆ0. If we write x ∈ Ω (d) n then x could be any element of the poset, including ˆ0 and similarly for other letters near the end of the Latin alphabet. See [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. The quotient complex ∆(Ω3)/S3 that x ′ < y′ in P. The quotient complex ∆(P)/G does not usually coincide with the order complex ∆(P/G) of the orbit poset P/G. In general the quotient complex may not even be a simplicial complex; an example is the ordinary partition lattice Πn with the Sn-action [HH03, p. 522]. But when P = Ωdm the quotient complex is not only a simplicial complex, but also equals the order complex of… view at source ↗
Figure 3
Figure 3. The restriction of a Motzkin path (m1) M starts at (0, 0) and ends at (n, n) for some n, using steps N, E, and D, and (m2) M never goes below the line y = x. We will often specify a Motzkin path by listing its sequence of steps. In such a sequence, a consecutive pair of steps of the form NE will be called a corner. To illustrate, the Motzkin path M of [PITH_FULL_IMAGE:figures/full_fig_p033_3.png] view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: The involution ι of Theorem 6.3 when m = 2 where the values µ(ω, ˆ1) for ω > ψ are already known by induction. Since the solution is unique, it suffices to prove that X ω∈[ψ,ˆ1] (−1)crk ω Ccrk ω = 0. (40) But using Lemma 6.2 we obtain X ω∈[ψ,ˆ1] (−1)crk ω Ccrk ω = Xm k…

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Cycle-Decorated Ribbon Bar Complexes: Cut Factorization and Equivariant Homology

    math.CO 2026-08 conditional novelty 7.0 of 10

    A decoration by ordinary and rooted cycles on ordered set partitions yields a cut-factorization theorem that computes the full bigraded S_n-homology of the resulting ribbon bar complexes.

  2. An identity relating Catalan numbers to tangent numbers with arithmetic applications

    math.CO 2025-07 conditional novelty 7.0 of 10

    The paper proves the Aliniaeifard-Li conjecture, derives identity (1.3) and a q-analog (2.2), and uses them to give new proofs of the Genocchi divisibility theorem and Foata's q-tangent divisibility.

  3. Partitions with parity restrictions: a bijective approach

    math.CO 2026-07 accept novelty 6.0 of 10

    Many generating-function identities for parity-restricted partitions (and related overpartitions, mock theta coefficients, and tableaux) admit direct bijective proofs, some simpler than the original algebraic ones.

Reference graph

Works this paper leans on

42 extracted references · 39 canonical work pages · cited by 3 Pith papers

  1. [1]

    Whitney numbers of geometric lattices

    Kenneth Baclawski. Whitney numbers of geometric lattices. Advances in Math. , 16:125--138, 1975

    work page 1975

  2. [2]

    Cohen- M acaulay ordered sets

    Kenneth Baclawski. Cohen- M acaulay ordered sets. J. Algebra , 63(1):226--258, 1980

    work page 1980

  3. [3]

    Bruce C. Berndt. Ramanujan's notebooks. P art II . Springer-Verlag, New York, 1989

    work page 1989

  4. [4]

    On the homology of geometric lattices

    Anders Bj\"orner. On the homology of geometric lattices. Algebra Universalis , 14(1):107--128, 1982

    work page 1982

  5. [5]

    Billera and A

    Louis J. Billera and A. Sarangarajan. The combinatorics of permutation polytopes. In Formal power series and algebraic combinatorics ( N ew B runswick, NJ , 1994) , volume 24 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci. , pages 1--23. Amer. Math. Soc., Providence, RI, 1996

    work page 1994

  6. [6]

    On lexicographically shellable posets

    Anders Bj\"orner and Michelle Wachs. On lexicographically shellable posets. Trans. Amer. Math. Soc. , 277(1):323--341, 1983

    work page 1983

  7. [7]

    On abelian fields

    Leonard Carlitz. On abelian fields. Trans. Amer. Math. Soc. , 35(1):122--136, 1933

    work page 1933

  8. [8]

    A. R. Calderbank, P. Hanlon, and R. W. Robinson. Partitions into even and odd block size and some unusual characters of the symmetric groups. Proc. London Math. Soc. (3) , 53(2):288--320, 1986

    work page 1986

Show all 42 references
  1. [9]

    Invariant theory for the face algebra of the braid arrangement

    Patricia Commins. Invariant theory for the face algebra of the braid arrangement. Algebr. Comb. , 8(2):421--468, 2025

    2025

  2. [10]

    Filters in the partition lattice

    Richard Ehrenborg and Dustin Hedmark. Filters in the partition lattice. J. Algebraic Combin. , 47(3):403--439, 2018

    2018

  3. [11]

    The topology of restricted partition posets

    Richard Ehrenborg and JiYoon Jung. The topology of restricted partition posets. J. Algebraic Combin. , 37(4):643--666, 2013

    2013

  4. [12]

    Ira M. Gessel. Some congruences for generalized E uler numbers. Canad. J. Math. , 35(4):687--709, 1983

    1983

  5. [13]

    Binomial determinants, paths, and hook length formulae

    Ira Gessel and G\'erard Viennot. Binomial determinants, paths, and hook length formulae. Adv. in Math. , 58(3):300--321, 1985

    1985

  6. [14]

    A proof of a conjecture of S tanley concerning partitions of a set

    Phil Hanlon. A proof of a conjecture of S tanley concerning partitions of a set. European J. Combin. , 4(2):137--141, 1983

    1983

  7. [15]

    Multiplicity of the trivial representation in rank-selected homology of the partition lattice

    Phil Hanlon and Patricia Hersh. Multiplicity of the trivial representation in rank-selected homology of the partition lattice. J. Algebra , 266(2):521--538, 2003

    2003

  8. [16]

    Factoring the characteristic polynomial of a lattice

    Joshua Hallam and Bruce Sagan. Factoring the characteristic polynomial of a lattice. J. Combin. Theory Ser. A , 136:39--63, 2015

    2015

  9. [17]

    Euler- M ahonian statistics on ordered partitions and S teingr\'imsson's conjecture---a survey

    Masao Ishikawa, Anisse Kasraoui, and Jiang Zeng. Euler- M ahonian statistics on ordered partitions and S teingr\'imsson's conjecture---a survey. In Combinatorial representation theory and related topics , volume B8 of RIMS K\^oky\^uroku Bessatsu , pages 99--113. Res. Inst. Mat...

    2008

  10. [18]

    G. D. James. The representation theory of the symmetric groups , volume 682 of Lecture Notes in Mathematics . Springer, Berlin, 1978

    1978

  11. [19]

    The representation theory of the symmetric group , volume 16 of Encyclopedia of Mathematics and its Applications

    Gordon James and Adalbert Kerber. The representation theory of the symmetric group , volume 16 of Encyclopedia of Mathematics and its Applications . Addison-Wesley Publishing Co., Reading, MA, 1981. With a foreword by P. M. Cohn, With an introduction by Gilbert de B. Robinson

    1981

  12. [20]

    Congruence properties of L ehmer- E uler numbers, 2025

    Takao Komatsu and Guo-Dong Liu. Congruence properties of L ehmer- E uler numbers, 2025. Preprint arXiv:2501.01178

    2025 arXiv

  13. [21]

    private communication

    Jang Soo Kim and Dennis Stanton, 2025. private communication

    2025

  14. [22]

    D. J. Leeming and R. A. MacLeod. Some properties of generalized E uler numbers. Canadian J. Math. , 33(3):606--617, 1981

    1981

  15. [23]

    D. J. Leeming and R. A. MacLeod. Generalized E uler number sequences: asymptotic estimates and congruences. Canad. J. Math. , 35(3):526--546, 1983

    1983

  16. [24]

    I. G. Macdonald. Symmetric functions and H all polynomials . Oxford Mathematical Monographs. The Clarendon Press, Oxford University Press, New York, second edition, 1995. With contributions by A. Zelevinsky, Oxford Science Publications

    1995

  17. [25]

    T. V. Narayana. Lattice path combinatorics with statistical applications , volume No. 23 of Mathematical Expositions . University of Toronto Press, Toronto, ON, 1979

    1979

  18. [26]

    Bruce E. Sagan. Shellability of exponential structures. Order , 3(1):47--54, 1986

    1986

  19. [27]

    Bruce E. Sagan. The symmetric group , volume 203 of Graduate Texts in Mathematics . Springer-Verlag, New York, second edition, 2001. Representations, combinatorial algorithms, and symmetric functions

    2001

  20. [28]

    Bruce E. Sagan. Combinatorics: the art of counting , volume 210 of Graduate Studies in Mathematics . American Mathematical Society, Providence, RI, [2020] 2020

    2020

  21. [29]

    Bruce E. Sagan. Generalized E uler numbers and ordered set partitions. Preprint arXiv:2501.07692 , 2025

    2025 arXiv

  22. [30]

    Linear representations of finite groups , volume 42 of Graduate Texts in Mathematics

    Jean-Pierre Serre. Linear representations of finite groups , volume 42 of Graduate Texts in Mathematics . Springer-Verlag, New York-Heidelberg, french edition, 1977

    1977

  23. [31]

    A decomposition of the group algebra of a finite C oxeter group

    Louis Solomon. A decomposition of the group algebra of a finite C oxeter group. J. Algebra , 9:220--239, 1968

    1968

  24. [32]

    Sagan and Joshua P

    Bruce E. Sagan and Joshua P. Swanson. q - S tirling numbers in type B . European J. Combin. , 118:Paper No. 103899, 35, 2024

    2024

  25. [33]

    Richard P. Stanley. Exponential structures. Stud. Appl. Math. , 59(1):73--82, 1978

    1978

  26. [34]

    Richard P. Stanley. Some aspects of groups acting on finite posets. J. Combin. Theory Ser. A , 32(2):132--161, 1982

    1982

  27. [35]

    Richard P. Stanley. Enumerative combinatorics. V olume 2 , volume 62 of Cambridge Studies in Advanced Mathematics . Cambridge University Press, Cambridge, 1999. With a foreword by Gian-Carlo Rota and appendix 1 by Sergey Fomin

    1999

  28. [36]

    Richard P. Stanley. Enumerative combinatorics. V olume 1 , volume 49 of Cambridge Studies in Advanced Mathematics . Cambridge University Press, Cambridge, second edition, 2012

    2012

  29. [37]

    Richard P. Stanley. Catalan numbers . Cambridge University Press, New York, 2015

    2015

  30. [38]

    Applications of the H opf trace formula to computing homology representations

    Sheila Sundaram. Applications of the H opf trace formula to computing homology representations. In Jerusalem Combinatorics '93 , volume 178 of Contemp. Math. , pages 277--309. Amer. Math. Soc., Providence, RI, 1994

    1994

  31. [39]

    The homology representations of the symmetric group on C ohen- M acaulay subposets of the partition lattice

    Sheila Sundaram. The homology representations of the symmetric group on C ohen- M acaulay subposets of the partition lattice. Adv. Math. , 104(2):225--296, 1994

    1994

  32. [40]

    Some problems arising from partition poset homology

    Sheila Sundaram. Some problems arising from partition poset homology. In The mathematical legacy of R ichard P . S tanley , pages 335--352. Amer. Math. Soc., Providence, RI, 2016

    2016

  33. [41]

    Michelle L. Wachs. A basis for the homology of the d -divisible partition lattice. Adv. Math. , 117(2):294--318, 1996

    1996

  34. [42]

    Cubical convex ear decompositions

    Russ Woodroofe. Cubical convex ear decompositions. Electron. J. Combin. , 16(2):Research Paper 17, 33, 2009

    2009

Pith tools

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