Abstract
We discuss bijections that relate families of chains in lattices associated to an order P and families of interval orders defined on the ground set of P. Two bijections of this type have been known:
(1) The bijection between maximal chains in the antichain lattice A(P) and the linear extensions of P.
(2) The bijection between maximal chains in the lattice of maximal antichains AM(P) and minimal interval extensions of P.
We discuss two approaches to associate interval orders with chains in A(P). This leads to new bijections generalizing Bijections 1 and 2. As a consequence, we characterize the chains corresponding to weak-order extensions and minimal weak-order extensions of P.
Seeking for a way of representing interval reductions of P by chains we came upon the separation lattice S(P). Chains in this lattice encode an interesting subclass of interval reductions of P. Let SM(P) be the lattice of maximal separations in the separation lattice. Restricted to maximal separations, the above bijection specializes to a bijection which nicely complements 1 and 2.
(3) A bijection between maximal chains in the lattice of maximal separations SM(P) and minimal interval reductions of P.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Birkhoff, G. (1979) Lattice Theory, 3rd edn, Amer. Math. Soc. Colloquium Publications 25, Amer. Math. Soc., Providence, RI.
Bertet, K., Gustedt, J. and Morvan, M. (1997) Weak-order extensions of an order, in Proceedings of WG97, LNCS 1198, pp. 65–77.
Cogis, O. (1982) On the Ferrers dimension of a digraph, Discrete Math. 38, 47–52.
Felsner, S., Habib, M. and Möhring, R. H. (1994) On the interplay of interval dimension and dimension, SIAM J. Discrete Math. 7, 32–40.
Felsner, S. (1994) 3-interval irreducible partially ordered sets, Order 11, 97–125.
Gustedt, J. and Morvan, M. (1992) N-free orders and minimal interval extensions, Order 9(3), 291–302.
Habib, M., Morvan, M., Pouzet, M. and Rampon, J.-X. (1991) Extensions intervallaires minimales. (Minimal interval extensions.) C.R. Acad. Sci. Paris, Ser. I 313(13), 893–898.
Langley, L. (1995) A recognition algorithm for orders of interval dimension two, Discrete Appl. Math. 60, 257–266.
Mitas, J. (1995) Interval orders based on arbitrary ordered sets, Discrete Math. 144, 75–95.
Möhring, R. H. (1989) Computationally tractable classes of ordered sets, in I. Rival (ed.), Algorithms and Orders, Reidel, Dordrecht, pp. 105–194.
Morvan, M. and Nourine, L. (1996) Simplicial elimination schemes, extremal lattices and maximal antichain lattices, Order 13(2), 159–173.
Reuter, K. (1991) The jump number and the lattice of maximal antichains, Discrete Math. 88, 289–307.
Stanley, R. (1972), Ordered Structures and Partitions, Mem. Amer. Math. Soc. 119.
Stanley, R. (1986) Enumerative Combinatorics, Vol. 1, The Wadsworth & Brooks/Cole Mathematics Series, Monterey, California.
Sysło, M. M. (1982) A labeling algorithm to recognize a line graph and output its root graph, Inform. Process. Lett. 15, 28–30.
Wille, R. (1982) Restructuring lattice theory: An approach based on hierarchies of concepts, in Ordered Sets, Proc. NATO Adv. Study Inst., Banff/Can. 1981, 445–470.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Felsner, S., Gustedt, J. & Morvan, M. Interval Reductions and Extensions of Orders: Bijections to Chains in Lattices. Order 15, 221–246 (1998). https://doi.org/10.1023/A:1006211307442
Issue Date:
DOI: https://doi.org/10.1023/A:1006211307442