English

Additive Ramsey theory over Piatetski-Shapiro numbers

Number Theory 2026-05-14 v4 Combinatorics

Abstract

We characterise partition regularity for linear equations over the Piatetski-Shapiro numbers nc\lfloor n^c \rfloor when 1<c<c(s)1 < c < c^\dag(s), where s3s \geqslant 3 is the number of variables. Here c(3)=12/11c^\dag(3) = 12/11 and c(4)=7/6c^\dag(4) = 7/6, while c(s)=2c^\dag(s) = 2 for s5s \geqslant 5. We also establish density results with quantitative bounds. Following recent developments, we take this opportunity to update Browning and Prendiville's version of Green's Fourier-analytic transference principle, strengthening its conclusion.

Keywords

Cite

@article{arxiv.2410.14427,
  title  = {Additive Ramsey theory over Piatetski-Shapiro numbers},
  author = {Jonathan Chapman and Sam Chow and Philippa Holdridge},
  journal= {arXiv preprint arXiv:2410.14427},
  year   = {2026}
}

Comments

20 pages; added a new section on updating the transference principle, which is then used to improve the quantitative density bounds in Theorem 1.8