No label defined (Q3772269)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4031760
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4031760 |
Statements
1986
0 references
partition lattice
0 references
congruence lattice
0 references
generating sets of minimum cardinality
0 references
0.8086170554161072
0 references
0.7611951231956482
0 references
0.7570650577545166
0 references
0.7569841146469116
0 references
[For the entire collection see Zbl 0588.00012.] Let \(P_ n\) denote the lattice of all partitions of an n-element set ṉ. The author gives a 3-element subset \(A_ n\subset P_ n\) (n\(\geq 3\), \(n\neq 4)\) such that for the congruence lattice L of any algebra on ṉ we have: \(L\supseteq A_ n\) implies \(L=P_ n\). He uses a well- known lemma implying that it suffices to deal with unary operations only. Finally new generating sets of minimum cardinality in \(P_ n\) are given. They are of type \(1+1+1+1\) (4 pairwise incomparable elements) for \(n\geq 4\) and of type \(1+1+2\) (only 2 of of the 4 elements are comparable) for \(n\geq 7\).
0 references