More constructions for Sperner partition systems

DOI10.1002/JCD.21780MaRDI QIDQ6145736zbMATH OpenOpenAlexFDO

Authors Adam Gowty, Daniel Horsley

Publication date 2 February 2024

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2010.10756

zbMATH Keywords

clutterSperner partition systemSperner set system

Mathematics Subject Classification ID

Partitions of sets (05A18) Extremal set theory (05D05)

Abstract: An $(n,k)$-Sperner partition system is a set of partitions of some $n$-set such that each partition has $k$ nonempty parts and no part in any partition is a subset of a part in a different partition. The maximum number of partitions in an $(n,k)$-Sperner partition system is denoted $mathrmSP(n,k)$. In this paper we introduce a new construction for Sperner partition systems based on a division of the ground set into many equal-sized parts. We use this to asymptotically determine $mathrmSP(n,k)$ in many cases where $fracnk$ is bounded as $n$ becomes large. Further, we show that this construction produces a Sperner partition system of maximum size for numerous small parameter sets $(n,k)$. By extending a separate existing construction, we also establish the asymptotics of $mathrmSP(n,k)$ when $nequivkpm1pmod2k$ for almost all odd values of $k$.

Recommendations

• New bounds on the maximum size of Sperner partition systems
• Sperner partition systems
• A Sperner-type theorem for set-partition systems
• Sperner systems containing at most \(k\) sets of every cardinality
• All maximum 2-part Sperner families

Cites work

• A Sperner-type theorem for set-partition systems
• Disjoint spread systems and fault location
• Extremal problems for finite sets
• scientific article; zbMATH DE number 3478938 (Why is no real title available?)
• Linear optimization and extensions.
• New bounds on the maximum size of Sperner partition systems
• On almost-regular edge colourings of hypergraphs
• Sperner partition systems
• Stirling's Approximation for n!: The Ultimate Short Proof?

Cited in

(2)

• Detecting arrays for effects of multiple interacting factors
• Lower bounds and construction of detecting arrays

This page was built for publication: More constructions for Sperner partition systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6145736)