English
Related papers

Related papers: On certain values of Kloosterman sums

200 papers

Let $p\ge 7$, $q=p^m$. $K_q(a)=\sum_{x\in \mathbb{F}_{p^m}} \zeta^{\mathrm{Tr}^m_1(x^{p^m-2}+ax)}$ is the Kloosterman sum of $a$ on $\mathbb{F}_{p^m}$, where $\zeta=e^{\frac{2\pi\sqrt{-1}}{p}}$. The value $1-\frac{2}{\zeta+\zeta^{-1}}$ of…

Information Theory · Computer Science 2013-12-30 Chunming Tang , Yanfeng Qi

For a prime $p$, we consider Kloosterman sums $$ K_{p}(a) = \sum_{x\in \F_p^*} \exp(2 \pi i (x + ax^{-1})/p), \qquad a \in \F_p^*, $$ over a finite field of $p$ elements. It is well known that due to results of Deligne, Katz and Sarnak, the…

Number Theory · Mathematics 2007-05-23 I. E. Shparlinski

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

We bound double sums of Kloosterman sums over a finite field ${\mathbb F}_{q}$, with one or both parameters ranging over an affine space over its prime subfield ${\mathbb F}_p \subseteq {\mathbb F}_{q} $. These are finite fields analogues…

Number Theory · Mathematics 2019-03-26 Simon Macourt , Igor E. Shparlinski

We study the divisibility by 3^k of Kloosterman sums K(a) over finite fields of characteristic 3. We give a new recurrent algorithm for finding the largest k, such that 3^k divides the Kloosterman sum K(a). This gives a new simple test for…

Number Theory · Mathematics 2016-01-27 Leonid Bassalygo , Victor Zinoviev

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

In this note, the polar decomposition of binary fields of even extension degree is used to reduce the evaluation of the Walsh transform of binomial Boolean functions to that of Gauss sums. In the case of extensions of degree four times an…

Number Theory · Mathematics 2016-08-22 Jean-Pierre Flori

Let F be any field. Let p(F) be the characteristic of F if F is not of characteristic zero, and let p(F)=+\infty otherwise. Let A_1,...,A_n be finite nonempty subsets of F, and let $$f(x_1,...,x_n)=a_1x_1^k+...+a_nx_n^k+g(x_1,...,x_n)\in…

Number Theory · Mathematics 2008-04-02 Zhi-Wei Sun

The maximal degree over rational numbers that an n-dimensinonal Kloosterman sum defined over a finite field of characteristic p can achieve is known to be (p-1)/d where d=gcd(p-1,n+1). Wan has shown that this maximal degree is always…

Number Theory · Mathematics 2011-07-04 Keijo Kononen , Marko Rinta-aho , Keijo Väänänen

Using the recent proof of the polynomial Freiman-Ruzsa conjecture over $\mathbb{F}_p^n$ by Gowers, Green, Manners, and Tao, we prove a version of the polynomial Freiman-Ruzsa conjecture over function fields. In particular, we prove that if…

Number Theory · Mathematics 2025-10-09 Thomas F. Bloom

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

We bound Kloosterman-like sums of the shape \[ \sum_{n=1}^N \exp(2\pi i (x \lfloor f(n)\rfloor+ y \lfloor f(n)\rfloor^{-1})/p), \] with integers parts of a real-valued, twice-differentiable function $f$ is satisfying a certain limit…

Number Theory · Mathematics 2023-08-28 Igor E. Shparlinski , Marc Technau

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 obtain a new class of $p$-ary binomial bent functions which are determined by Kloosterman sums. The bentness of another three classes of functions is characterized by some exponential sums and some results in…

Information Theory · Computer Science 2014-04-14 L. Yu , H. Liu , D. Zheng

Freiman's $3k-4$ Theorem states that if a subset $A$ of $k$ integers has a Minkowski sum $A+A$ of size at most $3k-4$, then it must be contained in a short arithmetic progression. We prove a function field analogue that is also a…

Number Theory · Mathematics 2024-10-01 Alain Couvreur , Gilles Zémor

Let K be a field of characteristic p>0, and let q be a power of p. We determine all polynomials f in K[t]\K[t^p] of degree q(q-1)/2 such that the Galois group of f(t)-u over K(u) has a transitive normal subgroup isomorphic to PSL_2(q),…

Algebraic Geometry · Mathematics 2013-10-08 Robert M. Guralnick , Michael E. Zieve

We prove upper bounds for sums of Kloosterman sums against general arithmetic weight functions. In particular, we obtain power cancellation in sums of Kloosterman sums over arithmetic progressions, which is of square-root strength in any…

Number Theory · Mathematics 2020-04-28 Valentin Blomer , Djordje Milićević

We prove, using combinatorics and Kloosterman sum technology that if $A \subset {\Bbb F}_q$, a finite field with $q$ elements, and $q^{{1/2}} \lesssim |A| \lesssim q^{{7/10}}$, then $\max \{|A+A|, |A \cdot A|\} \gtrsim…

Combinatorics · Mathematics 2007-05-23 D. Hart , A. Iosevich , J. Solymosi

Erd\H{o}s proved that $\mathcal{F}(A) := \sum_{a \in A}\frac{1}{a\log a}$ converges for any primitive set of integers $A$ and later conjectured this sum is maximized when $A$ is the set of primes. Banks and Martin further conjectured that…

Number Theory · Mathematics 2020-07-07 Andrés Gómez-Colunga , Charlotte Kavaler , Nathan McNew , Mirilla Zhu

In this paper we give a modular interpretation of the $k$-th symmetric power $L$-function of the Kloosterman family of exponential sums in characteristics 2 and 3, and in the case of $p=2$ and $k$ odd give the precise 2-adic Newton polygon.…

Number Theory · Mathematics 2020-12-02 C. Douglas Haessig
‹ Prev 1 2 3 10 Next ›