Coordinatization of finite join-distributive lattices.
From MaRDI portal
Publication:2249406
Abstract: Join-distributive lattices are finite, meet-semidistributive, and semimodular lattices. They are the same as Dilworth's lattices in 1940, and many alternative definitions and equivalent concepts have been discovered or rediscovered since then. Let L be a join-distributive lattice of length n and let k denote the width of the set of join-irreducible elements of L. A result of P.H. Edelman and R.E. Jamison, translated from Combinatorics to Lattice Theory, says that L can be described by k-1 permutations acting on the set {1,...,n}. We prove a similar result within Lattice Theory: there exist k-1 permutations acting on {1,...,n} such that the elements of L are coordinatized by k-tuples over {0,...,n}, and the permutations determine which k-tuples are allowed. Since the concept of join-distributive lattices is equivalent to that of antimatroids and convex geometries, our result offers a coordinatization for these combinatorial structures.
Recommendations
- Note on the description of join-distributive lattices by permutations
- Join-semidistributive lattices and convex geometries.
- On the number of join-irreducibles in a congruence representation of a finite distributive lattice
- On the representations of finite distributive lattices
- The fundamental theorem of finite semidistributive lattices
Cites work
- scientific article; zbMATH DE number 3724452 (Why is no real title available?)
- scientific article; zbMATH DE number 3742601 (Why is no real title available?)
- scientific article; zbMATH DE number 3751028 (Why is no real title available?)
- scientific article; zbMATH DE number 1313604 (Why is no real title available?)
- A use for frequently rediscovering a concept
- Application of the join-irreducible excess function to semi-modular lattices
- Composition series in groups and the structure of slim semimodular lattices.
- Greedoids
- How many ways can two composition series intersect?
- Increase in the join-excess function in a lattice
- Join-semidistributive lattices and convex geometries.
- Lattice Theory: Foundation
- Lattices with unique irreducible decompositions
- Meet-distributive lattices and the anti-exchange closure
- Note on the description of join-distributive lattices by permutations
- Notes on planar semimodular lattices. I. Construction
- Semimodular lattices and semibuildings
- Some results on semimodular lattices
- Structural properties of greedoids
- Supersolvable lattices
- The Jordan-Hölder theorem with uniqueness for groups and semimodular lattices
- The geometry of the chamber system of a semimodular lattice
- The sorting order on a Coxeter group.
- The theory of convex geometries
Cited in
(15)- Slim patch lattices as absolute retracts and maximal lattices
- Finite convex geometries of circles
- Diagrams and rectangular extensions of planar semimodular lattices
- Length-preserving extensions of a semimodular lattice by lowering a join-irreducible element
- CD-independent subsets in meet-distributive lattices.
- Notes on join semidistributive lattices
- A convex combinatorial property of compact sets in the plane and its roots in lattice theory
- Quasiplanar diagrams and slim semimodular lattices
- The number of slim rectangular lattices.
- Atoms and coatoms in three-generated lattices
- Note on the description of join-distributive lattices by permutations
- Patch extensions and trajectory colorings of slim rectangular lattices.
- Embedding convex geometries and a bound on convex dimension
- On the number of atoms in three-generated lattices
- scientific article; zbMATH DE number 4101277 (Why is no real title available?)
This page was built for publication: Coordinatization of finite join-distributive lattices.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249406)
