On the poset of partitions of an integer (Q5903139): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3050437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5331549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shellable and Cohen-Macaulay Partially Ordered Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lexicographically Shellable Posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3952144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A homotopy complementation formula for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coalgebras and Bialgebras in Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3827224 / rank
 
Normal rank

Latest revision as of 14:34, 17 June 2024

scientific article; zbMATH DE number 3954980
Language Label Description Also known as
English
On the poset of partitions of an integer
scientific article; zbMATH DE number 3954980

    Statements

    On the poset of partitions of an integer (English)
    0 references
    0 references
    1986
    0 references
    The partially ordered sets \(P_ n\) of partitions of a positive integer n, ordered by refinement are studied. In particular, the author disproves the conjecture that the partially ordered sets are Cohen-Macaulay [for a definition see \textit{A. Björner, A. M. Garsia} and \textit{R. P. Stanley}: Ordered sets 1981, 583-615 (1982; Zbl 0491.06005) p.598] for all n, and shows even that the Möbius function on the intervals does not alternate in sign in general.
    0 references
    0 references
    0 references
    0 references
    0 references
    partially ordered sets
    0 references
    partitions
    0 references
    Cohen-Macaulay
    0 references
    Möbius function
    0 references
    0 references