50 citations · 176 across the 26 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.NT2015
Square-free values of reducible polynomials
Andrew Booker, Tim Browning
We calculate admissible values of r such that a square-free polynomial with integer coefficients, no fixed prime divisor and irreducible factors of degree at most 3 takes infinitel…
math.NT2015
The Selberg trace formula as a Dirichlet series
Andrew R. Booker, Min Lee
We explore an idea of Conrey and Li of expressing the Selberg trace formula as a Dirichlet series. We describe two applications, including an interpretation of the Selberg eigenval…
math.NT2015★ 2 cited
The Euclid-Mullin graph
Andrew R. Booker, Sean A. Irvine
We introduce the Euclid-Mullin graph, which encodes all instances of Euclid's proof of the infinitude of primes. We investigate structural properties of the graph both theoreticall…