A structure theorem for posets admitting a ``strong'' chain partition: a generalization of a conjecture of Daykin and Daykin (with connections to probability correlation inequalities) (Q864160): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4692885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order Preserving Maps and Linear Extensions of a Finite Poset / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4363108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3344239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3952141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Monotonicity Properties of Partial Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperplane arrangements, interval orders, and trees. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of a finite three-complete poset / rank
 
Normal rank

Latest revision as of 14:07, 25 June 2024

scientific article
Language Label Description Also known as
English
A structure theorem for posets admitting a ``strong'' chain partition: a generalization of a conjecture of Daykin and Daykin (with connections to probability correlation inequalities)
scientific article

    Statements

    A structure theorem for posets admitting a ``strong'' chain partition: a generalization of a conjecture of Daykin and Daykin (with connections to probability correlation inequalities) (English)
    0 references
    13 February 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    partially ordered set
    0 references
    correlation inequality
    0 references
    linear extension
    0 references
    Dilworth's theorem
    0 references
    ordinal sum
    0 references
    partition
    0 references
    chain
    0 references
    0 references