Related papers: Partial Gaussian sums in finite fields

This is a survey of old and new problems and results in additive number theory.

In recent years, there has been a lot of progress in obtaining non-trivial bounds for bilinear forms of Kloosterman sums in $\mathbb{Z}/m\mathbb{Z}$ for arbitrary integers $m$. These results have been motivated by a wide variety of…

We prove a general independent equidistribution result for Gauss sums associated to $n$ monomials in $r$ variable multiplicative characters over a finite field, which generalizes several previous equidistribution results for Gauss and…

We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…

We prove some general estimates for exponential sums over subsets of finite fields which are definable in the language of rings. This generalizes both the classical exponential sum estimates over varieties over finite fields due to Weil,…

Thanks to a new construction of the so-called Chudnovsky-Chudnovsky multiplication algorithm, we design efficient algorithms for both the exponentiation and the multiplication in finite fields. They are tailored to hardware implementation…

The polynomial method has been used recently to obtain many striking results in combinatorial geometry. In this paper, we use affine Hilbert functions to obtain an estimation theorem in finite field geometry. The most natural way to state…

We consider a generalized Gauss sum supported on matrices over a number field. We evaluate this Gauss sum and relate it to the number of totally isotropic subspaces of related quadratic spaces. Then we consider a further generalization of…

Generalized numberings are an extension of Ershov's notion of numbering, based on partial combinatory algebra (pca) instead of the natural numbers. We study various algebraic properties of generalized numberings, relating properties of the…

We discuss a possible generalisation of a conjecture of Bley, Burns and Hahn concerning the relation between the second Adams-operator twisted Galois-Gauss sums of weakly ramified Artin characters and the square root of the inverse…

Looking forward to introducing an analysis in Galois Fields, discrete functions are considered (such as transcendental ones) and MacLaurin series are derived by Lagrange's Interpolation. A new derivative over finite fields is defined which…

For a finite field $\mathbb{F}$, it is a basic result of Galois theory that the fixed field $E$ of $\text{Aut}(\mathbb{F}(x)/\mathbb{F})$ is a proper extension of $\mathbb{F}$. In this expository paper we construct, for all finite fields,…

We obtain upper bounds on the cardinality of Hilbert cubes in finite fields, which avoid large product sets and reciprocals of sum sets. In particular, our results replace recent estimates of N. Hegyv\'ari and P. P. Pach (2020), which…

This is a book about computational aspects of modular forms and the Galois representations attached to them. The main result is the following: Galois representations over finite fields attached to modular forms of level one can, in almost…

We estimate double sums $$ S_\chi(a, I, G) = \sum_{x \in I} \sum_{\lambda \in G} \chi(x + a\lambda), \qquad 1\le a < p-1, $$ with a multiplicative character $\chi$ modulo $p$ where $I= \{1,\ldots, H\}$ and $G$ is a subgroup of order $T$ of…

In this article, we offer group-theoretic, field-theoretic, and topological interpretations of the Gaussian binomial coefficients and their sum. For a finite $p$-group $G$ of rank $n$, we show that the Gaussian binomial coefficient…

We prove generalized Gaffney inequalities and the discrete compactness for finite element differential forms on $s$-regular domains, including general Lipschitz domains. In computational electromagnetism, special cases of these results have…

We investigate a family of permutation polynomials of finite fields of characteristic 2. Through a connection between permutation polynomials and quadratic forms, a general treatment is presented to characterize these permutation…

Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…

We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially…