activity
20182022
most citedAn Investigation Into Several Explicit Versions of Burgess' Bound

2 citations · 4 across the 5 of their papers we have counts for

collaborators
Showing 2020Show all

2 papers · 1 filter

math.NT2020★ 1 cited

Explicit Improvements to the Burgess Bound Via Pólya-Vinogradov

Matteo Bordignon, Forrest Francis

We make explicit a theorem of Fromm and Goldmakher [arXiv:1706.03002], which states that one can improve Burgess' bound for short character sums simply by improving the leading con…

math.NT2020

Additive Representations of Natural Numbers

Forrest J. Francis, Ethan S. Lee

Every natural number greater than two may be written as the sum of a prime and a square-free number. We establish several generalisations of this, by placing divisibility condition…