Counting formulas for glued lattices

DOI10.1007/BF00383603MaRDI QIDQ800946zbMATH OpenFDO

Authors Klaus Reuter

Publication date 1985

Published in Order (Search for Journal in Brave)

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

zbMATH Keywords

blockscomplete latticecoversDilworth's covering theoremglued tolerance relationtolerance relation

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Structure theory of lattices (06B05) Lattice ideals, congruence relations (06B10) Complete lattices, completions (06B23)

Review text

A binary relation \(\theta\) on a complete lattice L is called a tolerance relation, if it is reflexive and symmetric and \(x_ 1\theta y_ 1\), \(x_ 2\theta y_ 2\) imply \(x_ 1\vee x_ 2\theta y_ 1\vee y_ 2,\) \(x_ 1\wedge x_ 2\theta y_ 1\wedge y_ 2\) for any elements \(x_ 1\), \(x_ 2\), \(y_ 1\), \(y_ 2\) of L. For any \(a\in L\) the notation \(a_{\theta}=\wedge \{x\in L| a\theta x\}\), \(a^{\theta}=\vee \{x\in L| a\theta x\}\) is introduced. The interval \([a]_{\theta}=[a_{\theta},(a_{\theta})^{\theta}]\) is called a block of \(\theta\). The factor-lattice L/\(\theta\) is considered; its elements are blocks of \(\theta\). If any two blocks of \(\theta\) such that one covers another in L/\(\theta\) are disjoint, then \(\theta\) is called a glued tolerance relation. A formula enumerating the number of elements of L with exactly k lower (or upper) covers is proved. Some similar formulae are proved and a new proof of Dilworth's covering theorem is given.

Recommendations

• A note on blocks of skeleton tolerances.
• On the lattice of tolerances for a finite chain
• On the tolerance lattice of tolerance factors
• scientific article; zbMATH DE number 3851165
• Tolerances and congruences on lattices

Cites work

• Dilworth's covering theorem for modular lattices: A simple proof
• scientific article; zbMATH DE number 3777562 (Why is no real title available?)
• Proof of a conjecture on finite modular lattices
• S-verklebte Summen von Verbänden
• Subdirect decomposition of concept lattices
• Subdirekte Produkte vollständiger Verbände.
• The imbedding problem for modular lattices
• Tolerance relation on lattices
• Tolerance relations on lattices

Cited in

(9)

• Matchings for linearly indecomposable modular lattices
• Subdiagrams equal in number to their duals
• Gluings of modular lattices
• The core of finite lattices
• Distributive lattices determined by weighted double skeletons
• Matchings and Radon transforms in lattices II. Concordant sets
• A note on blocks of skeleton tolerances.
• scientific article; zbMATH DE number 2015265 (Why is no real title available?)
• Sparingly glued tolerances

This page was built for publication: Counting formulas for glued lattices

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