The jump number and the lattice of maximal antichains (Q807648): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3804752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4918389 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3890731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Jump Number of Dags and Posets: An Introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Setups for Ordered Sets: A Linear Algebraic Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Approaches to Setup Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval orders without odd crowns are defect optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Setup optimization problems with matroid structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: S-verklebte Summen von Verbänden / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Linear Extensions by Interchanging Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jump number problem: The role of matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3952147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3698849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3676181 / rank
 
Normal rank

Revision as of 18:03, 21 June 2024

scientific article
Language Label Description Also known as
English
The jump number and the lattice of maximal antichains
scientific article

    Statements

    The jump number and the lattice of maximal antichains (English)
    0 references
    0 references
    1991
    0 references
    The author explains the relation between the jump number s(P) and the length of the lattice of maximal antichains l(MA(P)) of an ordered set P: \[ | P| -l(MA(P))-1\leq s(P)\leq | P| -l(MA(P)). \] If P has height one or is N-free, then s(P) equals \(| P| -l(MA(P))\).
    0 references
    0 references
    jump number
    0 references
    length of the lattice of maximal antichains
    0 references