We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We study density and partition properties of polynomial equations in prime variables. We consider equations of the form $a_1h(x_1) + \cdots + a_sh(x_s)=b$, where the ai and b are fixed coefficients and h is an arbitrary integer polynomial of degree d. We establish that the natural necessary conditions for this equation to have a monochromatic non-constant solution with respect to any finite colouring of the prime numbers are also sufficient when the equation has at least $(1+o(1))d^2$ variables. We similarly characterize when such equations admit solutions over any set of primes with positive relative upper density. In both cases, we obtain lower bounds for the number of monochromatic or dense solutions in primes that are of the correct order of magnitude. Our main new ingredient is a uniform lower bound on the cardinality of a prime polynomial Bohr set.
We generalise and improve some recent bounds for additive energies of modular roots. Our arguments use a variety of techniques, including those from additive combinatorics, algebraic number theory and the geometry of numbers. We give applications of these results to new bounds on correlations between Salié sums and to a new equidistribution estimate for the set of modular roots of primes.
Given $d\in \mathbb{N}$, we establish sum-product estimates for finite, nonempty subsets of $\mathbb{R}^{d}$. This is equivalent to a sum-product result for sets of diagonal matrices. In particular, let $A$ be a finite, nonempty set of $d\times d$ diagonal matrices with real entries. Then, for all $\unicode[STIX]{x1D6FF}_{1}<1/3+5/5277$,
which strengthens a result of Chang [‘Additive and multiplicative structure in matrix spaces’, Combin. Probab. Comput.16(2) (2007), 219–238] in this setting.
Approximate groups have shot to prominence in recent years, driven both by rapid progress in the field itself and by a varied and expanding range of applications. This text collects, for the first time in book form, the main concepts and techniques into a single, self-contained introduction. The author presents a number of recent developments in the field, including an exposition of his recent result classifying nilpotent approximate groups. The book also features a considerable amount of previously unpublished material, as well as numerous exercises and motivating examples. It closes with a substantial chapter on applications, including an exposition of Breuillard, Green and Tao's celebrated approximate-group proof of Gromov's theorem on groups of polynomial growth. Written by an author who is at the forefront of both researching and teaching this topic, this text will be useful to advanced students and to researchers working in approximate groups and related areas.
Green and Tao famously proved in 2005 that any subset of the primes of fixed positive density contains arbitrarily long arithmetic progressions. Green had previously shown that, in fact, any subset of the primes of relative density tending to zero sufficiently slowly contains a three-term progression. This was followed by work of Helfgott and de Roton, and Naslund, who improved the bounds on the relative density in the case of three-term progressions. The aim of this note is to present an analogous result for longer progressions by combining a quantified version of the relative Szemerédi theorem given by Conlon, Fox and Zhao with Henriot's estimates of the enveloping sieve weights.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.