the lattice of permutations is bounded

International Journal of Algebra and Computation

Volumn 10, Issue 4, 2000, Pages 481-489

  Gaspard, Nathalie ^a  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

A table; Arrows relations; Bounded lattice; Lexicographical order; Permutation.

Indexed keywords

EID: 0347368290     PISSN: 02181967     EISSN: None     Source Type: Journal    
DOI: 10.1142/s0218196700000182     Document Type: Article

References (20)

1. M. Barbut and B. Monjardet, Ordre et classification, Vols. 1 and 2 Hachette, Paris, France, 1970.
2. A. Björner, Orderings of Coxeter Groups, Contemp. Math., Amer. Math. Soc. Providence, R. I., 34 (1984), 175-195.
3. A. Björner and M. Wachs, Generalized quotients in Coxeter Groups, Trans. Amer. Math. Soc. 308 (1), (1988).
4. C. Chameni-Nembua, Permutoèdre et choix social, Thèse de Mathématiques Appliquées aux Sciences Sociales, Université Paris 5 (1989).
5. C. Chameni-Nembua and B. Monjardet, Les treillis pseudo-complémentés finis, Europ. J. Comb. 13 (1992), 89-107.
6. C. Le Conte de Poly-Barbut, Automorphismes du permutoèdre et votes de Condorcet, Math. Inf. Sci. Hum. 111 (1990), 73-82.
7. C. Le Conte de Poly-Barbut, Le diagramme du treillis permutoèdre est intersection des diagrammes de 2 produits directs d'ordres totaux, Math. Inf. Sci. Hum. 112 (1990), 49-53.
8. C. Le Conte de Poly-Barbut, Sur les treillis de Coxeter finis, Math. Inf. Sci. Hum. 125 (1994), 41-57.
9. A. Day, Characterizations of finite lattices that are bounded-homomorphic images or sublattices of free lattices, Canad. J. Math. 31 (1979), 69-78.
10. V. Duquenne and A. Cherfouh, On permutation lattices, Math. Soc. Sci. 27 (1994), 73-89.
11. n, Comb. Algebra, ed. C. Greene, Contemporary Mathematics Amer. Math. Soc., Providence, R.I. 34 (1984) 155-162.
12. W. Geyer, The generalized doubling construction and formal concept analysis, Algebra Universalis 32 (1994), 341-367.
13. G. Guilbaud and P. Rosenstiehl, Analyse algébrique d'un scrutin, Math. Sci. Hum. 4 (1963), 9-33.
14. D. E. Knuth, Sorting and Searching, the art of computer programming, Vol. 3, Reading Mass., Addison-Wesley (1973).
15. J. P. S. Kung and D. C. Sutherland, The automorphism group of the strong order of the symmetric group, J. London Math. Soc. 37 (1988), 193-202.
16. A. Lascoux and M. P. Schutzenberger, Treillis et bases des groupes de Coxeter, Elect. J. Comb. 3 (2) (1996).
17. G. Markowsky, Permutation lattices revisited, Math. Soc. Sci. 27 (1994), 59-72.
18. I. R. Savage, Contributions to the theory of rank order statistics: Applications of lattice theory, Rev. Int. Statist. Inst. 32 (1964), 52-64.
19. R. Sedgewick and P. Flajolet, An introduction to the Analysis of Algorithms, Addison-Wesley (1996).
20. T. Yanagimoto and M. Okamoto, Partial orderings of permutations and monotonicity of a rank correlation statistic, Ann. Inst. Statist. Math. 21 (1969), 489-506.