A note on blocks of skeleton tolerances. (Q397016): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
A \textit{tolerance relation} (or shortly \textit{tolerance}) of a lattice \(L\) is a reflexive and symmetric binary relation compatible with the operations of \(L\). The \textit{skeleton tolerance} of a finite lattice \(L\) is the smallest tolerance of \(L\) whose transitive closure is the total relation \(L^2\). A \textit{block} of a tolerance \(T\) of \(L\) is a maximal subset \(X\) of \(L\) such that every two elements of \(X\) are in the relation \(T\). Every block of a tolerance of \(L\) is a convex sublattice of \(L\) (hence an interval of \(L\) in case that \(L\) is finite). The goal of the paper is to characterize lattices which can be blocks of the skeleton tolerance of a finite lattice. In order to reach this goal, the authors introduce the following concept: A finite lattice \(L\) (with least element \(0\) and greatest element \(1\)) is called \textit{two-tailed} if \(|L|>2\), \(0\) is meet-irreducible and \(1\) is join-irreducible. The main result is the following Theorem: A finite lattice \(L\) is a block of the skeleton tolerance of a finite lattice if and only if \(L\) is not two-tailed. -- Moreover, some additional results are given for finite distributive lattices. | |||
Property / review text: A \textit{tolerance relation} (or shortly \textit{tolerance}) of a lattice \(L\) is a reflexive and symmetric binary relation compatible with the operations of \(L\). The \textit{skeleton tolerance} of a finite lattice \(L\) is the smallest tolerance of \(L\) whose transitive closure is the total relation \(L^2\). A \textit{block} of a tolerance \(T\) of \(L\) is a maximal subset \(X\) of \(L\) such that every two elements of \(X\) are in the relation \(T\). Every block of a tolerance of \(L\) is a convex sublattice of \(L\) (hence an interval of \(L\) in case that \(L\) is finite). The goal of the paper is to characterize lattices which can be blocks of the skeleton tolerance of a finite lattice. In order to reach this goal, the authors introduce the following concept: A finite lattice \(L\) (with least element \(0\) and greatest element \(1\)) is called \textit{two-tailed} if \(|L|>2\), \(0\) is meet-irreducible and \(1\) is join-irreducible. The main result is the following Theorem: A finite lattice \(L\) is a block of the skeleton tolerance of a finite lattice if and only if \(L\) is not two-tailed. -- Moreover, some additional results are given for finite distributive lattices. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: G. Eigenthaler / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 06B10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 06B05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 06D05 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6330502 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
tolerance relations | |||
Property / zbMATH Keywords: tolerance relations / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
skeleton tolerance | |||
Property / zbMATH Keywords: skeleton tolerance / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
blocks of tolerances | |||
Property / zbMATH Keywords: blocks of tolerances / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
finite lattices | |||
Property / zbMATH Keywords: finite lattices / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
finite distributive lattices | |||
Property / zbMATH Keywords: finite distributive lattices / rank | |||
Normal rank |
Revision as of 15:31, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on blocks of skeleton tolerances. |
scientific article |
Statements
A note on blocks of skeleton tolerances. (English)
0 references
14 August 2014
0 references
A \textit{tolerance relation} (or shortly \textit{tolerance}) of a lattice \(L\) is a reflexive and symmetric binary relation compatible with the operations of \(L\). The \textit{skeleton tolerance} of a finite lattice \(L\) is the smallest tolerance of \(L\) whose transitive closure is the total relation \(L^2\). A \textit{block} of a tolerance \(T\) of \(L\) is a maximal subset \(X\) of \(L\) such that every two elements of \(X\) are in the relation \(T\). Every block of a tolerance of \(L\) is a convex sublattice of \(L\) (hence an interval of \(L\) in case that \(L\) is finite). The goal of the paper is to characterize lattices which can be blocks of the skeleton tolerance of a finite lattice. In order to reach this goal, the authors introduce the following concept: A finite lattice \(L\) (with least element \(0\) and greatest element \(1\)) is called \textit{two-tailed} if \(|L|>2\), \(0\) is meet-irreducible and \(1\) is join-irreducible. The main result is the following Theorem: A finite lattice \(L\) is a block of the skeleton tolerance of a finite lattice if and only if \(L\) is not two-tailed. -- Moreover, some additional results are given for finite distributive lattices.
0 references
tolerance relations
0 references
skeleton tolerance
0 references
blocks of tolerances
0 references
finite lattices
0 references
finite distributive lattices
0 references