A PAIR OF FOUR-ELEMENT HORIZONTAL GENERATING SETS OF A PARTITION LATTICE
Let \(\lfloor x \rfloor\) and \(\lceil x\rceil \) denote the lower integer part and the upper integer part of a real number \(x\), respectively. Our main goal is to construct four partitions of a finite set \(A\) with \(n\geq 7\) elements such that each of the four partitions has exactly \(\lceil n/...
Saved in:
| Main Author: | Gábor Czédli |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ural Branch of the Russian Academy of Sciences and Ural Federal University named after the first President of Russia B.N.Yeltsin, Krasovskii Institute of Mathematics and Mechanics
2025-07-01
|
| Series: | Ural Mathematical Journal |
| Subjects: | |
| Online Access: | https://umjuran.ru/index.php/umj/article/view/842 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
SPERNER THEOREMS FOR UNRELATED COPIES OF POSETS AND GENERATING DISTRIBUTIVE LATTICES
by: Gábor Czédli
Published: (2024-07-01) -
Some Results on Lattice (Anti-Lattice) Ordered Double Framed Soft Sets
by: Tahir Bakhat, et al.
Published: (2019-12-01) -
AN EFFICIENT ALGORITHM FOR MINING FREQUENT ITEM-SETS CONTAINING A CONSTRAINT SUBSET
by: Dương Văn Hải, et al.
Published: (2013-06-01) -
HOMOMORPHISM IN ROUGH LATTICE
by: Dipankar Rana, et al.
Published: (2015-06-01) -
Some Improvements on Good Lattice Point Sets
by: Yu-Xuan Lin, et al.
Published: (2024-10-01)