Photo from wikipedia
Kong and Ribemboim (1994) define for every poset P a sequence P = D0(P), D(P), D2(P), D3(P)… of posets, where Di(P) = D(Di− 1(P)) consists of all maximal antichains of Di− 1(P).… Click to show full abstract
Kong and Ribemboim (1994) define for every poset P a sequence P = D0(P), D(P), D2(P), D3(P)… of posets, where Di(P) = D(Di− 1(P)) consists of all maximal antichains of Di− 1(P). They prove that for a finite poset P, there exists an integer i ≥ 0 such that Di(P) is a chain. In this paper, for every finite poset P, we show how to calculate the smallest integer i for which Di(P) is a chain.
Keywords:
computation poset;
invariant computation;
poset
Journal Title: Order
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Order
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!