English
Related papers

Related papers: Existence of primitive polynomials with three coef…

200 papers

Let $k$ be a finite field, and $L$ be a $q$-linearized polynomial defined over $k$ of $q$-degree $r$ ($L=\sum^r_{i=0}a_iZ^{q^i}$, with $a_i\in k$). This paper provides an algorithm to compute a characteristic polynomial of $L$ over a large…

Number Theory · Mathematics 2025-06-23 Luca Bastioni , Giacomo Micheli , Shujun Zhao

Let $\mathbb{F}_q[t]$ be the polynomial ring over the finite field $\mathbb{F}_q$ of $q$ elements. A polynomial in $\mathbb{F}_q[t]$ is called $m$-smooth (or $m$-friable) if all its irreducible factors are of degree at most $m$. In this…

Number Theory · Mathematics 2026-05-22 László Mérai

A polynomial whose coeffcients are equal to its roots is called a Ulam polynomial. In this paper we show that for a given degree n there exists a finite number of Ulam polynomials of degree n.

Algebraic Geometry · Mathematics 2009-04-02 Antonio J. Di Scala , Oscar Macia

We study a function field version of a classical problem concerning square-free values of polynomials evaluated at primes. We show that for a square-free polynomial $f\in \mathbb{F}_q[t][x]$, there is a limiting density as $n\to \infty$ of…

Number Theory · Mathematics 2015-06-02 Guy Lando

In this paper we give a different proof of Kuz'min's result on the number of irreducible polynomials with the first two coefficients fixed. Our technique is to relate the question to the number of points on a curve, and to calculate the…

Algebraic Geometry · Mathematics 2017-09-07 Gary McGuire , Emrah Sercan Yılmaz

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

Number Theory · Mathematics 2025-12-24 Rishu Garg , Jitender Singh

Let $q, n, m \in \mathbb{N}$ be such that $q$ is a prime power and $a, b \in \mathbb{F}$. In this article we establish a sufficient condition for the existence of a primitive normal pair $(\alpha, f(\alpha)) \in \mathbb{F}_{q^m}$ over…

Number Theory · Mathematics 2024-05-10 Arpan Chandra Mazumder , Dhiren Kumar Basnet

Let $\mathbb{F}_q$ be a finite field with $q$ elements, $f \in \mathbb{F}_q[x_1, \dots, x_n]$ a polynomial in $n$ variables and let us denote by $N(f)$ the number of roots of $f$ in $\mathbb{F}_q^n$. %Many authors, such as Wei Cao and Kung…

Number Theory · Mathematics 2023-12-08 José Gustavo Coelho , Fabio Enrique Brochero Martínez

Let $q=4$ and $k$ a positive integer. In this short note, we present a class of permutation polynomials over $\Bbb F_{q^{3k}}$. We also present a generalization.

Number Theory · Mathematics 2018-05-17 Neranga Fernando

Permutation polynomials with coefficients 1 over finite fields attract researchers' interests due to their simple algebraic form. In this paper, we first construct four classes of fractional permutation polynomials over the cyclic subgroup…

Number Theory · Mathematics 2022-07-28 Hutao Song , Hua Guo , Xiyong Zhang , Yapeng Wu , Jianwei Liu

Let $r$, $n$ be positive integers, $k$ be a non-negative integer and $q$ be any prime power such that $r\mid q^n-1.$ An element $\alpha$ of the finite field $\mathbb{F}_{q^n}$ is called an {\it $r$-primitive} element, if its multiplicative…

Number Theory · Mathematics 2022-01-28 Mamta Rani , Avnish K. Sharma , Sharwan K. Tiwari , Anupama Panigrahi

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

Number Theory · Mathematics 2022-09-12 Arghya Datta

An irreducible polynomial over $\Bbb F_q$ is said to be normal over $\Bbb F_q$ if its roots are linearly independent over $\Bbb F_q$. We show that there is a polynomial $h_n(X_1,\dots,X_n)\in\Bbb Z[X_1,\dots,X_n]$, independent of $q$, such…

Number Theory · Mathematics 2023-08-03 Xiang-dong Hou

We continue our study on counting irreducible polynomials over a finite field with prescribed coefficients. We set up a general combinatorial framework using generating functions with coefficients from a group algebra which is generated by…

Combinatorics · Mathematics 2021-09-07 Zhicheng Gao , Simon Kuttner , Qiang Wang

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

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

We prove that polynomials of degree 10 over finite fields of even characteristic with some conditions on theirs coefficients have a differential uniformity greater than or equal to 6 over $\mathbb{F}_{2^n}$ for all $n$ sufficiently large.

Number Theory · Mathematics 2024-11-20 Yves Aubry

An irreducible polynomial $f\in\Bbb F_q[X]$ of degree $n$ is {\em normal} over $\Bbb F_q$ if and only if its roots $r, r^q,\dots,r^{q^{n-1}}$ satisfy the condition $\Delta_n(r, r^q,\dots,r^{q^{n-1}})\ne 0$, where…

Rings and Algebras · Mathematics 2023-09-12 Darien Connolly , Calvin George , Xiang-dong Hou , Adam Madro , Vincenzo Pallozzi Lavorante

The Schinzel hypothesis essentially claims that finitely many irreducible polynomials in one variable over Z simultaneously assume infinitely many prime values unless there is an obvious reason why this is impossible. We prove that under a…

Number Theory · Mathematics 2016-03-29 Andreas O. Bender , Olivier Wittenberg

Very recently, Tu et al. presented a sufficient condition about $(a_1,a_2,a_3)$, see Theorem 1.1, such that $f(x) = x^{3\cdot 2^m} + a_1 x^{2^{m+1}+1}+ a_2 x^{2^m+2} + a_3 x^3$ is a class of permutation polynomials over $\gf_{2^{n}}$ with…

Information Theory · Computer Science 2019-09-19 Kangquan Li , Longjiang Qu , Chao Li , Hao Chen
‹ Prev 1 4 5 6 7 8 10 Next ›