English
Related papers

Related papers: Factorization of Dickson polynomials over Finite F…

200 papers

In this work, we define a more general family of polynomials in several variables satisfying a linear recurrence relation. Then we provide explicit formulas and determinantal expressions. Finally, we apply these results to recurrent…

Number Theory · Mathematics 2023-05-23 Said Zriaa , Mohammed Mouçouf

In this paper, we investigate permutation polynomials over the finite field $\mathbb F_{q^n}$ with $q=2^m$, focusing on those in the form $\mathrm{Tr}(Ax^{q+1})+L(x)$, where $A\in\mathbb F_{q^n}^*$ and $L$ is a $2$-linear polynomial over…

Number Theory · Mathematics 2025-07-01 Ruikai Chen , Sihem Mesnager

Let $\mathbb{F}$ be a finite field of odd characteristic. When $|\mathbb{F}|\ge 5$, we prove that every matrix $A$ admits a decomposition into $D+M$ where $D$ is diagonalizable and $M^2=0$. For $\mathbb{F}=\mathbb{F}_3$, we show that such…

Rings and Algebras · Mathematics 2026-04-20 Peter Danchev , Esther García , Miguel Gómez Lozano

In this paper, we present several necessary conditions for the reversed Dickson polynomial $E_{n}(1, x)$ of the second kind to be a permutation of $\mathbb{F}_{q}$. In particular, we give explicit evaluation of the sum $\sum_{a\in…

Number Theory · Mathematics 2014-04-09 Shaofang Hong , Xiaoer Qin

We present the formula for the number of monic irreducible polynomials of degree $n$ over the finite field $\mathbb F_q$ where the coefficients of $x^{n-1}$ and $x$ vanish for $n\ge3$. In particular, we give a relation between rational…

Number Theory · Mathematics 2020-05-20 Yağmur Çakıroğlu , Oğuz Yayla , Emrah Sercan Yılmaz

The probability for two monic polynomials of a positive degree n with coefficients in the finite field F_q to be relatively prime turns out to be identical with the probability for an n x n Hankel matrix over F_q to be nonsingular.…

Combinatorics · Mathematics 2011-02-10 Mario Garcia Armas , Sudhir R. Ghorpade , Samrith Ram

Let $K$ be a global field and $n > 1$ an integer. We show $n$ is composite if and only if there is an irreducible polynomial $f(x) \in K[x]$ of degree $n$ which is reducible $q$-adically for all the primes $q$ of $K$.

Number Theory · Mathematics 2007-05-23 R. Guralnick , M. Schacher , J. Sonn

In this paper we obtained the formula for the number of irreducible polynomials with degree $n$ over finite fields of characteristic two with given trace and subtrace. This formula is a generalization of the result of Cattell et al.(2003)…

Number Theory · Mathematics 2014-07-02 Won-Ho Ri , Gum-Chol Myong , Ryul Kim , Chang-Il Rim

Primitive prime divisors play an important role in group theory and number theory. We study a certain number theoretic quantity, called $\Phi^*_n(q)$, which is closely related to the cyclotomic polynomial $\Phi_n(x)$ and to primitive prime…

Number Theory · Mathematics 2016-10-11 S. P. Glasby , Frank Lübeck , Alice C. Niemeyer , Cheryl E. Praeger

In this article, we count the quantity of minimal cyclic codes of length $n$ and dimension $k$ over a finite field $\mathbb F_q$, in the case when the prime factors of $n$ satisfy a special condition. This problem is equivalent to count the…

Information Theory · Computer Science 2014-06-18 F. E. Brochero Martínez

For a set $S$ of quadratic polynomials over a finite field, let $C$ be the (infinite) set of arbitrary compositions of elements in $S$. In this paper we show that there are examples with arbitrarily large $S$ such that every polynomial in…

Number Theory · Mathematics 2017-01-30 D. R. Heath-Brown , Giacomo Micheli

Self-reciprocal and self-conjugate-reciprocal polynomials over finite fields have been of interest due to their rich algebraic structures and wide applications. Self-reciprocal irreducible monic factors of $x^n-1$ over finite fields and…

Information Theory · Computer Science 2018-04-18 Arunwan Boripan , Somphong Jitman , Patanee Udomkavanich

We establish expansion properties for suitably generic polynomials of degree $d$ in $d+1$ variables over finite fields. In particular, we show that if $P\in\mathbb{F}_q[x_1,\ldots,x_{d+1}]$ is a polynomial of degree $d$ coming from an…

Combinatorics · Mathematics 2024-03-07 Nuno Arala , Sam Chow

Let $D$ be a Krull domain admitting a prime element with finite residue field and let $K$ be its quotient field. We show that for all positive integers $k$ and $1 < n_1 \leq \ldots \leq n_k$ there exists an integer-valued polynomial on $D$,…

Commutative Algebra · Mathematics 2023-08-29 Victor Fadinger , Daniel Windisch

Constructing $r$-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree $r^e$ (where $r$ is a prime) over a given finite field $\mathbb{F}_q$ of…

Computational Complexity · Computer Science 2017-02-03 Vishwas Bhargava , Gábor Ivanyos , Rajat Mittal , Nitin Saxena

Regarding non-unique factorization of integer-valued polynomials over a discrete valuation domain $(R,M)$ with finite residue field, it is known that there exist absolutely irreducible elements, that is, irreducible elements all of whose…

Commutative Algebra · Mathematics 2022-03-16 Sophie Frisch , Sarah Nakato , Roswitha Rissner

Using polynomial evaluation, we give some useful criteria to answer questions about divisibility of polynomials. This allows us to develop interesting results concerning the prime elements in the domain of coefficients. In particular, it is…

Commutative Algebra · Mathematics 2008-06-10 Luis F. Caceres , Jose A. Velez-Marulanda

Let $E$ be an elliptic curve over the finite field $\mathbb F_q$. We prove that, when $n$ is a sufficiently large positive integer, $\#E(\mathbb F_{q^n})$ has a prime factor exceeding $n\exp(c\log n/\log\log n)$.

Number Theory · Mathematics 2021-12-15 Yuri Bilu , Haojie Hong , Florian Luca

Let $q$ be an odd prime power and $D$ be the set of monic irreducible polynomials in $\mathbb F_q[x]$ which can be written as a composition of monic degree two polynomials. In this paper we prove that $D$ has a natural regular structure by…

Number Theory · Mathematics 2019-02-13 Andrea Ferraguti , Giacomo Micheli , Reto Schnyder

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

Number Theory · Mathematics 2018-09-05 Fusun Akman