1 research outputs found

    Four-element generating sets of partition lattices and their direct products

    Full text link
    Let n>3n>3 be a natural number. By a 1975 result of H. Strietz, the lattice Part(n)(n) of all partitions of an nn-element set has a four-element generating set. In 1983, L. Z\'adori gave a new proof of this fact with a particularly elegant construction. Based on his construction from 1983, the present paper gives a lower bound on the number ν(n)\nu(n) of four-element generating sets of Part(n)(n). We also present a computer assisted statistical approach to ν(n)\nu(n) for small values of nn. In his 1983 paper, L. Z\'adori also proved that for n7n\geq 7, the lattice Part(n)(n) has a four element generating set that is not an antichain. He left the problem whether such a generating set for n{5,6}n\in\{5,6\} exists open. Here we solve this problem in negative for n=5n=5 and in affirmative for n=6n=6. Finally, the main theorem asserts that the direct product of some powers of partition lattices is four-generated. In particular, by the first part of this theorem, Part(n1)×(n_1)\times Part(n2)(n_2) is four-generated for any two distinct integers n1n_1 and n2n_2 that are at least 5. The second part of the theorem is technical but it has two corollaries that are easy to understand. Namely, the direct product Part(n)(n) ×\times Part(n+1)(n+1) ××\times\dots\times Part(3n14)(3n-14) is four-generated for each integer n9n\geq 9. Also, for every positive integer uu, the uu-th the direct power of the direct product Part(n)(n) ×\times Part(n+1)(n+1) ××\times\dots\times Part(n+u1)(n+u-1) is four-generated for all but finitely many nn. If we do not insist on too many direct factors, then the exponent can be quite large. For example, our theorem implies that the 1012710^{127}-th direct power of Part(1011)(1011) ×\times Part(1012)(1012) ××\times \dots \times Part(2020)(2020) is four-generated.Comment: 34 pages, 6 figure
    corecore