Coordinatization of finite join-distributive lattices.

DOI10.1007/S00012-014-0282-3zbMATH Open1302.06011arXiv1208.3517OpenAlexW2054213204MaRDI QIDQ2249406FDOQ2249406

Gábor Czédli

Publication date: 1 July 2014

Published in: Algebra Universalis (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1208.3517

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

zbMATH Keywords

semimodular latticesplanar latticesantimatroidsconvex geometriesanti-exchange closurediamond-free lattices[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Jordan-H%EF%BF%BD%EF%BF%BDlder+permutations&go=Go Jordan-H��lder permutations]

Mathematics Subject Classification ID

Algebraic combinatorics (05E99) Discrete geometry (52C99) Semimodular lattices, geometric lattices (06C10)

Cites Work

• Lattice Theory: Foundation
• Title not available (Why is that?)
• Title not available (Why is that?)
• The theory of convex geometries
• Join-semidistributive lattices and convex geometries.
• Supersolvable lattices
• A use for frequently rediscovering a concept
• Application of the join-irreducible excess function to semi-modular lattices
• Title not available (Why is that?)
• The sorting order on a Coxeter group.
• The geometry of the chamber system of a semimodular lattice
• How many ways can two composition series intersect?
• Lattices with unique irreducible decompositions
• Composition series in groups and the structure of slim semimodular lattices
• Notes on planar semimodular lattices. I. Construction
• Title not available (Why is that?)
• Note on the description of join-distributive lattices by permutations
• The Jordan-Hölder theorem with uniqueness for groups and semimodular lattices
• Meet-distributive lattices and the anti-exchange closure
• Increase in the join-excess function in a lattice
• Greedoids
• Title not available (Why is that?)
• Structural properties of greedoids
• Semimodular lattices and semibuildings

Cited In (15)

• Diagrams and rectangular extensions of planar semimodular lattices
• CD-independent subsets in meet-distributive lattices.
• Slim patch lattices as absolute retracts and maximal lattices
• Title not available (Why is that?)
• The number of slim rectangular lattices.
• Atoms and coatoms in three-generated lattices
• Quasiplanar diagrams and slim semimodular lattices
• Note on the description of join-distributive lattices by permutations
• Patch extensions and trajectory colorings of slim rectangular lattices.
• Finite convex geometries of circles
• A convex combinatorial property of compact sets in the plane and its roots in lattice theory
• Embedding convex geometries and a bound on convex dimension
• Length-preserving extensions of a semimodular lattice by lowering a join-irreducible element
• Notes on join semidistributive lattices
• On the number of atoms in three-generated lattices

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)