On the join dependency relation in multinomial lattices
From MaRDI portal
Publication:2464733
DOI10.1007/s11083-007-9066-0zbMath1129.06005OpenAlexW2049066749MaRDI QIDQ2464733
Publication date: 17 December 2007
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11083-007-9066-0
Related Items (4)
Derived semidistributive lattices ⋮ Sublattices of associahedra and permutohedra ⋮ The extended permutohedron on a transitive binary relation. ⋮ The continuous weak order
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An event structure semantics for general Petri nets
- Varieties of lattices
- The order dimension of multinomial lattices
- Two families of Newman lattices
- Permutation lattices revisited
- On permutation lattices
- Cayley lattices of finite Coxeter groups are bounded
- The dimension monoid of a lattice
- Partial orderings of permutations and monotonicity of a rank correlation statistic
- Lattices of lattice paths
- Lattice congruences of the weak order.
- An approach to lattice varieties of finite height
- Characterizations of Finite Lattices that are Bounded-Homomqrphic Images or Sublattices of Free Lattices
- An extension of the notions of traces and of asynchronous automata
- FROM JOIN-IRREDUCIBLES TO DIMENSION THEORY FOR LATTICES WITH CHAIN CONDITIONS
- THE LATTICE OF PERMUTATIONS IS BOUNDED
This page was built for publication: On the join dependency relation in multinomial lattices