English

Inhomogeneous Approximation by Sums of Roots

Number Theory 2026-05-27 v1 Combinatorics

Abstract

Let d2d\geq 2 and k1k\geq 1 be fixed. We prove that, for every ϵ>0\epsilon>0 and every real β\beta, there exist integers 1b1,,bkN1\leq b_1,\ldots,b_k\leq N such that j=1kbj1/dβd,k,ϵNk/d+ϵ. \left\|\sum_{j=1}^k b_j^{1/d}-\beta\right\| \ll_{d,k,\epsilon} N^{-k/d+\epsilon}. The proof combines Schmidt's Subspace Theorem with an explicit inhomogeneous transference argument. This improves Iyer's (2025) higher-root exponent (kd+1)/d2(k-d+1)/d^2, and also the analogous dd-ary full-basis exponent away from the cases where k+1k+1 is a power of dd, at the cost of ineffectivity. We also record a conjectural uniform exponent k1/dk-1/d. In the square-root case d=2d=2, we give explicit integer-target constructions for k=2,3,4k=2,3,4 attaining this conjectural value.

Keywords

Cite

@article{arxiv.2605.27233,
  title  = {Inhomogeneous Approximation by Sums of Roots},
  author = {Samuel Korsky},
  journal= {arXiv preprint arXiv:2605.27233},
  year   = {2026}
}