Excess of a lattice

DOI10.1007/S003730200029MaRDI QIDQ1865130zbMATH OpenOpenAlexFDO

Authors Tetsuya Abe

Publication date 25 March 2003

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s003730200029

zbMATH Keywords

Boolean latticediamondexcessmismatching pairpentagonproductrelatively complemented lattice

Mathematics Subject Classification ID

Structure theory of lattices (06B05) Lattice ideals, congruence relations (06B10)

Review text

A pair \((x,y)\) of elements in a lattice is said to be mismatching if \(x\) is join-irreducible, \(y\) is meet-irreducible and \(x\nleqslant y\). The excess of a lattice \(L\) is the number \(\text{ex}(L) =|L|-\min \{|V_x|+ |I_y|\): \((x,y)\) is a mismatching pair\}, where \(V_x\) and \(I_y\) are the filter generated by \(x\) and the ideal generated by \(y\), respectively. It is shown that a lattice has excess zero (one) iff it is isomorphic to a Boolean lattice (of one of the following types: two-element chain, diamond, pentagon). It is also proved that the cardinality of a relatively complemented lattice which is not Boolean is at most five times its excess.

Recommendations

• scientific article; zbMATH DE number 2188481
• scientific article; zbMATH DE number 1751600
• On the number of join-irreducibles in a congruence representation of a finite distributive lattice
• Some properties of Eulerian lattices.
• Matchings and Radon transforms in lattices. I: Consistent lattices

Cited in

(5)

• On the scope of averaging for Frankl's conjecture
• On averaging Frankl's conjecture for large union-closed-sets
• Excess in arrangements of segments
• scientific article; zbMATH DE number 5548454 (Why is no real title available?)
• The journey of the union-closed sets conjecture

This page was built for publication: Excess of a lattice

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