activity
20182021
most citedPartial Gaussian sums and the Pólya--Vinogradov inequality for primitive characters

1 citations · 3 across the 5 of their papers we have counts for

collaborators

8 papers

math.NT20211 cited

Medium-sized values for the Prime Number Theorem for primes in arithmetic progression

Matteo Bordignon

We give two improved explicit versions of the prime number theorem for primes in arithmetic progression: the first isolating the contribution of the Siegel zero and the second comp…

math.NT2020

Approximated solution of a differential-difference equation arising in number theory and applications to the linear sieve

Matteo Bordignon

We provide elementary and accurate numerical solutions to the differential-difference equation, which improves an explicit version of the linear sieve given by Nathanson.

math.NT20201 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

A Pólya--Vinogradov inequality for short character sums

Matteo Bordignon

In this paper we obtain a variation of the Pólya--Vinogradov inequality with the sum restricted to a certain height. Assume to be a primitive character modulo , and $…

math.NT20201 cited

Partial Gaussian sums and the Pólya--Vinogradov inequality for primitive characters

Matteo Bordignon

In this paper we obtain a new fully explicit constant for the Pólya-Vinogradov inequality for primitive characters. Given a primitive character modulo , we prove the followi…

math.NT2019

An explicit Pólya-Vinogradov inequality via Partial Gaussian sums

Matteo Bordignon, Bryce Kerr

In this paper we obtain a new fully explicit constant for the Pólya-Vinogradov inequality for squarefree modulus. Given a primitive character to squarefree modulus , we prov…