Interval Reductions and Extensions of Orders: Bijections to Chains in Lattices

Order

Volumn 15, Issue 3, 1998, Pages 221-246

  Felsner, Stefan ^a   Gustedt, Jens ^b   Morvan, Michel ^c  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b INRIA   (France)

^c UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Bijection; Chains; Interval extension; Interval reduction; Lattice of antichains; Weak order

Indexed keywords

EID: 0043228031     PISSN: 01678094     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1006211307442     Document Type: Article

References (16)

1. Birkhoff, G. (1979) Lattice Theory, 3rd edn, Amer. Math. Soc. Colloquium Publications 25, Amer. Math. Soc., Providence, RI.
2. Bertet, K., Gustedt, J. and Morvan, M. (1997) Weak-order extensions of an order, in Proceedings of WG97, LNCS 1198, pp. 65-77.
3. Cogis, O. (1982) On the Ferrers dimension of a digraph, Discrete Math. 38, 47-52.
4. 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.
5. Felsner, S. (1994) 3-interval irreducible partially ordered sets, Order 11, 97-125.
6. Gustedt, J. and Morvan, M. (1992) N-free orders and minimal interval extensions, Order 9 (3), 291-302.
7. 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.
8. Langley, L. (1995) A recognition algorithm for orders of interval dimension two, Discrete Appl. Math. 60, 257-266.
9. Mitas, J. (1995) Interval orders based on arbitrary ordered sets, Discrete Math. 144, 75-95.
10. Möhring, R. H. (1989) Computationally tractable classes of ordered sets, in I. Rival (ed.), Algorithms and Orders, Reidel, Dordrecht, pp. 105-194.
11. Morvan, M. and Nourine, L. (1996) Simplicial elimination schemes, extremal lattices and maximal antichain lattices, Order 13(2), 159-173.
12. Reuter, K. (1991) The jump number and the lattice of maximal antichains, Discrete Math. 88, 289-307.
13. Stanley, R. (1972), Ordered Structures and Partitions, Mem. Amer. Math. Soc. 119.
14. Stanley, R. (1986) Enumerative Combinatorics, Vol. 1, The Wadsworth & Brooks/Cole Mathematics Series, Monterey, California.
15. Sysło, M. M. (1982) A labeling algorithm to recognize a line graph and output its root graph, Inform. Process. Lett. 15, 28-30.
16. 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.