English

Paucity phenomena for polynomial products

Number Theory 2024-08-19 v2 Probability

Abstract

Let P(x)Z[x]P(x)\in \mathbb{Z}[x] be a polynomial with at least two distinct complex roots. We prove that the number of solutions (x1,,xk,y1,,yk)[N]2k(x_1, \dots, x_k, y_1, \dots, y_k)\in [N]^{2k} to the equation 1ikP(xi)=1jkP(yj)0 \prod_{1\le i \le k} P(x_i) = \prod_{1\le j \le k} P(y_j)\neq 0 (for any k1k\ge 1) is asymptotically k!Nkk!N^{k} as N+N\to +\infty. This solves a question first proposed and studied by Najnudel. The result can also be interpreted as saying that all even moments of random partial sums 1NnNf(P(n))\frac{1}{\sqrt{N}}\sum_{n\le N}f(P(n)) match standard complex Gaussian moments as N+N\to +\infty, where ff is the Steinhaus random multiplicative function.

Keywords

Cite

@article{arxiv.2211.02908,
  title  = {Paucity phenomena for polynomial products},
  author = {Victor Y. Wang and Max Wenqiang Xu},
  journal= {arXiv preprint arXiv:2211.02908},
  year   = {2024}
}

Comments

8 pages; minor corrections; accepted version

R2 v1 2026-06-28T05:15:02.110Z