English
Related papers

Related papers: Polynomial Values in Small Subgroups of Finite Fie…

200 papers

We provide a monotone non increasing sequence of upper bounds $f^H_k$ ($k\ge 1$) converging to the global minimum of a polynomial $f$ on simple sets like the unit hypercube. The novelty with respect to the converging sequence of upper…

Optimization and Control · Mathematics 2016-05-26 Etienne de Klerk , Jean Lasserre , Monique Laurent , Zhao Sun

We provide an index bound for character sums of polynomials over finite fields. This improves the Weil bound for high degree polynomials with small indices, as well as polynomials with large indices that are generated by cyclotomic mappings…

Number Theory · Mathematics 2015-07-06 Daqing Wan , Qiang Wang

We obtain an upper bound for the multiplicative energy of the spectrum of an arbitrary set from $\mathbb{F}_p$, which is the best possible up to the results on exponential sums over subgroups.

Number Theory · Mathematics 2018-05-29 Ilya D. Shkredov

In this paper we show there exists an infinite family of number fields $L$, Galois over $\mathbb{Q}$, for which the smallest prime $p$ of $\mathbb{Q}$ which splits completely in $L$ has size at least $( \log(|D_L|) )^{2+o(1)}$. This gives a…

Number Theory · Mathematics 2019-12-11 Andrew Fiori

For a prime number $p$, an integer $e\geq 2$ and a field $F$ containing a primitive $p^e$-th root of unity, the index of central simple $F$-algebras of exponent $p^e$ is bounded in terms of the $p$-symbol length of $F$. For a nonreal field…

Rings and Algebras · Mathematics 2024-02-13 Karim Johannes Becher , Fatma Kader Bingöl

Polynomials and elements over finite fields exhibit closely related algebraic structures, and many properties defined for elements extend naturally to polynomials. The concepts of order and $\mathbb{F}_q$-Order for elements have been…

Rings and Algebras · Mathematics 2026-01-15 Maithri K. , Vadiraja Bhatta G. R. , Indira K. P. , Prasanna Poojary

The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…

Symbolic Computation · Computer Science 2025-02-10 Nicolas Faroß , Thomas Sturm

Let $p$ be a odd prime such that 2 is a primitive element of finite field $F_p*$. In this short note we propose a new algorithm for the computation of discrete logarithm in $F_p*$. This algorithm is based on elementary properties of finite…

Number Theory · Mathematics 2009-08-27 Habeeb Syed

Let F_q be the finite field of q elements. Let H be a multiplicative subgroup of F_q^*. For a positive integer k and element b\in F_q, we give a sharp estimate for the number of k-element subsets of H which sum to b.

Number Theory · Mathematics 2011-01-04 Guizhen Zhu , Daqing Wan

Let $S=\{p_1,\dots,p_s\}$ be a finite non-empty set of distinct prime numbers, let $f\in \mathbb{Z}[X]$ be a polynomial of degree $n\ge 1$, and let $S'\subseteq S$ be the subset of all $p\in S$ such that $f$ has a root in $\mathbb{Z}_p$.…

Number Theory · Mathematics 2019-07-22 Maurizio Moreschi

Given a polynomial with integral coefficients, one can inquire about the possible residues it can take in its image modulo a prime $p$. The sum over the distinct residues can sometimes be computed independent of the prime $p$; for example,…

Number Theory · Mathematics 2024-07-16 Thomas Brazelton , Joshua Harrington , Matthew Litman , Tony W. H. Wong

The determinantal complexity of a polynomial $P \in \mathbb{F}[x_1, \ldots, x_n]$ over a field $\mathbb{F}$ is the dimension of the smallest matrix $M$ whose entries are affine functions in $\mathbb{F}[x_1, \ldots, x_n]$ such that $P =…

Computational Complexity · Computer Science 2021-12-03 Mrinal Kumar , Ben Lee Volk

We prove a Roth type theorem for polynomial corners in the finite field setting. Let $\phi_1$ and $\phi_2$ be two polynomials of distinct degree. For sufficiently large primes $p$, any subset $ A \subset \mathbb F_p \times \mathbb F_p$ with…

Classical Analysis and ODEs · Mathematics 2021-06-18 Rui Han , Michael T Lacey , Fan Yang

Let $F_p$ be the field of a prime order $p$. Then for any positive integer $n>1$, for any $\epsilon>0$, and for any subset $A$ of $F_p$, every element of $F_p$ can be represented as a sum of $N$ elements, each of them is a product of $n$…

Number Theory · Mathematics 2007-05-23 A. A. Glibichuk , S. V. Konyagin

We prove that for any finite set A of real numbers its difference set D:=A-A has large product set and quotient set, namely, |DD|, |D/D| \gg |D|^{1+c}, where c>0 is an absolute constant. A similar result takes place in the prime field F_p…

Number Theory · Mathematics 2016-10-04 Ilya D. Shkredov

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

An integer-valued multiplicative function $f$ is said to be polynomially-defined if there is a nonconstant separable polynomial $F(T)\in \mathbb{Z}[T]$ with $f(p)=F(p)$ for all primes $p$. We study the distribution in coprime residue…

Number Theory · Mathematics 2023-05-31 Paul Pollack , Akash Singha Roy

Let $f$ be a positive multiplicative function and let $k\geq 2$ be an integer. We prove that if the prime values $f(p)$ converge to $1$ sufficiently slowly as $p\rightarrow +\infty$, in the sense that $\sum_{p}|f(p)-1|=\infty$, there exists…

Number Theory · Mathematics 2021-07-27 Stelios Sachpazis

Let $\mathbb{F}$ be a finite field and let $f$ be a linear polynomial in $\mathbb{F}[x]$. We investigate the number of polynomials of degree $d$ which commute with $f$ under composition. In so doing, we rediscover a result of Park, but with…

Number Theory · Mathematics 2023-06-16 Jeffrey Hatley , Mayah Teplitskiy

The aim of the paper is to produce new families of irreducible polynomials, generalizing previous results in the area. One example of our general result is that for a near-separated polynomial, i.e., polynomials of the form…

Symbolic Computation · Computer Science 2019-03-21 Jaime Gutierrez , Jorge Jimenez Urroz