Counting formulas for glued lattices (Q800946): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Tolerance relations on lattices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tolerance relation on lattices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3956998 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Proof of a conjecture on finite modular lattices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dilworth's covering theorem for modular lattices: A simple proof / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The imbedding problem for modular lattices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: S-verklebte Summen von Verbänden / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Subdirect decomposition of concept lattices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Subdirekte Produkte vollständiger Verbände. / rank | |||
Normal rank |
Latest revision as of 16:05, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Counting formulas for glued lattices |
scientific article |
Statements
Counting formulas for glued lattices (English)
0 references
1985
0 references
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.
0 references
complete lattice
0 references
tolerance relation
0 references
blocks
0 references
glued tolerance relation
0 references
covers
0 references
Dilworth's covering theorem
0 references