Monochromatic sums of squares
For any integer \(k\geq 1\), a colouring in \(k\) colours of the set \(D\) of the squares of the integers is a partition of \(D\) into \(k\) disjoint subsets. For any \(k\geq 1\) let \(s(k)\) be the smallest integer such that given any colouring of \(D\) in \(k\) colours, every sufficiently large integer is expressible as a sum of at most \(s(k)\) squares, all of the same colour. In the paper under review, the authors prove for \(k\geq 2\) that \[ s(k)\leq k\,e^{\frac{(3+\log 2+o(1))\log k}{\log\log k}}, \] where in the above approximation \(o(1)\ll\frac{\log\log\log k}{\log\log k}\) for all large enough \(k\). To prove the above result, the authors use circle method to demonstrate an upper bound for \(E_6(S)\), where for any subset \(S\) of the integers and any integer \(m\geq 1\) they write \(E_m(S)\) for the number of tuples \((x_1, x_2, \dots , x_{2m})\in S^{2m}\) satisfying \(x_1+x_2+\cdots+x_m=x_{m+1}+x_{m+2}+\cdots+x_{2m}\).
- A chromatic version of Lagrange's four squares theorem
- A Transference Approach to a Roth-Type Theorem in the Squares
- Additive energy of dense sets of primes and monochromatic sums
- Additive properties of dense subsets of sifted sequences
- Approximate formulas for some functions of prime numbers
- Concentration of measure for the analysis of randomized algorithms.
- Equations over finite fields. An elementary approach
- scientific article; zbMATH DE number 699709 (Why is no real title available?)
- On monochromatic sums of squares and primes
- Optimal representations by sumsets and subset sums
- Unsolved problems in number theory
This page was built for publication: Monochromatic sums of squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1650168)
