Derived semidistributive lattices

DOI10.1007/S00012-010-0073-4MaRDI QIDQ607453zbMATH OpenOpenAlexFDO

Authors Luigi Santocanale

Publication date 22 November 2010

Published in Algebra Universalis (Search for Journal in Brave)

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

zbMATH Keywords

associahedronpermutohedronbounded latticesemidistributive latticestrict facet labelling

Mathematics Subject Classification ID

Preorders, orders, domains and lattices (viewed as categories) (18B35) Lattices (06B99)

Abstract: For L a finite lattice, let C(L) denote the set of pairs g = (g_0,g_1) such that g_0 is a lower cover of g_1 and order it as follows: g <= d iff g_0 <= d_0, g_1 <= d_1, but not g_1 <= d_0. Let C(L,g) denote the connected component of g in this poset. Our main result states that C(L,g) is a semidistributive lattice if L is semidistributive, and that C(L,g) is a bounded lattice if L is bounded. Let S_n be the permutohedron on n letters and T_n be the associahedron on n+1 letters. Explicit computations show that C(S_n,a) = S_{n-1} and C(T_n,a) = T_{n-1}, up to isomorphism, whenever a is an atom. These results are consequences of new characterizations of finite join semidistributive and finite lower bounded lattices: (i) a finite lattice is join semidistributive if and only if the projection sending g in C(L) to g_0 in L creates pullbacks, (ii) a finite join semidistributive lattice is lower bounded if and only if it has a strict facet labelling. Strict facet labellings, as defined here, are generalization of the tools used by Barbut et al. to prove that lattices of Coxeter groups are bounded.

Recommendations

• The fundamental theorem of finite semidistributive lattices
• How to derive finite semimodular lattices from distributive lattices?
• On permutation lattices
• A scheme for congruence semidistributivity
• scientific article; zbMATH DE number 802713

Cites work

• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 758787 (Why is no real title available?)
• A survey of tensor products and related constructions in two lectures
• A topological representation theory for lattices
• An approach to lattice varieties of finite height
• Cayley lattices of finite Coxeter groups are bounded
• Characterizations of Finite Lattices that are Bounded-Homomqrphic Images or Sublattices of Free Lattices
• Equational Bases and Nonmodular Lattice Varieties
• Join-semidistributive lattices and convex geometries.
• Lattice congruences of the weak order.
• Lattice varieties covering the smallest non-modular variety
• Lattices That are Embeddable in Suborder Lattices
• Lectures on Polytopes
• On the join dependency relation in multinomial lattices
• On theories with a combinatorial definition of 'equivalence'
• Problems of associativity: a simple proof for the lattice property of systems ordered by a semi-associative law
• THE LATTICE OF PERMUTATIONS IS BOUNDED
• Towards an algebraic theory of Boolean circuits.
• Two families of Newman lattices

Cited in

(6)

• scientific article; zbMATH DE number 1534358 (Why is no real title available?)
• Dual digraphs of finite semidistributive lattices
• Note on the description of join-distributive lattices by permutations
• Classes of Semidistributive Lattices
• THE LATTICE OF PERMUTATIONS IS BOUNDED
• The fundamental theorem of finite semidistributive lattices

This page was built for publication: Derived semidistributive lattices

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