2000 character limit reached
Intersecting integer partitions: star bounds and counterexamples at every scale
Published 1 Oct 2026 in math.CO and math.NT | (2610.01747v1)
Abstract: Two integer partitions -intersect if they have at least common parts, counted with multiplicity. We study the largest -intersecting families of integer partitions of into exactly positive parts. The canonical -star consists of the partitions containing at least ones. Applying Kupavskii's weak-spread theorem, we prove that this star is largest whenever , for every fixed $A>24$ and all sufficiently large , uniformly over $1\le t<k$. We also give counterexamples to Borg's conjecture at every intersection scale: for all sufficiently large and for every $1\le d<k$, one may choose and so that a -intersecting family is strictly larger than the canonical star.
Paper Prompts
Sign up for free to create and run prompts on this paper.