English
Related papers

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

200 papers

We establish effective bounds on the number of periodic points of degree-$d$ polynomials $\phi$ defined over $p$-adic fields and number fields, under a mild reduction hypothesis that is satisfied by all unicritical polynomials $X^d + c$…

Number Theory · Mathematics 2025-10-31 Isaac Rajagopal , Robin Zhang

Let $p \geq 2$ be a large prime, and let $k \ll \log p $ be a small integer. This note proves the existence of various configurations of $(k+1)$-tuples of consecutive and quasi consecutive primitive roots $n+a_0, n+a_1, n+a_2, \ldots,…

General Mathematics · Mathematics 2022-04-05 N. A. Carella

A method of constructing specific polynomial representations $f(x)$ over the finite field $\mathbb{F}_p$ of the square roots function modulo a prime $p = 2^kn + 1$, $n$ odd, is presented. The formulas for the cases $k = 2$, $3$ and $4$ are…

Number Theory · Mathematics 2023-12-19 N. A. Carella

Given an odd prime number p, we describe a continued fraction in the field F(p) of power series in 1/T with coefficients in the finite field F_p, where T is a formal indeterminate. This continued fraction satisfies an algebraic equation of…

Number Theory · Mathematics 2017-10-03 Alain Lasjaunias

We consider absolutely irreducible polynomials $f \in Z[x,y]$ with $\deg_x(f)=m$, $\deg_y(f)=n$ and height $H$. We show that for any prime $p$ with $p>c_{mn} H^{2mn+n-1}$ the reduction $f \bmod p$ is also absolutely irreducible. Furthermore…

Number Theory · Mathematics 2007-05-23 Wolfgang M. Ruppert

We give nontrivial bounds for the bilinear sums $$ \sum_{u = 1}^{U} \sum_{v=1}^V \alpha_u \beta_v \mathbf{\,e}_p(u/f(v)) $$ where $\mathbf{\,e}_p(z)$ is a nontrivial additive character of the prime finite field ${\mathbb F}_p$ of $p$…

Number Theory · Mathematics 2016-05-25 Igor E. Shparlinski

Let $c_1(x),c_2(x),f_1(x),f_2(x)$ be polynomials with rational coefficients. With obvious exceptions, there can be at most finitely many roots of unity among the zeros of the polynomials $c_1(x)f_1(x)^n+c_2(x)f_2(x)^n$ with $n=1,2\ldots$.…

Number Theory · Mathematics 2020-11-24 Yuri Bilu , Florian Luca

We get some results about the factorization of $\phi_p(M) \in {\mathbb{F}}_2[x]$, where $p$ is a prime number, $\phi_p$ is the corresponding cyclotomic polynomial and $M$ is a Mersenne prime (polynomial). By the way, we better understand…

Number Theory · Mathematics 2021-06-21 Luis H. Gallardo , Olivier Rahavandrainy

We prove that if the signed binomial coefficient $(-1)^i\binom{k}{i}$ viewed modulo p is a periodic function of i with period h prime to p in the range $0\le i\le k$, then k+1 is a power of p, provided h is not too large compared to k. (In…

Number Theory · Mathematics 2007-05-23 Sandro Mattarei

This article examines lower bounds for the representation growth of finitely generated (particularly profinite and pro-p) groups. It also considers the related question of understanding the maximal multiplicities of character degrees in…

Group Theory · Mathematics 2009-10-06 David A Craven

We consider the problem of bounding away from 0 the minimum value m taken by a polynomial P of Z[X_1,...,X_k] over the standard simplex, assuming that m>0. Recent algorithmic developments in real algebraic geometry enable us to obtain a…

Symbolic Computation · Computer Science 2009-02-20 Saugata Basu , Richard Leroy , Marie-Francoise Roy

We prove that any multiplicative subgroup G of the prime field f_p with |G| < p^{1/2} satisfies |3G| \gg |G|^2 / \log |G|. Also, we obtain a bound for the multiplicative energy of any nonzero shift of G, namely E^* (G+x) \ll |G|^2 log |G|,…

Number Theory · Mathematics 2015-04-20 Ilya D. Shkredov

We explore a combinatorial bijection between two seemingly unrelated topics: the roots of irreducible polynomials of degree $m$ over a finite field $F_p$ for a prime number $p$ and the number of points that are periodic of order $m$ for a…

Combinatorics · Mathematics 2023-05-24 Emerson León , Julián Pulido

For any polynomial $P(x)\in\mathbb{Z}[x],$ we study arithmetic dynamical systems generated by $\displaystyle{F_P(n)=\prod_{k\le n}}P(n)(\text{mod}\ p),$ $n\ge 1.$ We apply this to improve the lower bound on the number of distinct quadratic…

Number Theory · Mathematics 2018-10-16 Oleksiy Klurman , Marc Munsch

We present a few factorizations of polynomials over finite fields. These factorizations are related to traces, compositions of polynomials and binomial coefficients. As a corollary we obtain a description of all irreducible polynomials…

Number Theory · Mathematics 2007-05-23 Roland Bacher

Let K be F_q((T)), or more generally any field of characteristic p equipped with a valuation having a finite residue field of q elements. Then a polynomial f(x) in K[x] having k+1 nonzero coefficients has at most q^k distinct zeros in K. We…

Number Theory · Mathematics 2017-04-03 Bjorn Poonen

For $1< p <2$ we obtain sharp inequalities for the supremum of products of homogeneous polynomials on $L_p(\mu)$, whenever the number of factors is no greater than the dimension of these Banach spaces (a condition readily satisfied in the…

Functional Analysis · Mathematics 2013-04-22 Daniel Carando , Damian Pinasco , Jorge Tomás Rodríguez

We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.

Commutative Algebra · Mathematics 2007-06-11 Arnaud Bodin

We find all unitary perfect polynomials over the prime field $\F_2$ with less than five distinct prime factors.

Number Theory · Mathematics 2010-03-30 Luis H. Gallardo , Olivier Rahavandrainy

Given a prime power $p^d$ with $p$ a prime and $d$ a positive integer, we classify the finite groups $G$ with $p^{2d}$ dividing $|G|$ in which all subgroups of order $p^d$ are complemented and the finite groups $G$ having a normal…

Group Theory · Mathematics 2022-02-17 Yu Zeng