Searcharxiv⌕ Search

arXiv subjects

Matteo Bordignon

Publications and source records attributed to Matteo Bordignon.

17 recordsLinked to original sources
arXiv2026

Area correlations related to lattice points in discs

Motivated by the Lester-Wigman vanishing area correlation conjecture for lattice points near the boundary of circles of growing radius, we investigate the dynamics of circle flows on tori (which are related to the motion of a charged particle in a magnetic field on a torus.) We show that an analogue of the vanishing correlation conjecture holds in this setting, i.e., we have "mixing for the area observable" despite the flow being essentially integrable. We also determine the probability density function of the areas, in global as well as local regimes.

math.NT↗
arXiv2026

The Limiting Distribution of Elliptic Dedekind Sums

We consider elliptic Dedekind sums that were introduced by Sczech as generalizations of the classical ones to complex lattices. We prove that these sums -- suitably normalized -- have a Gaussian limiting distribution. As an application, we prove a conjecture due to Ito.

math.NT↗
arXiv2025

On products of sets of natural density one

In a previous work, Bettin, Koukoulopoulos, and Sanna prove that if two sets of natural numbers $A$ and $B$ have natural density $1$, then their product set $A \cdot B := \{ab : a \in A, b \in B\}$ also has natural density $1$. They also provide an effective rate and pose the question of determining the optimal rate. We make progress on this question by constructing a set $A$ of density 1 such that $A\cdot A$ has a ''large'' complement.

math.NT↗
arXiv2024

Coprime-Universal Quadratic Forms

Given a prime $p>3$, we characterize positive-definite integral quadratic forms that are coprime-universal for $p$, i.e. representing all positive integers coprime to $p$. This generalizes the $290$-Theorem by Bhargava and Hanke and extends later works by Rouse ($p=2$) and De Benedetto and Rouse ($p=3$). When $p=5,23,29,31$, our results are conditional on the coprime-universality of specific ternary forms. We prove this assumption under GRH (for Dirichlet and modular $L$-functions), following a strategy introduced by Ono and Soundararajan, together with some more elementary techniques borrowed from Kaplansky and Bhargava. Finally, we discuss briefly the problem of representing all integers in an arithmetic progression.

math.NT↗
arXiv2023

Weyl sums with multiplicative coefficients and joint equidistribution

In this paper we generalize a result of Montgomery and Vaughan regarding exponential sums with multiplicative coefcients to the setting of Weyl sums. As applications, we establish a joint equidistribution result for roots of polynomial congruences and polynomial values and obtain some new results for mixed character sums.

math.NT↗
arXiv2023

A note on medium and short character sums

Following the work of Hildebrand we improve the Po'lya- Vinogradov inequality in a specific range, we also give a general result that shows its dependency on Burgess bound and at last we improve the range of validity for a special case of Burgess' character sum estimate.

math.NT↗
arXiv2022

Explicit upper bounds for the number of primes simultaneously representable by any set of irreducible polynomials

Using an explicit version of Selberg's upper sieve, we obtain explicit upper bounds for the number of $n\leq x$ such that a non-empty set of irreducible polynomials $F_i(n)$ with integer coefficients are simultaneously prime; this set can contain as many polynomials as desired. To demonstrate, we present computations for some irreducible polynomials and obtain an explicit upper bound for the number of Sophie Germain primes up to $x$, which have practical applications in cryptography.

math.NT↗
arXiv2021

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

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 $q$, $ε> 0$ and $N\le q^{1-γ}$, with $0\le γ\le 1/3$. We prove that \begin{equation*} \left|\sum_{n=1}^N χ(n) \right|\le c(\frac{1}{3}-γ+ε)\sqrt{q}\log q \end{equation*} with $c=2/π^2+o(1)$ if $χ$ is even and $c=1/π+o(1)$ if $χ$ is odd.

math.NT↗
arXiv2021

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

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 completely explicit, where the improvement is for medium-sized values. This will give an improved explicit Bombieri-Vinogradov like result for non-exceptional moduli.

math.NT↗
arXiv2020

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

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 constant in the Pólya-Vinogradov inequality. Towards achieving this, we establish explicit versions of several estimates related to the mean values of real multiplicative functions and the Dickman function.

math.NT↗
arXiv2020

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

In this paper we obtain a new fully explicit constant for the Pólya-Vinogradov inequality for primitive characters. Given a primitive character $χ$ modulo $q$, we prove the following upper bound \begin{align*} \left| \sum_{1 \le n\le N} χ(n) \right|\le c \sqrt{q} \log q, \end{align*} where $c=3/(4π^2)+o_q(1)$ for even characters and $c=3/(8π)+o_q(1)$ for odd characters, with explicit $o_q(1)$ terms. This improves a result of Frolenkov and Soundararajan for large $q$. We proceed, following Hildebrand, obtaining the explicit version of a result by Montgomery--Vaughan on partial Gaussian sums and an explicit Burgess-like result on convoluted Dirichlet characters.

math.NT↗
arXiv2019

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

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 $q$, we prove the following upper bound \begin{align*} \left| \sum_{1 \le n\le N} χ(n) \right|\le c \sqrt{q} \log q, \end{align*} where $c=1/(2π^2)+o(1)$ for even characters and $c=1/(4π)+o(1)$ for odd characters, with an explicit $o(1)$ term. This improves a result of Frolenkov and Soundararajan for large $q$. We proceed via partial Gaussian sums rather than the usual Montgomery and Vaughan approach of exponential sums with multiplicative coefficients. This allows a power saving on the minor arcs rather than a factor of $\log{q}$ as in previous approaches and is an important factor for fully explicit bounds.

math.NT↗
arXiv2019

Explicit bounds on exceptional zeroes of Dirichlet L-function II

This paper improves the upper bound for the exceptional zeroes of Dirichlet L-functions with even characters. The result is obtained by improving on explicit estimate for $L'(σ;χ)$ for $σ$ close to unity, using a result on the average of Dirichlet characters, and on the lower bound for $L(1;χ)$, with computational aid.

math.NT↗