On Generalizations of a Conjecture of Kang and Park

Abstract

Let d(a,-)(n) = qd(a)(n) - Qd(a,-)(n) where qd(a)(n) counts the number of partitions of n into parts with difference at least d and size at least a, and Qd(a,-)(n) counts the number of partitions into parts a d + 3 excluding the d+3-a part. Motivated by generalizing a conjecture of Kang and Park, Duncan, Khunger, Swisher, and the second author conjectured that d(3,-)(n)≥ 0 for all d≥ 1 and n≥ 1 and were able to prove this when d ≥ 31 is divisible by 3. They were also able to conjecture an analog for higher values of a that the modified difference function d(a,-,-)(n) = qd(a)(n) - Qd(a,-,-)(n) ≥ 0 where Qd(a,-,-)(n) counts the number of partitions into parts a d + 3 excluding the a and d+3-a parts and proved it for infinitely many classes of n and d. We prove that d(3,-)(n) ≥ 0 for all but finitely many d. We also provide a proof of the generalized conjecture for all but finitely many d for fixed a and strengthen the results of Duncan, Khunger, Swisher, and the second author. We provide a conditional proof of a linear lower bound on d for the generalized conjecture, which improves our unconditional result based on a conjectural modification of a recently proven conjecture of Alder. Using this modification, we obtain a strengthening of this generalization of Kang and Park's conjecture which remarkably allows a as a part. Additionally, we provide asymptotic evidence that this strengthened conjecture holds.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…