The extended permutohedron on a transitive binary relation.
DOI10.1016/j.ejc.2014.06.004zbMath1341.06007arXiv1211.2301OpenAlexW1999949318MaRDI QIDQ404457
Friedrich Wehrung, Luigi Santocanale
Publication date: 4 September 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.2301
congruence latticespartially ordered setsmeet-irreducible elementsbipartition latticescompletely join-irreducible elementsDedekind-MacNeille completionsextended permutohedraortholatticesregular closed subsetstransitive binary relations
Partitions of sets (05A18) Combinatorics of partially ordered sets (06A07) Structure theory of lattices (06B05) Structure theory of algebraic structures (08A05)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sublattices of associahedra and permutohedra
- The poset of bipartitions
- Sortable elements and Cambrian lattices.
- Enumeration of generalized weak orders
- Les treillis pseudocomplémentés finis. (The finite pseudocomplemented lattices)
- Varieties of lattices
- The order dimension of multinomial lattices
- Two families of Newman lattices
- On permutation lattices
- Cayley lattices of finite Coxeter groups are bounded
- A generalized permutahedron
- Bipartition orders and statistics on words
- Graphical major indices
- Realizations of the associahedron and cyclohedron
- On the join dependency relation in multinomial lattices
- Cambrian lattices.
- Lattice Theory: Foundation
- Clusters, Coxeter-sortable elements and noncrossing partitions
- Free Ortholattices
- Shellable nonpure complexes and posets. II
- THE LATTICE OF PERMUTATIONS IS BOUNDED
- Equational Bases and Nonmodular Lattice Varieties
This page was built for publication: The extended permutohedron on a transitive binary relation.
