arXiv Analytics

Sign in

arXiv:1909.13549 [math.NT]AbstractReferencesReviewsResources

Partitions into polynomial with the number of parts in arithmetic progression

Nian Hong Zhou

Published 2019-09-30Version 1

Let $k, a\in \mathbb{N}$ and let $f(x)\in\mathbb{Q}[x]$ be a polynomial with degree ${\rm deg}(f)\ge 1$ such that all elements of the sequence $\{f(n)\}_{n\in\mathbb{N}}$ lies on $ \mathbb{N}$ and $\gcd(\{f(n)\}_{n\in\mathbb{N}})=1$. Let $p_f(n)$ and $p_f(a,k;n)$ denotes the number of partitions of integer $n$ whose parts taken from the sequence $\{f(n)\}_{n\in\mathbb{N}}$ and the number of parts of those partitions are congruent to $a$ modulo $k$, respectively. We prove that there exist a constant $\delta_{f}\in\mathbb{R}_+$ depending only on $f$ such that $$p_f(a,k;n)=\frac{p_f(n)}{k}\left[1+O\left(n\exp\left(-\delta_{f}k^{-2}n^{\frac{1}{1+{\rm deg}(f)}}\right)\right)\right],$$ holds uniformly for all $a,k, n\in\mathbb{N}$ with $k^{2+2{\rm deg}(f)}\ll n$, as $n$ tends to infinity.

Comments: 12 pages
Categories: math.NT, math.CO
Subjects: 11P82, 11P83, 05A17, 11L07
Related articles: Most relevant | Search more
arXiv:2004.09505 [math.NT] (Published 2020-04-20)
A Complete Solution of the Partitions of a Number into Arithmetic Progressions
arXiv:1111.3507 [math.NT] (Published 2011-11-15)
Three-factor decompositions of $\mathbb{U}_n$ with the three generators in arithmetic progression
arXiv:1103.6000 [math.NT] (Published 2011-03-30, updated 2013-02-25)
Arithmetic progressions in sumsets and L^p-almost-periodicity