English
Related papers

Related papers: Some multiplicative equations in finite fields

200 papers

The study of many problems in additive combinatorics, such as Szemer\'edi's theorem on arithmetic progressions, is made easier by first studying models for the problem in F_p^n for some fixed small prime p. We give a number of examples of…

Number Theory · Mathematics 2007-05-23 Ben Green

In this paper, we give a survey of the known results concerning the tensor rank of the multiplication in finite extensions of finite fields, enriched with some not published recent results as well as analyzes enhancing the qualitative…

We study the complexity of multiplication of two elements in a finite field extension given by their coordinates in a normal basis. We show how to control this complexity using the arithmetic and geometry of algebraic curves.

Number Theory · Mathematics 2023-01-02 Jean-Marc Couveignes , Tony Ezome

We generalise and improve some recent bounds for additive energies of modular roots. Our arguments use a variety of techniques, including those from additive combinatorics, algebraic number theory and the geometry of numbers. We give…

Number Theory · Mathematics 2025-09-17 Bryce Kerr , Ilya D. Shkredov , Igor E. Shparlinski , Alexandru Zaharescu

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

Number Theory · Mathematics 2012-10-03 Ayah Almousa , Melanie Matchett Wood

We extend the classical Burgess estimates to character sums over proper generalized arithmetic progressions (GAPs) of rank $2$ in prime fields $\mathbb{F}_p$. The core of our proof is a sharp upper bound for the multiplicative energy of…

Number Theory · Mathematics 2026-01-06 Ali Alsetri , Xuancheng Shao

We generalize Burgess' results on partial Gaussian sums to arbitrary finite fields. The main ingredients are the classical method of amplification, two deep results on multiplicative energy for subsets in finite fields which are obtained…

Number Theory · Mathematics 2010-02-04 Ke Gong

We obtain a new bound on certain double sums of multiplicative characters improving the range of several previous results. This improvement comes from new bounds on the number of collinear triples in finite fields, which is a classical…

Number Theory · Mathematics 2018-03-26 Ilya D. Shkredov , Igor E. Shparlinski

This paper extends the investigation of energy distribution in finite settings, which is related to the results established in [H]. We analyze the distribution of multiplicative energies using Fourier analytical methods and random…

Combinatorics · Mathematics 2026-02-03 Norbert Hegyvári

This paper describes infinite sets of polynomial equations in infinitely many variables with the property that the existence of a solution or even an approximate solution for every finite subset of the equations implies the existence of a…

Functional Analysis · Mathematics 2025-03-03 Melvyn B. Nathanson , David A. Ross

Though it is well known that the roots of any affine polynomial over a finite field can be computed by a system of linear equations by using a normal base of the field, such solving approach appears to be difficult to apply when the field…

Information Theory · Computer Science 2019-05-28 Kwang Ho Kim , Jong Hyok Choe , Dok Nam Lee , Dae Song Go , Sihem Mesnager

We obtain a new bound for the number of solutions to polynomial equations in cosets of multiplicative subgroups in finite fields, which generalises previous results of P. Corvaja and U. Zannier (2013). We also obtain a conditional…

Number Theory · Mathematics 2020-05-13 Sergei V. Konyagin , Igor E. Shparlinski , Ilya V. Vyugin

We obtain a non--trivial upper bound for the multiplicative energy of any sufficiently large subset of a subvariety of a finite algebraic group. We also find some applications of our results to growth of conjugates classes, estimates of…

Combinatorics · Mathematics 2021-01-26 Ilya D. Shkredov

We describe a method to evaluate multivariate polynomials over a finite field and discuss its multiplicative complexity.

Commutative Algebra · Mathematics 2016-04-01 Edoardo Ballico , Michele Elia , Massimiliano Sala

The study of solutions to polynomial equations over finite fields has a long history in mathematics and is an interesting area of contemporary research. In recent years the subject has found important applications in the modelling of…

Number Theory · Mathematics 2016-06-16 Andreas Aabrandt , Vagn Lundsgaard Hansen

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…

Rings and Algebras · Mathematics 2018-09-19 Gyula Károlyi , Csaba Szabó

In this paper we introduce the additive analogue of the index of a polynomial over finite fields. We study several problems in the theory of polynomials over finite fields in terms of their additive indices, such as value set sizes, bounds…

Number Theory · Mathematics 2021-05-07 Lucas Reis , Qiang Wang

We give defining equations for function fields over finite fields with many rational places. They are obtained from composita of quadratic extensions of the rational function field.

Number Theory · Mathematics 2007-05-23 Stephan Semirat

The purpose of this paper is to study fields whose multiplicative groups admit the structure of linear spaces. We prove that the multiplicative group of a finite field is a linear space if and only if the order of the multiplicative group…

Number Theory · Mathematics 2021-10-19 Yuki Nakata

In this paper we study the set of rational solutions of equations defined by power sums symmetric polynomials with coefficients in a finite field. We do this by means of applying a methodology which relies on the study of the geometry of…

Number Theory · Mathematics 2020-02-05 Mariana Perez , Melina Privitelli
‹ Prev 1 2 3 10 Next ›