Computer-generated symmetric chain decompositions for \(L(4,n)\) and \(L(3,n)\) (Q1883387): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Maple / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.aam.2003.11.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1986968573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partition of L(3,n) into saturated symmetric chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unimodality of Gaussian coefficients: A constructive proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: A symmetric chain decomposition of L(4,n) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kathy O'Hara's Constructive Proof of the Unimodality of the Gaussian Polynomials / rank
 
Normal rank

Latest revision as of 14:33, 7 June 2024

scientific article
Language Label Description Also known as
English
Computer-generated symmetric chain decompositions for \(L(4,n)\) and \(L(3,n)\)
scientific article

    Statements

    Computer-generated symmetric chain decompositions for \(L(4,n)\) and \(L(3,n)\) (English)
    0 references
    0 references
    12 October 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    symmetric chain decomposition
    0 references
    posets
    0 references
    Young's partition lattice
    0 references
    0 references