7 citations · 7 across the 8 of their papers we have counts for
10 papers
The error term in counting prime pairs
Leon Chou, Summer Haag, Jake Huryn +1
We relate the size of the error term in the Hardy-Littlewood conjectured formula for the number of prime pairs to the norm of an exponential sum over the primes formed with…
The complex zeros of random orthogonal polynomials
Christopher Corley, Andrew Ledoan, Aaron Yeager
We utilize Cauchy's argument principle in combination with the Jacobian of a holomorphic function in several complex variables and the first moment of a ratio of two correlated com…
The level crossings of random sums
Christopher Corley, Andrew Ledoan
Let be a sequence of independent and identically distributed complex normal random variables with mean zero and variances . Let $…
The density of complex zeros of random sums
Christopher Corley, Andrew Ledoan
Let be a sequence of independent, identically distributed random complex Gaussian variables, and let be a sequence of given anal…
Linnik's large sieve and the norm of exponential sums
Emily Eckels, Steven Jin, Andrew Ledoan +1
The method of proof of Balog and Ruzsa and the large sieve of Linnik are used to investigate the behaviour of the norm of a wide class of exponential sums over the square-f…
Distribution of Large Gaps Between Primes
Scott Funkhouser, Daniel A. Goldston, Andrew H. Ledoan
We survey some past conditional results on the distribution of large differences between consecutive primes and examine how the Hardy-Littlewood prime k-tuples conjecture can be ap…