27 citations · 112 across the 25 of their papers we have counts for
33 papers
Skolem Meets Bateman-Horn
Florian Luca, James Maynard, Armand Noubissie +2
The Skolem Problem asks to determine whether a given integer linear recurrence sequence has a zero term. This problem arises across a wide range of topics in computer science, incl…
On the largest prime factor of quartic polynomial values: the cyclic and dihedral cases
Cécile Dartyge, James Maynard
Let be an irreducible, monic, quartic polynomial with cyclic or dihedral Galois group. We prove that there exists a constant such that for a positive…
Half-isolated zeros and zero-density estimates
James Maynard, Kyle Pratt
We introduce a new method to detect the zeros of the Riemann zeta function which is sensitive to the vertical distribution of the zeros. This allows us to prove there are few `half…
Simultaneous small fractional parts of polynomials
James Maynard
Let be polynomials of degree at most with . We show that there is an integer such that the fractional parts $\|f_i(…
Metric theory of Weyl sums
Changhao Chen, Bryce Kerr, James Maynard +1
We prove that there exist positive constants and such that for any integer the set of satisfying $$ cN^{1/2}\le \left|\sum^N_{n=1}\exp\le…
A new upper bound for sets with no square differences
Thomas F. Bloom, James Maynard
We show that if has no solutions to with and then \[|A|\ll \frac{N}{(\log N)^{c\log\log \log N}}\] for some absolute consta…