English
Related papers

Related papers: Modular hyperbolas and bilinear forms of Kloosterm…

200 papers

We prove a non-trivial bound for $\operatorname{Sp}(2n)$ Kloosterman sums of moduli not equal to a prime multiple of the identity. These sums are attached to Siegel modular forms on the group $\operatorname{Sp}(2n)$ and appear in the…

Number Theory · Mathematics 2025-12-19 Gilles Felber

We prove a bound for quintilinear sums of Kloosterman sums, with congruence conditions on the "smooth" summation variables. This generalizes classical work of Deshouillers and Iwaniec, and is key to obtaining power-saving error terms in…

Number Theory · Mathematics 2017-06-19 Sary Drappeau

We study p-adic hyper-Kloosterman sums, a generalization of the Kloosterman sum with a parameter k that recovers the classical Kloosterman sum when k=2, over general p-adic rings and even equal characteristic local rings. These can be…

Number Theory · Mathematics 2023-06-01 Will Sawin

Let f be a polinomial with coefficients in a finite field F. Let $\Psi : F \to C^{\ast}$ be a non-trivial additive character. In this paper we give bounds for the exponential sums $\sum_{x\in F^n} \Psi (Tr_{F/F_p} (f(x)))$ in some cases…

alg-geom · Mathematics 2008-02-03 Ricardo Garcia Lopez

Let $p$ be an odd prime. Using I. M. Vinogradov's bilinear estimate, we present an elementary approach to estimate nontrivially the character sum $$ \sum_{x\in H}\chi(x+a),\qquad a\in\Bbb F_p^*, $$ where $H<\Bbb F_p^*$ is a multiplicative…

Number Theory · Mathematics 2014-01-21 Ke Gong

We investigate the solubility of the congruence xy=1 (mod p), where p is a prime and x,y are restricted to lie in suitable short intervals. Our work relies on a mean value theorem for incomplete Kloosterman sums.

Number Theory · Mathematics 2012-05-01 Tim Browning , Alan Haynes

We obtain statistical results on the possible distribution of all partial sums of a Kloosterman sum modulo a prime, by computing explicitly the support of the limiting random Fourier series of our earlier functional limit theorem for…

Number Theory · Mathematics 2017-09-18 E. Kowalski , W. Sawin

We give optimal bounds for matrix Kloosterman sums modulo prime powers extending earlier work of the first two authors on the case of prime moduli. These exponential sums arise in the theory of the horocyclic flow on $\mathrm{GL}_n$.

Number Theory · Mathematics 2024-01-26 Márton Erdélyi , Árpád Tóth , Gergely Zábrádi

We demonstrate and develop dyadic-probabilistic methods in connection with non-homogeneous bilinear operators, namely singular integrals and square functions. We develop the full non-homogeneous theory of bilinear singular integrals using a…

Classical Analysis and ODEs · Mathematics 2018-10-19 Henri Martikainen , Emil Vuorinen

Recently there has been a large number of works on bilinear sums with Kloosterman sums and on sums of Kloosterman sums twisted by arithmetic functions. Motivated by these, we consider several related new questions about sums of Kloosterman…

Number Theory · Mathematics 2024-11-20 Xuancheng Shao , Igor E. Shparlinski , Laurence P. Wijaya

We develop a version of the Kloosterman circle method with a bump function that is used to provide asymptotics for weighted representation numbers of nonsingular integral quadratic forms. Unlike many applications of the Kloosterman circle…

Number Theory · Mathematics 2025-08-28 Edna Jones

We investigate the asymptotic distribution of integrals of the $j$-function that are associated to ideal classes in a real quadratic field. To estimate the error term in our asymptotic formula, we prove a bound for sums of Kloosterman sums…

Number Theory · Mathematics 2024-10-18 Nickolas Andersen , William Duke

We return to some past studies of hyperkloosterman sums ([9,10]) via $p$-adic cohomology with an aim to improve earlier results. In particular, we work here with Dwork's $\theta_\infty$-splitting function and a better choice of basis for…

Number Theory · Mathematics 2019-11-26 Alan Adolphson , Steven Sperber

Let $\F_q$ ($q=p^r$) be a finite field. In this paper the number of irreducible polynomials of degree $m$ in $\F_q[x]$ with prescribed trace and norm coefficients is calculated in certain special cases and a general bound for that number is…

Number Theory · Mathematics 2015-05-13 Marko Moisio

In a recent work by Charpin, Helleseth, and Zinoviev Kloosterman sums $K(a)$ over a finite field $\F_{2^m}$ were evaluated modulo 24 in the case $m$ odd, and the number of those $a$ giving the same value for $K(a)$ modulo 24 was given. In…

Combinatorics · Mathematics 2008-02-16 Marko Moisio

In this paper, we construct two binary linear codes associated with multi-dimensional and $m -$multiple power Kloosterman sums (for any fixed $m$) over the finite field $\mathbb{F}_{q}$. Here $q$ is a power of two. The former codes are dual…

Number Theory · Mathematics 2009-09-08 Dae San Kim

We prove two results on Kloosterman sums over finite fields, using Stickelberger's theorem and the Gross-Koblitz formula. The first result concerns the minimal polynomial over Q of a Kloosterman sum, and the second result gives a…

Number Theory · Mathematics 2010-12-07 Faruk Gologlu , Gary McGuire , Richard Moloney

Let $f$ be a newform of prime level $p$ with any central character $\chi\, (\bmod\, p)$, and let $g$ be a fixed cusp form or Eisenstein series for $\hbox{SL}_{2}(\mathbb{Z})$. We prove the subconvexity bound: for any $\varepsilon>0$,…

Number Theory · Mathematics 2024-12-18 Keshav Aggarwal , Sumit Kumar , Chung-Hang Kwan , Wing Hong Leung , Junxian Li , Matthew P. Young

We introduce an algebra model to study higher order sum rules for orthogonal polynomials on the unit circle. We build the relation between the algebra model and sum rules, and prove an equivalent expression on the algebra side for the sum…

Spectral Theory · Mathematics 2017-08-24 Jun Yan

We give new improvements to the Chudnovsky-Chudnovsky method that provides upper bounds on the bilinear complexity of multiplication in extensions of finite fields through interpolation on algebraic curves. Our approach features three…

Computational Complexity · Computer Science 2012-03-19 Hugues Randriambololona