We exhibit a recursive procedure that enables us to construct a maximal union of k chains in a finite partially ordered set P for every positive integer k. As a consequence, we obtain an algorithmic proof of Greene's Duality Theorem on the relations between the cardinalities of maximal unions of chains and antichains in a finite poset.
An algorithmic approach to maximal unions of chains in a partially ordered set / M. Barnabei; F. Bonetti; M. Silimbani. - In: PURE MATHEMATICS AND APPLICATIONS. - ISSN 1218-4586. - STAMPA. - 16:(2005), pp. 199-216.
An algorithmic approach to maximal unions of chains in a partially ordered set
BARNABEI, MARILENA;BONETTI, FLAVIO;SILIMBANI, MATTEO
2005
Abstract
We exhibit a recursive procedure that enables us to construct a maximal union of k chains in a finite partially ordered set P for every positive integer k. As a consequence, we obtain an algorithmic proof of Greene's Duality Theorem on the relations between the cardinalities of maximal unions of chains and antichains in a finite poset.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
