Permutation lattices revisited

DOI10.1016/0165-4896(94)00731-4zbMath0881.06002OpenAlexW1990751763MaRDI QIDQ1364431

George Markowsky

Publication date: 17 February 1998

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0165-4896(94)00731-4

zbMATH Keywords

algorithmsautomorphism grouppseudocomplemented latticedual automorphismsKlein 4-groupjoin-pseudocomplementmeet-semidistributivemeets and joins of permutationsNewman commutativity latticesposet of irreducibles

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Pseudocomplemented lattices (06D15)

Related Items

THE LATTICE OF PERMUTATIONS IS BOUNDED, Two families of Newman lattices, Reducible classes of finite lattices, On permutation lattices, Lattices of regular closed subsets of closure spaces, Bubble lattices. I: Structure, On the join dependency relation in multinomial lattices, Largest minimal inversion-complete and pair-complete sets of permutations, Noncrossing arc diagrams, Tamari lattices, and parabolic quotients of the symmetric group, Hopf algebras of parking functions and decorated planar trees

Cites Work

• Finite pseudocomplemented lattices and ``permutoedre
• Les treillis pseudocomplémentés finis. (The finite pseudocomplemented lattices)
• Primes, irreducibles and extremal lattices
• Two families of Newman lattices
• 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
• The Factorization and Representation of Lattices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item