Permutation lattices revisited
DOI10.1016/0165-4896(94)00731-4zbMATH Open0881.06002OpenAlexW1990751763MaRDI QIDQ1364431FDOQ1364431
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
algorithmsautomorphism grouppseudocomplemented latticedual automorphismsKlein 4-groupjoin-pseudocomplementmeet-semidistributivemeets and joins of permutationsNewman commutativity latticesposet of irreducibles
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Pseudocomplemented lattices (06D15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Primes, irreducibles and extremal lattices
- Two families of Newman lattices
- On permutation lattices
- Partial orderings of permutations and monotonicity of a rank correlation statistic
- Generalized Quotients in Coxeter Groups
- Les treillis pseudocomplémentés finis. (The finite pseudocomplemented lattices)
- Finite pseudocomplemented lattices and ``permutoedre
- The Factorization and Representation of Lattices
- The Automorphism Group of the Strong Order of the Symmetric Group
Cited In (14)
- Luby-Rackoff revisited: on the use of permutations as inner functions of a Feistel scheme
- Finite pseudocomplemented lattices and ``permutoedre
- Two families of Newman lattices
- On permutation lattices
- Hopf algebras of parking functions and decorated planar trees
- Lattices of regular closed subsets of closure spaces
- Noncrossing arc diagrams, Tamari lattices, and parabolic quotients of the symmetric group
- On the join dependency relation in multinomial lattices
- Reducible classes of finite lattices
- Перестановочные решетки отношений эквивалентности на декартовых произведениях и согласованные с ними системы уравнений. II
- Largest minimal inversion-complete and pair-complete sets of permutations
- LA, permutations, and the Hajós calculus
- THE LATTICE OF PERMUTATIONS IS BOUNDED
- Bubble lattices. I: Structure
This page was built for publication: Permutation lattices revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364431)