English
Related papers

Related papers: Polynomial endomorphisms over finite fields: exper…

200 papers

Let F_{q^n} be the field of order q^n, and let Tr be the trace map from F_{q^n} to its q-element subfield. We exhibit nine sequences of polynomials of the form f(x):=x+c*Tr(x^k), with c in F_{q^n}, such that for each polynomial the function…

Number Theory · Mathematics 2016-03-04 Gohar Kyureghyan , Michael Zieve

Let $\mathbb{F}_{q}$ be a finite field of characteristic $p$, and let $f \in \mathbb{F}_{q}[x]$ be a polynomial of degree $d > 0$. Denote the image set of this polynomial as $V_{f}=\{f(\alpha)\mid\alpha\in\mathbb{F}_{q}\}$ and denote the…

Number Theory · Mathematics 2026-02-04 Jiyou Li , Zhiyao Zhang

Let $\mathbb{F}_q[t]$ denote the ring of polynomials over $\mathbb{F}_q$, the finite field of $q$ elements. We prove an estimate for fractional parts of polynomials over $\mathbb{F}_q[t]$ satisfying a certain divisibility condition…

Number Theory · Mathematics 2015-09-07 Shuntaro Yamagishi

In this paper, we investigate the existence of self-dual MRD codes $C\subset L^n$, where $L/F$ is an arbitrary field extension of degree $m\geq n$. We then apply our results to the case of finite fields, and prove that if $m=n$ and…

Information Theory · Computer Science 2024-01-31 Grégory Berhuy

For an integer $r$, a prime power $q$, and a polynomial $f$ over a finite field ${\mathbb F}_{q^r}$ of $q^r$ elements, we obtain an upper bound on the frequency of elements in an orbit generated by iterations of $f$ which fall in a proper…

Number Theory · Mathematics 2014-07-29 Oliver Roche-Newton , Igor Shparlinski

We discuss the problem of constructing a small subset of a finite field containing primitive elements of the field. Given a finite field, $\mathbb{F}_{q^n}$, small $q$ and large $n$, we show that the set of all low degree polynomials…

Number Theory · Mathematics 2014-12-24 Abhishek Bhowmick , Thái Hoàng Lê

For n=1,2,3,... let N_n(q) denote the number of monic irreducible polynomials over the finite field F_q. We mainly show that the sequence N_n(q)^{1/n} (n>e^{3+7/(q-1)^2}) is strictly increasing and the sequence…

Number Theory · Mathematics 2012-10-16 Zhi-Wei Sun

Let $\mathbb{F}_q$ be the finite field of $q$ elements. Then a \emph{permutation polynomial} (PP) of $\mathbb{F}_q$ is a polynomial $f \in \mathbb{F}_q[x]$ such that the associated function $c \mapsto f(c)$ is a permutation of the elements…

Number Theory · Mathematics 2012-11-27 Christopher J. Shallue

In this paper, we further investigate the local criterion and present a class of permutation polynomials and their compositional inverses over $ \mathbb{F}_{q^2}$. Additionally, we demonstrate that linearized polynomial over…

Number Theory · Mathematics 2024-09-30 Danyao Wu , Pingzhi Yuan

Let $A_g$ be an abelian variety of dimension $g$ and $p$-rank $\lambda \leq 1$ over an algebraically closed field of characteristic $p>0$. We compute the number of homomorphisms from $\pi_1^{\text{\'et}}(A_g,a)$ to $GL_n(\mathbb F_q)$,…

Algebraic Geometry · Mathematics 2018-06-22 Brett Frankel

Given a polynomial endomorphism F of the n-dimensional affine space over a field K, we define a sequence of polynomial endomorphisms of the affine space associated to F. We call F nice if there exists an integer m such that the m-th term of…

Algebraic Geometry · Mathematics 2016-01-07 Elzbieta Adamus , Pawel Bogdan , Teresa Crespo , Zbigniew Hajto

We provide the existence of new degree growths in the context of polynomial automorphisms of $\mathbb{C}^k$: if $k$ is an integer $\geq 3$, then for any $\ell\leq \left[\frac{k-1}{2}\right]$ there exist polynomial automorphisms $f$ of…

Dynamical Systems · Mathematics 2018-05-23 Julie Déserti

We present a new algorithm for computing $m$-th roots over the finite field $\F_q$, where $q = p^n$, with $p$ a prime, and $m$ any positive integer. In the particular case $m=2$, the cost of the new algorithm is an expected $O(\M(n)\log (p)…

Data Structures and Algorithms · Computer Science 2011-10-20 Javad Doliskani , Eric Schost

This paper concerns the enumeration of isomorphism classes of modules of a polynomial algebra in several variables over a finite field. This is the same as the classification of commuting tuples of matrices over a finite field up to…

Commutative Algebra · Mathematics 2021-09-29 Uday Bhaskar Sharma

Let k be a field of characteristic zero. Let phi be a k-endomorphism of the polynomial algebra k[x_1,...,x_n]. It is known that phi is an automorphism if and only if it maps irreducible polynomials to irreducible polynomials. In this paper…

Commutative Algebra · Mathematics 2013-06-21 Piotr Jedrzejewicz

In this paper we study the distribution of the size of the value set for a random polynomial with degree at most $q-1$ over a finite field $\mathbb{F}_q$. We obtain the exact probability distribution and show that the number of missing…

Combinatorics · Mathematics 2014-07-23 Zhicheng Gao , Qiang Wang

In these short notes, we will show the following. Let F_q be a finite field and let E/\F_q be an elliptic curve. Let S_r be the rth summation/Semaev polynomial for E. Under an assumption, we show that it is NP-complete to check if S_r…

Number Theory · Mathematics 2015-06-09 Michiel Kosters , Sze Ling Yeo

Permutation polynomials over finite fields have extensive applications in various areas. Particularly, permutation polynomials with simple forms are of great interest. In recent papers, several classes of permutation polynomials of the form…

Number Theory · Mathematics 2025-12-29 Xuan Pang , Danyao Wu , Pingzhi Yuan

Let $\mathbb{F}_q$ be the finite field with $q$ elements, and $T$ a positive integer. In this article we find a sharp estimative of the total number of monic irreducible binomials in $\mathbb F_q[x]$ of degree less or equal to $T$, when $T$…

Motivated by coding applications,two enumeration problems are considered: the number of distinct divisors of a degree-m polynomial over F = GF(q), and the number of ways a polynomial can be written as a product of two polynomials of degree…

Discrete Mathematics · Computer Science 2021-04-10 Rachel N. Berman , Ron M. Roth