«THE BULLETIN OF IRKUTSK STATE UNIVERSITY». SERIES «MATHEMATICS»
«IZVESTIYA IRKUTSKOGO GOSUDARSTVENNOGO UNIVERSITETA». SERIYA «MATEMATIKA»
ISSN 1997-7670 (Print)
ISSN 2541-8785 (Online)

List of issues > Series «Mathematics». 2025. Vol 53

Four-element Generating Sets with Block Count Widths at Most Two in Partition Lattices

Author(s)

G´abor Cz´edli1

1 University of Szeged, Bolyai Institute, Szeged, Hungary

Abstract

The partitions of a finite set form a so-called partition lattice. Henrik Strietz proved that this lattice has a four-element generating set; his paper has been followed by a dozen others. Two recent papers of the present author indicate that small generating sets of these lattices can be applied in cryptography. The block count of a partition is the number of its blocks. Given a four-element set of partitions, list the block counts of its members in increasing order. Then subtract the first (i.e., the smallest) block count from all four to obtain the components of a four-dimensional vector. This vector and its last component are called the block count type and the block count width, respectively, of the given four-element set in question. There are exactly ten block count types of width at most two. We prove that for any partition lattice over a finite base set with at least eight elements, each of the ten block count types of width at most two is the block count type of a four-element generating set of the partition lattice; moreover, we give a lower bound of the number of these generating sets.

About the Authors
G´abor Cz´edli, Dr. Sci.(Phys.-Math.), Emeritus Prof., University of Szeged, Bolyai Institute, Szeged, Hungary, czedli@math.u-szeged.hu
For citation
Cz´edli G. Four-element Generating Sets with Block Count Widths at Most Two in Partition Lattices. The Bulletin of Irkutsk State University. Series Mathematics, 2025, vol. 53, pp. 141–155. https://doi.org/10.26516/1997-7670.2025.53.141
Keywords
equivalence lattice, four-element generating set, partition lattice, many small generating sets
UDC
512.62
MSC
06B99, 06C10
DOI
https://doi.org/10.26516/1997-7670.2025.53.141
References
  1. Ahmed D., Cz´edli G. (1+1+2)-generated lattices of quasiorders. Acta Sci. Math. (Szeged), 2021, vol, 87, pp. 415–427. https://doi.org/10.14232/actasm-021-303-1 
  2. Cz´edli G. Four-generated direct powers of partition lattices and authentication. Publicationes Mathematicae (Debrecen), 2021, vol. 99, pp. 447–472. https://doi.org/10.5486/PMD.2021.9024 
  3. Cz´edli G. Generating Boolean lattices by few elements and exchanging session keys. Novi Sad Journal of Mathematics. https://doi.org/10.30755/NSJOM.16637 
  4. Cz´edli G., Oluoch L. Four-element generating sets of partition lattices and their direct products. Acta Sci. Math. (Szeged), 2020, vol. 86, pp. 405–448. https://doi.org/10.14232/actasm-020-126-7 
  5. Kulin J. Quasiorder lattices are five-generated. Discuss. Math. Gen. Algebra Appl., 2016, vol. 36, pp. 59–70. 
  6. Strietz H. Finite partition lattices are four-generated. Proc. Lattice Th. Conf. Ulm, 1975, pp. 257–259. 
  7. Z´adori L. Generation of finite partition lattices. Lectures in universal algebra: Proc. Colloq. Szeged, 1983. Colloq. Math. Soc. J´anos Bolyai, vol. 43, Amsterdam, North-Holland Publishing, 1986, pp. 573–586.

Full text (english)