English
Related papers

Related papers: Exponential sums with automatic sequences

200 papers

For $q$ prime, $X \geq 1$ and coprime $u,v \in \mathbb{N}$ we estimate the sums \begin{equation*} \sum_{\substack{p \leq X \substack p \equiv u \hspace{-0.25cm} \mod{v} p \text{ prime}}} \text{Kl}_2(p;q), \end{equation*} where…

Number Theory · Mathematics 2018-06-08 Alexander Dunn , Alexandru Zaharescu

We prove non-trivial bounds for general bilinear forms in hyper-Kloosterman sums when the sizes of both variables may be below the P\'olya-Vinogradov range. We then derive applications to the second moment of holomorphic cusp forms twisted…

Number Theory · Mathematics 2017-04-10 E. Kowalski , Ph. Michel , W. Sawin

We consider a family of character sums as multiplicative analogues of Kloosterman sums. Using Gauss sums, Jacobi sums and Deligne's bound for hyper-Kloosterman sums, we establish asymptotic formulae for any real (positive) moments of the…

Number Theory · Mathematics 2023-01-02 Ping Xi

We prove the Sato--Tate distribution of Kloosterman sums over function fields with explicit error terms, when the places vary in arithmetic progressions or short intervals. A joint Sato--Tate distribution of two ``different" exponential…

Number Theory · Mathematics 2025-11-25 Lei Fu , Yuk-Kam Lau , Wen-Ching Winnie Li , Ping Xi

We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are ultimately periodic. Using methods from ergodic theory, we are able to partially resolve this…

Number Theory · Mathematics 2020-04-01 Jakub Byszewski , Jakub Konieczny

We revisit a technique of S. Lehr on automata and use it to prove old and new results in a simple way. We give a very simple proof of the 1986 theorem of Honkala that it is decidable whether a given k-automatic sequence is ultimately…

Discrete Mathematics · Computer Science 2009-04-12 Jean-Paul Allouche , Narad Rampersad , Jeffrey Shallit

We prove non-trivial bounds for bilinear forms with hyper-Kloosterman sums with characters modulo a prime $q$ which, for both variables of length $M$, are non-trivial as soon as $M\geq q^{3/8+\delta}$ for any $\delta>0$. This range, which…

Number Theory · Mathematics 2025-12-16 E. Kowalski , Ph. Michel , W. Sawin

We consider the distribution of the polygonal paths joining partial sums of classical Kloosterman sums, as their parameter varies modulo a prime tending to infinity. Using independence of Kloosterman sheaves, we prove convergence in the…

Number Theory · Mathematics 2019-02-20 Emmanuel Kowalski , William F. Sawin

A formula of Kuznetsov allows one to interpret a smooth sum of Kloosterman sums as a sum over the spectrum of $GL(2)$ automorphic forms. In this paper, we construct a similar formula for the first hyper-Kloosterman sums using $GL(3)$…

Number Theory · Mathematics 2022-05-31 Jack Buttcane

We obtain a new estimate for Kloosterman sum with primes $p\leqslant X$ to composite modulo $q$, that is, for the exponential sum of the type \[ \sum\limits_{p\leqslant X,\;p\,\nmid q}\exp{\biggl(\frac{2\pi…

Number Theory · Mathematics 2019-11-25 M. A. Korolev

We prove non-trivial upper bounds for general bilinear forms with trace functions of bountiful sheaves, where the supports of two variables can be arbitrary subsets in $\mathbf{F}_p$ of suitable sizes. This essentially recovers the…

Number Theory · Mathematics 2023-06-30 Ping Xi

We extend some methods of bounding exponential sums of the type $\displaystyle\sum_{n\le N}e^{2\pi iag^n/p}$ to deal with the case when $g$ is not necessarily a primitive root. We also show some recent results of Shkredov concerning…

Number Theory · Mathematics 2013-02-19 Bryce Kerr

Let $t:\mathbb{F}_{p}\rightarrow\mathbb{C}$ be a complex valued function on $\mathbb{F}_{p}$. A classical problem in analytic number theory is to bound the maximum of the absolute value of the incomplete sum \[ M(t):=\max_{0\leq…

Number Theory · Mathematics 2021-07-01 Dante Bonolis

We show that sequences of positive integers whose ratios $a_n^2/a_{n+1}$ lie within a specific range are almost uniquely determined by their reciprocal sums. For instance, the Sylvester sequence is uniquely characterized as the only…

Number Theory · Mathematics 2025-04-09 Junnosuke Koizumi

We study the notion of an asymptotically automatic sequence, which generalises the notion of an automatic sequence. While $k$-automatic sequences are characterised by finiteness of $k$-kernels, the $k$-kernels of asymptotically…

Number Theory · Mathematics 2024-04-12 Jakub Konieczny

We propose a conjecture for exponential sums which generalizes both a conjecture by Igusa and a local variant by Denef and Sperber, in particular, it is without the homogeneity condition on the polynomial in the phase, and with new…

Number Theory · Mathematics 2014-06-04 Raf Cluckers , Willem Veys

An arithmetic function $f$ is called a sieve function of range $Q$, if it is the convolution product of the constantly $1$ function and $g$ such that $g(q)\ll_{\varepsilon} q^{\varepsilon}$, $\forall\varepsilon>0$, for $q\leq Q$, and…

Number Theory · Mathematics 2016-09-02 Giovanni Coppola , Maurizio Laporta

For a natural extension of the circular unitary ensemble of order n, we study as n tends to infinity, the asymptotic behavior of the sequence of orthogonal polynomials with respect to the spectral measure. The last term of this sequence is…

Probability · Mathematics 2013-02-27 Joseph Najnudel , Ashkan Nikeghbali , Alain Rouault

We show that any automatic sequence can be separated into a structured part and a Gowers uniform part in a way that is considerably more efficient than guaranteed by the Arithmetic Regularity Lemma. For sequences produced by strongly…

Number Theory · Mathematics 2023-05-25 Jakub Byszewski , Jakub Konieczny , Clemens Müllner

We prove new bounds on bilinear forms with Kloosterman sums, complementing and improving a series of results by \'E. Fouvry, E. Kowalski and Ph. Michel (2014), V. Blomer, \'E. Fouvry, E. Kowalski, Ph. Michel and D. Mili\'cevi\'c (2017), E.…

Number Theory · Mathematics 2023-04-18 Bryce Kerr , Igor E. Shparlinski , Xiaosheng Wu , Ping Xi