Intersecting integer partitions: star bounds and counterexamples at every scale
Yury Person, Thomas Schweser
Abstract
Two integer partitions t-intersect if they have at least t common parts, counted with multiplicity. We study the largest t-intersecting families of integer partitions of n into exactly k positive parts. The canonical t-star consists of the partitions containing at least t ones. Applying Kupavskii's weak-spread theorem, we prove that this star is largest whenever n Ak3, for every fixed A>24 and all sufficiently large k, uniformly over 1 t<k. We also give counterexamples to Borg's conjecture at every intersection scale: for all sufficiently large k and for every 1 d<k, one may choose d/4 t d and n= tk2/3 so that a t-intersecting family is strictly larger than the canonical star.
Create a lesson
Related papers
Generic solutions to symmetric linear equations
Bryce Frederickson, Liana Yepremyan
On Colorful Kruskal--Katona Theorems
Ting-Wei Chao, Maya Sankar, Hung-Hsun Hans Yu
An optimal constant for vector balancing with permutations
Jonathan Niles-Weed, Shay Sadovsky, Jacob Shkrob
Typical intersecting families at n=2k+1 and n=2k+2
Lina Li
Linear arboricity conjecture for infinite graphs
Leandro Aurichi, Rodrigo Santos Monteiro, Caio Fernando Rodrigues
Linear circumference in vertex-transitive graphs
Jie Ma, Ziyuan Zhao