Note on partitions into polynomials with number of parts in an arithmetic progression
Nian Hong Zhou

TL;DR
This paper investigates the distribution of partitions of integers into parts from polynomial-generated sequences and their relation to arithmetic progressions, revealing equidistribution properties under specific conditions.
Contribution
It establishes new equidistribution results connecting partitions with polynomial parts to those with parts in arithmetic progressions, under certain divisibility conditions.
Findings
Proves equidistribution between polynomial-based partitions and arithmetic progression partitions.
Identifies conditions on the polynomial ensuring the distribution properties.
Provides theoretical framework for understanding partitions with polynomial and arithmetic progression parts.
Abstract
Let be a polynomial with the property that corresponding to every prime there exists an integer such that . In this paper, we establish some equidistributed results between the number of partitions of an integer whose parts are taken from the sequence and the number of parts of those partitions which are in a certain arithmetic progression.
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.
