7 research outputs found
Prime Hasse principles via Diophantine second moments
We show that almost all primes are sums of three
cubes, assuming a conjecture due to Hooley, Manin, et al. on cubic fourfolds.
This conjecture could be proven under standard number-theoretic hypotheses,
following the author's thesis work.Comment: 19 page
The critical polynomial of a graph
Let be a connected graph on vertices with adjacency matrix .
Associated to is a polynomial of degree in
variables, obtained as the determinant of the matrix ,
where . We investigate in this article the
set of non-negative values taken by this polynomial when . We show that . We
show that for a large class of graphs one also has . When , we show that for
many graphs is dense in . We give
numerical evidence that in many cases, the complement of in might in fact be finite. As a byproduct of our results,
we show that every graph can be endowed with an arithmetical structure whose
associated group is trivial
Sums of cubes and the Ratios Conjectures
Works of Hooley and Heath-Brown imply a near-optimal bound on the number
of integral solutions to in expanding regions,
conditional on automorphy and GRH for certain Hasse--Weil -functions; for
regions of diameter , the bound takes the form (). We attribute the to several
subtly interacting proof factors; we then remove the assuming
some standard number-theoretic hypotheses, mainly featuring the Ratios and
Square-free Sieve Conjectures. In fact, our softest hypotheses imply
conjectures of Hooley and Manin on , and show that almost all integers
are sums of three cubes. Our fullest hypotheses
are capable of proving power-saving asymptotics for , and producing almost
all primes .Comment: 61 pages; updated references; changed title; conceptual improvements;
moved some material elsewher