Atoms in Four-Element Generating Sets of Partition Lattices

Since Henrik Strietz’s 1975 paper proving that the lattice Part(𝑛) of all partitions of an 𝑛-element finite set is four-generated, more than half a dozen papers have been devoted to four-element generating sets of this lattice. We prove that each element of Part(𝑛) with height one or two (in particular, each atom) belongs to a four-element generating set. Furthermore, our construction leads to a concise and easy proof of a 1996 result of the author stating that the lattice of partitions of a countably infinite set is four-generated as a complete lattice. In a recent paper “Generating Boolean lattices by few elements and exchanging session keys”, see https://doi.org/10.30755/NSJOM.16637 , the author establishes a connection between cryptography and small generating sets of some lattices, including Part(𝑛). Hence, it is worth pointing out that by combining a construction given here with a recent paper by the author, “ Four-element generating sets with block count width at most two in partition lattices ”, available at https://tinyurl.com/czg-4gw2 , we obtain many four-element generating sets of Part(𝑛).

Authors

Institutions

Publication Details

Journal
Mathematica Pannonica
Published
2025-06-06
DOI
https://doi.org/10.1556/314.2025.00010
Citations
1
Primary Topic
Advanced Algebra and Logic
Type
article
Field-Weighted Citation Impact
1.50

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Atoms in Four-Element Generating Sets of Partition Lattices

Gábor Czédli
1 citations
Mathematica Pannonica
Advanced Algebra and Logic
1.50
article

Atoms in Four-Element Generating Sets of Partition Lattices

Gábor Czédli
article en
1 citations

Abstract

Since Henrik Strietz’s 1975 paper proving that the lattice Part(𝑛) of all partitions of an 𝑛-element finite set is four-generated, more than half a dozen papers have been devoted to four-element generating sets of this lattice. We prove that each element of Part(𝑛) with height one or two (in particular, each atom) belongs to a four-element generating set. Furthermore, our construction leads to a concise and easy proof of a 1996 result of the author stating that the lattice of partitions of a countably infinite set is four-generated as a complete lattice. In a recent paper “Generating Boolean lattices by few elements and exchanging session keys”, see https://doi.org/10.30755/NSJOM.16637 , the author establishes a connection between cryptography and small generating sets of some lattices, including Part(𝑛). Hence, it is worth pointing out that by combining a construction given here with a recent paper by the author, “ Four-element generating sets with block count width at most two in partition lattices ”, available at https://tinyurl.com/czg-4gw2 , we obtain many four-element generating sets of Part(𝑛).

Mathematica PannonicaVol. 31_NS5(1)
University of Szeged (HU)
Nemzeti Kutatási, Fejlesztési és Innovaciós Alap
Openalex Percentile: Top 16%
Advanced Algebra and Logic
1.50
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.