THE LATTICE OF PERMUTATIONS IS BOUNDED

DOI10.1142/S0218196700000182zbMath1008.06004OpenAlexW2168387858MaRDI QIDQ4786259

Nathalie Caspard

Publication date: 15 December 2002

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196700000182

zbMATH Keywords

lexicographical orderbounded latticesarrows relations\(A\)-tablelattice of permutations

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Structure theory of lattices (06B05)

Related Items

Cayley lattices of finite Coxeter groups are bounded, Lattices of regular closed subsets of closure spaces, Derived semidistributive lattices, On lattice representations with DCC posets, Sublattices of associahedra and permutohedra, The extended permutohedron on a transitive binary relation., The continuous weak order, On the join dependency relation in multinomial lattices, Noncrossing arc diagrams, Tamari lattices, and parabolic quotients of the symmetric group, Sortable elements in infinite Coxeter groups

Cites Work

• Les treillis pseudocomplémentés finis. (The finite pseudocomplemented lattices)
• The generalized doubling construction and formal concept analysis
• Permutation lattices revisited
• On permutation lattices
• Partial orderings of permutations and monotonicity of a rank correlation statistic
• The Automorphism Group of the Strong Order of the Symmetric Group
• Generalized Quotients in Coxeter Groups
• Characterizations of Finite Lattices that are Bounded-Homomqrphic Images or Sublattices of Free Lattices
• Contributions to the Theory of Rank Order Statistics: Applications of Lattice Theory