English

Smooth numbers are orthogonal to nilsequences

Number Theory 2025-09-10 v2

Abstract

The aim of this paper is to study distributional properties of integers without large or small prime factors. Define an integer to be [y,y][y',y]-smooth if all of its prime factors belong to the interval [y,y][y',y]. We identify suitable weights g[y,y](n)g_{[y',y]}(n) for the characteristic function of [y,y][y',y]-smooth numbers that allow us to establish strong asymptotic results on their distribution in short arithmetic progressions. Building on these equidistribution properties, we show that (a WW-tricked version of) the function g[y,y](n)1g_{[y',y]}(n) - 1 is orthogonal to nilsequences. Our results apply in the almost optimal range (logN)K<yN(\log N)^{K} < y \leq N of the smoothness parameter yy, where K2K \geq 2 is sufficiently large, and to any y<min(y,(logN)c)y' < \min(\sqrt{y}, (\log N)^c). As a first application, we establish for any y>N1/log9Ny> N^{1/\sqrt{\log_9 N}} asymptotic results on the frequency with which an arbitrary finite complexity system of shifted linear forms ψj(n)+ajZ[n1,,ns]\psi_j (\mathbf{n}) + a_j \in \mathbb{Z}[n_1, \dots, n_s], 1jr1 \leq j \leq r, simultaneously takes [y,y][y',y]-smooth values as the nin_i vary over integers below NN.

Keywords

Cite

@article{arxiv.2211.16892,
  title  = {Smooth numbers are orthogonal to nilsequences},
  author = {Lilian Matthiesen and Mengdi Wang},
  journal= {arXiv preprint arXiv:2211.16892},
  year   = {2025}
}

Comments

71 pages

R2 v1 2026-06-28T07:17:59.555Z