Results 101 to 110 of about 7,921 (138)
Some of the next articles are maybe not open access.

Reducing character sums to Kloosterman sums

Mathematical Notes, 2010
In this paper the authors apply a bound for very short Kloosterman type sums to deduce a bound for a mean-value of short sums of Dirichlet characters. For details, define \[ S^*=\mathop{{\sum}^*}_{\chi (\bmod \;q )}\chi(n)\overline{\chi}(m) \left(\sum_{u}\alpha_u\chi(u)\right)\left(\sum_{v}\beta_v\chi(v)\right)\left|L_f(\chi)\right|^2, \] where the ...
Friedlander, J. B., Iwaniec, H.
openaire   +2 more sources

Kloosterman double sums

Mathematical Notes, 1999
The paper investigates Kloosterman double sums with weights of type \[ W(a,b)=\sum_{\substack{ X < x \leq X_1\\ (x,m)=1}} \sum_{\substack{ Y < y \leq Y_1\\ (y,m)=1}} \xi(x) \eta(y) \exp \left (\frac{2 \pi i}{m} (a x^* y^* + b x y) \right). \] Here \(\xi(x)\), \(\eta(y)\) are complex-valued functions, \(0 < X < X_1 \leq 2X\), \(0 < Y < Y_1 \leq 2Y\) and
openaire   +2 more sources

On Kloosterman's sum

Mathematika, 1961
Let m, n, q denote positive integers, p a prime, and a, b, h, r, s, t, u, v integers.
openaire   +1 more source

Symplectic Kloosterman sums

Studia Scientiarum Mathematicarum Hungarica, 2013
We give optimal bounds for Kloosterman sums that arise in the estimation of Fourier coefficients of Siegel modular forms of genus 2.
openaire   +1 more source

Methods of Estimating Short Kloosterman Sums

Doklady Mathematics, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On the General Kloosterman Sums

Journal of Mathematical Sciences, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Short Kloosterman Sums with Primes

Mathematical Notes, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Polynomials for Kloosterman Sums

Canadian Mathematical Bulletin, 2007
AbstractFix an integer m > 1, and set ζm = exp(2πi/m). Let denote the multiplicative inverse of x modulo m. The Kloosterman sums , satisfy the polynomialwhere the sum and product are taken over a complete system of reduced residues modulo m. Here we give a natural factorization of fm(x), namely,where σ runs through the square classes of the group ...
openaire   +1 more source

On classical Kloosterman sums

Cryptography and Communications, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

On Kloosterman Sums with Oscillating Coefficients

Canadian Mathematical Bulletin, 1999
AbstractIn this paper we prove: for any positive integers a and q with (a, q) = 1, we have uniformlyThis improves the previous bound obtained by D. Hajela, A. Pollington and B. Smith [5].
openaire   +2 more sources

Home - About - Disclaimer - Privacy