English
Related papers

Related papers: Constructing irreducible polynomials recursively w…

200 papers

Let $\mathbb F_q$ be the finite field with $q$ elements, where $q$ is a power of a prime. We discuss recursive methods for constructing irreducible polynomials over $\mathbb F_q$ of high degree using rational transformations. In particular,…

Number Theory · Mathematics 2019-05-21 Daniel Panario , Lucas Reis , Qiang Wang

Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial…

Number Theory · Mathematics 2019-01-11 F. E. Brochero Martínez , Lucas Reis , Lays Silva

In this paper, a computationally simple and explicit method of constructing recursive sequence of primitive polynomials of degree $n2^k (k = 1, 2, 3,\ldots)$ over $\mathbb{F}_{q}$ is given.

Commutative Algebra · Mathematics 2019-07-25 Mahmood Alizadeh

Let $f(x)\in \mathbb{F}_q[x]$ be an irreducible polynomial of degree $m$ and exponent $e$, and $n$ be a positive integer such that $\nu_p(q-1)\ge \nu_{p}(e)+\nu_p(n)$ for all $p$ prime divisor of $n$. We show a fast algorithm to determine…

Number Theory · Mathematics 2015-12-01 F. E. Brochero Martínez , Lucas Reis

We study the class of univariate polynomials $\beta_k(X)$, introduced by Carlitz, with coefficients in the algebraic function field $\mathbb F_q(t)$ over the finite field $\mathbb F_q$ with $q$ elements. It is implicit in the work of…

Number Theory · Mathematics 2023-10-04 Robert Tichy , Daniel Windisch

The use of permutation polynomials has appeared, along to their compositional inverses, as a good choice in the implementation of cryptographic systems. Hence, there has been a demand for constructions of these polynomials which…

Number Theory · Mathematics 2020-06-01 Gustavo Terra Bastos

Given a prime power $q$ and positive integers $m,t,e$ with $e > mt/2$, we determine the number of all monic irreducible polynomials $f(x)$ of degree $m$ with coefficients in $\mathbb{F}_q$ such that $f(x^t)$ contains an irreducible factor…

Group Theory · Mathematics 2019-03-27 Sabina B. Pannek

Let $\mathbb{F}_q$ denote the finite field of $q$ elements and $\mathbb{F}_{q^n}$ the degree $n$ extension of $\mathbb{F}_q$. A normal basis of $\mathbb{F}_{q^n}$ over $\mathbb{F} _q$ is a basis of the form…

Number Theory · Mathematics 2018-07-27 Hua Huang , Shanmeng Han , Wei Cao

In this paper, we provide the degree distribution of irreducible factors of the composed polynomial $f(L(x))$ over $\mathbb F_q$, where $f(x)\in \mathbb F_q[x]$ is irreducible and $L(x)\in \mathbb F_q[x]$ is a linearized polynomial. We…

Number Theory · Mathematics 2018-09-07 Lucas Reis

Let $\theta$ be a root of a monic polynomial $h(x) \in \Z[x]$ of degree $n \geq 2$. We say $h(x)$ is monogenic if it is irreducible over $\Q$ and $\{ 1, \theta, \theta^2, \ldots, \theta^{n-1} \}$ is a basis for the ring $\Z_K$ of integers…

Number Theory · Mathematics 2024-02-16 Anuj Jakhar , Ravi Kalwaniya , Prabhakar Yadav

Let q be a prime power and N_n count degree-n monic irreducible polynomials in F_q[x]. We show that prod_{n=1}^{\infty} (1 -z^n)^N_n = 1 - qz for small |z|.

Number Theory · Mathematics 2007-05-23 Barry Brent

In this paper we extend a previous investigation by us regarding an iterative construction of irreducible polynomials over finite fields of odd characteristic. In particular, we show how it is possible to iteratively construct irreducible…

Dynamical Systems · Mathematics 2015-03-31 Simone Ugolini

Let $\mathbb F_q$ be a finite field and $n$ a positive integer. In this article, we prove that, under some conditions on $q$ and $n$, the polynomial $x^n-1$ can be split into irreducible binomials $x^t-a$ and an explicit factorization into…

Information Theory · Computer Science 2014-05-20 F. E. Brochero Martínez , C. R. Giraldo Vergara , L. Batista de Oliveira

Let $\Bbb F_q$ be a finite field with $q$ elements. Let $n$ be a positive integer with radical $rad(n)$, namely, the product of distinct prime divisors of $n$. If the order of $q$ modulo $rad(n)$ is either 1 or a prime, then the irreducible…

Information Theory · Computer Science 2020-12-16 Yansheng Wu , Qin Yue

Let $m$ and $n$ be positive integers, and let $p$ be a prime. Let $T(x)=\Phi_{p^m}\left(\Phi_{2^n}(x)\right)$, where $\Phi_k(x)$ is the cyclotomic polynomial of index $k$. In this article, we prove that $T(x)$ is irreducible over $\mathbb…

Number Theory · Mathematics 2019-09-10 Joshua Harrington , Lenny Jones

For a suitable irreducible \textit{base} polynomial $f(x)\in \mathbf{Z}[x]$ of degree $k$, a family of polynomials $F_m(x)$ depending on $f(x)$ is constructed with the properties: (i) there is exactly one irreducible factor $\Phi_{d,f}(x)$…

Number Theory · Mathematics 2021-11-30 P Vanchinathan , Krithika M

We establish necessary and sufficient conditions for a quadratic polynomial to be irreducible in the ring $Z[[x]]$ of formal power series with integer coefficients. For $n,m\ge 1$ and $p$ prime, we show that $p^n+p^m\beta x+\alpha x^2$ is…

Commutative Algebra · Mathematics 2023-10-24 Daniel Birmajer , Juan Gil , Michael Weiner

The paper is devoted to produce infinite sequences of $k$-normal polynomials $F_{u}(x)\in \mathbb{F}_{q}[x]$ of degrees $np^{u} ~ (u\geq 0)$, for a suitably chosen initial $k$-normal polynomial $F_{0}(x)\in \mathbb{F}_{q}[x]$ of degree $n$…

Number Theory · Mathematics 2016-10-19 Mahmood Alizadeh , Saeid Mehrabi

In this paper we consider in detail the composition of an irreducible polynomial with X^2 and suggest a recurrent construction of irreducible polynomials of fixed degree over finite fields of odd characteristics. More precisely, given an…

Number Theory · Mathematics 2020-08-26 Gohar M. Kyureghyan , Melsik K. Kyureghyan

We construct many irreducible polynomials within semigroups generated by sets of the form $S=\{x^2+c_1,\dots,x^2+c_s\}$ under composition.

Number Theory · Mathematics 2022-08-09 Wade Hindes , Reiyah Jacobs , Peter Ye
‹ Prev 1 2 3 10 Next ›