Note on the description of join-distributive lattices by permutations
From MaRDI portal
Publication:466922
DOI10.1007/s00012-014-0295-yzbMath1301.06024arXiv1210.3376MaRDI QIDQ466922
Gábor Czédli, K. V. Adaricheva
Publication date: 31 October 2014
Published in: Algebra Universalis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.3376
permutation; semimodular lattice; antimatroid; trajectory; convex geometry; join-distributive lattice; diamond-free lattice
Related Items
On the number of atoms in three-generated lattices, A new property of congruence lattices of slim, planar, semimodular lattices, A convex combinatorial property of compact sets in the plane and its roots in lattice theory, Absolute retracts for finite distributive lattices and slim semimodular lattices, Length-preserving extensions of a semimodular lattice by lowering a join-irreducible element, Quasiplanar diagrams and slim semimodular lattices, CD-independent subsets in meet-distributive lattices., Embedding convex geometries and a bound on convex dimension, Lattices with many congruences are planar, Coordinatization of finite join-distributive lattices.
Cites Work
- The Jordan-Hölder theorem with uniqueness for groups and semimodular lattices
- A use for frequently rediscovering a concept
- Application of the join-irreducible excess function to semi-modular lattices
- The sorting order on a Coxeter group.
- How to derive finite semimodular lattices from distributive lattices?
- The theory of convex geometries
- Meet-distributive lattices and the anti-exchange closure
- The geometry of the chamber system of a semimodular lattice
- Join-semidistributive lattices and convex geometries.
- Coordinatization of finite join-distributive lattices.
- Representing finite convex geometries by relatively convex sets
- Composition series in groups and the structure of slim semimodular lattices
- Lattice Theory: Foundation
- Unnamed Item
- Unnamed Item
