On Generalizations of a Conjecture of Kang and Park
Ryota Inagaki, Ryan Tamura

TL;DR
This paper proves a broad generalization of a partition difference conjecture, establishing non-negativity for almost all parameters and providing asymptotic evidence for the full conjecture's validity.
Contribution
It extends previous conjectures by proving non-negativity of the difference functions for almost all parameters and introduces a strengthened conjecture including parts, supported by asymptotic evidence.
Findings
Proved the conjecture for all but finitely many $d$ when $a=3$.
Established a conditional linear lower bound on $d$ for the generalized conjecture.
Provided asymptotic evidence supporting the strengthened conjecture.
Abstract
Let where counts the number of partitions of into parts with difference at least and size at least , and counts the number of partitions into parts excluding the part. Motivated by generalizing a conjecture of Kang and Park, Duncan, Khunger, Swisher, and the second author conjectured that for all and and were able to prove this when is divisible by . They were also able to conjecture an analog for higher values of that the modified difference function where counts the number of partitions into parts excluding the and parts and proved it for infinitely many…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Limits and Structures in Graph Theory · Analytic Number Theory Research
