CHAINING PARTIALLY ORDERED SETS

Authors
KONG TY RIBENBOIM P
Citation
Ty. Kong et P. Ribenboim, CHAINING PARTIALLY ORDERED SETS, Comptes rendus de l'Academie des sciences. Serie 1, Mathematique, 319(6), 1994, pp. 533-537
Citations number
NO
Categorie Soggetti
Mathematics, General",Mathematics
Journal title
Comptes rendus de l'Academie des sciences. Serie 1, Mathematique → ACNP
ISSN journal
07644442
Volume
319
Issue
6
Year of publication
1994
Pages
533 - 537
Database
ISI
SICI code
0764-4442(1994)319:6<533:CPOS>2.0.ZU;2-W
Abstract
We present an iterative procedure which can be applied to any partiall y ordered set. If the chains of a partially ordered set all have lengt h bounded by k, then the procedure transforms the set into a chain aft er at most 2 k - 1 iterations. The number of iterations required to pr oduce a chain is an invariant which measures how far a partially order ed set is from being a chain.