SPERNER THEOREMS FOR UNRELATED COPIES OF POSETS AND GENERATING DISTRIBUTIVE LATTICES

Abstract

For a finite poset (partially ordered set) \(U\) and a natural number \(n\), let \(S(U,n)\) denote the largest number of pairwise unrelated copies of \(U\) in the powerset lattice (AKA subset lattice) of an \(n\)-element set. If \(U\) is the singleton poset, then \(S(U,n)\) was determined by E. Sperner in 1928; this result is well known in extremal combinatorics. Later, exactly or asymptotically, Sperner's theorem was extended to other posets by A.P. Dove, J.R. Griggs, G.O.H. Katona, D.J. Stahl, and W.T.Jr. Trotter. We determine \(S(U,n)\) for all finite posets with 0 and 1, and we give reasonable estimates for the "\(V\)-shaped" 3-element poset and, mainly, for the 4-element poset with 0 and three maximal elements. For a lattice \(L\), let \(G_{\min}L\) denote the minimum size of generating sets of \(L\). We prove that if \(U\) is the poset of the join-irreducible elements of a finite distributive lattice \(D\), then the function \(k\mapsto G_{\min}{D^k}\) is the left adjoint of the function \(n\mapsto S(U,n)\). This allows us to determine \(G_{\min}{D^k}\) in many cases. E.g., for a 5-element distributive lattice \(D\), \(G_{\min}{D^{2023}}=18\) if \(D\) is a chain and \(G_{\min}{D^{2023}}=15\) otherwise. The present paper, another recent paper, and a 2021 one indicate that large direct powers of small distributive lattices could be of interest in cryptography.

Keywords

• sperner theorem for partially ordered sets, antichain of posets, unrelated copies of a poset, incomparable copies of a poset, distributive lattice, smallest generating set, minimum-sized generating set, cryptography with lattices