Braids and their monotone clones (Q1337149): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Brian A. Davey / rank | |||
Property / author | |||
Property / author: Ralph McKenzie / rank | |||
Property / author | |||
Property / author: Brian A. Davey / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Ralph McKenzie / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Monotone clones and congruence modularity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4692885 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algebraic properties of crowns and fences / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01191536 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2056084621 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:35, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Braids and their monotone clones |
scientific article |
Statements
Braids and their monotone clones (English)
0 references
1 May 1995
0 references
The authors investigate properties of monotone clones of ordered sets called braids. For an ordered set \(P\), let \(d(a,b)\) denote the minimal number of edges of the up-fence and the down-fence from \(a\) to \(b\). The reach \(r(P)\) is the supremum of \(d(a,b)\) as \(a\) and \(b\) vary over \(P\). An ordered set \(B\) is called a braid if it has at least three elements, is connected, has finite reach and for any \(a\in B\) there exists a unique \(a'\in B\) with \(d(a,a')= r(B)\). So every \(n\)-crown \(C_ n\) with \(2n\) elements is a braid of reach \(r(C_ n)=n\); if \(L\) is an atomless Boolean lattice, then \(B=L \setminus \{0,1\}\) is a braid with \(r(B)=3\). The main result is the following: If \(B\) is a braid with reach \(r(B)>2\), then the only idempotent order preserving functions \(f: B^ n\to B\) are the \(n\) projections. Hence, using Mal'tsev conditions for congruence modularity, no algebra of monotone functions on a finite braid \(B\) with \(r(B)>2\) generates a congruence modular variety. The main result is also generalized to the so-called near-braids.
0 references
fence
0 references
crown
0 references
monotone clones
0 references
ordered sets
0 references
braids
0 references
reach
0 references
order preserving functions
0 references
congruence modularity
0 references
algebra of monotone functions
0 references
near-braids
0 references