Note on the description of join-distributive lattices by permutations

DOI10.1007/S00012-014-0295-YzbMATH Open1301.06024OpenAlexW1992790580MaRDI QIDQ466922FDOQ466922

Authors Gábor Czédli, Kira 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

zbMATH Keywords

permutationtrajectoryconvex geometryantimatroidjoin-distributive latticesemimodular latticediamond-free lattice

Mathematics Subject Classification ID

Algebraic combinatorics (05E99) Semimodular lattices, geometric lattices (06C10)

Abstract: Let L be a join-distributive lattice with length n and width(Ji L) leq k. There are two ways to describe L by k-1 permutations acting on an n-element set: a combinatorial way given by P.H. Edelman and R.E. Jamison in 1985 and a recent lattice theoretical way of the second author. We prove that these two approaches are equivalent. Also, we characterize join-distributive lattices by trajectories.

Recommendations

• Coordinatization of finite join-distributive lattices.
• On permutation lattices
• Derived semidistributive lattices
• Distributive Lattices having n-Permutable Congruences
• On the number of join-irreducibles in a congruence representation of a finite distributive lattice

Cites work

• scientific article; zbMATH DE number 3724452 (Why is no real title available?)
• scientific article; zbMATH DE number 2159636 (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.
• Coordinatization of finite join-distributive lattices.
• How to derive finite semimodular lattices from distributive lattices?
• Join-semidistributive lattices and convex geometries.
• Lattice Theory: Foundation
• Meet-distributive lattices and the anti-exchange closure
• Representing finite convex geometries by relatively convex sets
• 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

(11)

• Slim patch lattices as absolute retracts and maximal lattices
• Coordinatization of finite join-distributive lattices.
• Lattices with many congruences are planar
• Length-preserving extensions of a semimodular lattice by lowering a join-irreducible element
• A new property of congruence lattices of slim, planar, semimodular lattices
• CD-independent subsets in meet-distributive lattices.
• Absolute retracts for finite distributive lattices and slim semimodular lattices
• A convex combinatorial property of compact sets in the plane and its roots in lattice theory
• Quasiplanar diagrams and slim semimodular lattices
• Embedding convex geometries and a bound on convex dimension
• On the number of atoms in three-generated lattices

This page was built for publication: Note on the description of join-distributive lattices by permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q466922)