Abstract
Fix a partial order P=(X, <). We first show that bipartite orders are sufficient to study structural properties of the lattice of maximal antichains. We show that all orders having the same lattice of maximal antichains can be reduced to one representative order (called the poset of irreducibles by Markowsky [14]). We then define the strong simplicial elimination scheme to characterize orders which have distributive lattice of maximal antichains. The notion of simplicial elimination corresponds to the decomposition process described in [14] for extremal lattices. This notion leads to simple greedy algorithms for distributivity checking, lattice recognition and jump number computation. In the last section, we give several algorithms for lattices and orders.
Similar content being viewed by others
References
Baldy, P. and Morvan, M. (1993) A linear time and space algorithm to recognize interval orders, Discrete Appl. Math. 46, 173–178.
Behrendt, G. (1988) Maximal antichains in partially ordered sets, Ars Combin C(25), 149–157.
Birkhoff, G. (1957) Lattice Theory, Vol. 25 of Coll. Publ. XXV, American Mathematical Society, Providence3rd edition.
Bonnet, R. and Pouzet, M. (1969) Extensions et stratifications d'ensembles dispersés, C.R. Acad. Sci. t. 268-Série A, 1512–1515.
Chaty, G. and Chein, M. (1981) Ordered matchings and matchings without alternating cycles in bipartite graphs, Utilitas 16, 183–187.
Habib, M. (1981) Substitution des structures combinatoires, théorie et algorithmes, Ph.D. Thesis, Université Pierre et Marie Curie, Paris VI.
Habib, M., Medina, R., Nourine, L. and Steiner, G. (1995) Efficient algorithms on distributive lattices, RR. Lirmm 95-033, submitted.
Habib, M., Morovan, M., Pouzet, M. and Rampon, J.-X. (1991) Extensions intervallaires minimales, C.R. Acad. Sci. Paris I(313), 893–898.
Habib, M., Morvan, M., Pouzet, M. and Rampon, J.-X. (1991) Incidence structure, coding and lattice of maximal antichains. Technical report.
Habib, M. and Nourine, L. (1993) A linear time algorithm to recognize distributive lattices, Research Report 92-012, to appear in Order, LIRMM, Montpellier, France.
Jard, C., Jourdan, G.-V. and Rampon, J.-X. (1994) Computing on-line the lattice of maximal antichains of posets, Order 11, 197–210.
Markowsky, G. (1973) Some combinatorial aspects of lattice theory, in Houston Lattice Theory Conf. (ed.), Proc. Univ. Houston, pp. 36–68.
Markowsky, G. (1975) The factorization and representation of lattices, Trans. Amer. Math. Soc. 203, 185–200.
Markowsky, G. (1992) Primes, irreducibles and extremal lattices, Order 9, 265–290.
Morvan, M. and Nourine, L. (1993) Sur la distributivité du treillis des antichaînes maximales d'un ensemble ordonné, C.R. Acad. Sci. t.317-Série I, 129–133.
Niederle, J. (1995) Boolean and distributive ordered sets: Characterization and representation by sets, Order 12, 189–210.
Reuter, K. (1991) The jump number and the lattice of maximal antichains, Discrete Mathematics.
Wille, R. (1982) Restructuring lattice Theory, in I.Rival (ed.), Ordered Sets, NATO ASI No. 83, Reidel, Dordrecht, Holland.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Morvan, M., Nourine, L. Simplicial elimination schemes, extremal lattices and maximal antichain lattices. Order 13, 159–173 (1996). https://doi.org/10.1007/BF00389839
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00389839