English
Related papers

Related papers: On irreducible polynomials over finite fields

200 papers

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

Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen…

Number Theory · Mathematics 2018-05-24 Domingo Gómez-Pérez , Alina Ostafe , Min Sha

Let GF(q), q=p^r, be a finite field with a primitive element g. In this paper we use exponential sums and Jacobi sums to compute the number of the irreducible polynomials of degree m over GF(q) with trace fixed and norm restricted to a…

Number Theory · Mathematics 2007-10-16 K. Kononen , M. Moisio , M. Rinta-aho , K. Vaananen

Let F_q be the finite field with cardinality q, where q is a prime power. Given a finite field extension F_q^n over F_q and a,b in (F_q)^{*}, we investigate in this article the number N_n(a,b) of elements in F_q^n whose norm equals a and…

Number Theory · Mathematics 2023-08-31 Roberto Alvarenga , Herivelto Borges

Let $\mathbb{F}_{q}$ be a finite field with $q$ elements and $\mathbb{F}_{q}[x]$ the ring of polynomials over $\mathbb{F}_{q}$. Let $l(x), k(x)$ be coprime polynomials in $\mathbb{F}_{q}[x]$ and $\Phi(k)$ the Euler function in…

Combinatorics · Mathematics 2020-02-21 Zhang Zihan , Han Dongchun

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

We prove the following function field analog of the Hardy-Littlewood conjecture (which generalizes the twin prime conjecture) over large finite fields. Let n,r be positive integers and q an odd prime power. For distinct polynomials a_1,…

Number Theory · Mathematics 2012-10-05 Lior Bary-Soroker

In this paper we construct an infinite sequence of binary irreducible polynomials starting from any irreducible polynomial $f_0 \in \F_2 [x]$. If $f_0$ is of degree $n = 2^l \cdot m$, where $m$ is odd and $l$ is a non-negative integer,…

Dynamical Systems · Mathematics 2013-08-27 Simone Ugolini

We confirm Sun's conjecture that $(\root{n+1}\of{F_{n+1}}/\root{n}\of{F_n})_{n\ge 4}$ is strictly decreasing to the limit 1, where $(F_n)_{n\ge0}$ is the Fibonacci sequence. We also prove that the sequence…

Combinatorics · Mathematics 2014-12-24 Qing-Hu Hou , Zhi-Wei Sun , Haomin Wen

Let $q,n \geq 1$ be integers, $[q]=\{1,\ldots, q\}$, and $\mathbb F$ be a field with $|\mathbb F|\geq q$. The set of increasing sequences $$ I(n,q)=\{(f_1,f_2, \dots, f_n) \in [q]^n:~ f_1\leq f_2\leq\cdots \leq f_n \} $$ can be mapped via…

Combinatorics · Mathematics 2022-08-02 Gábor Hegedüs , Lajos Rónyai

For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…

Number Theory · Mathematics 2022-10-31 Geoffrey Price , Katherine Thompson

We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…

Algebraic Geometry · Mathematics 2009-10-16 Arnaud Bodin

We study the problem of indexing irreducible polynomials over finite fields, and give the first efficient algorithm for this problem. Specifically, we show the existence of poly(n, log q)-size circuits that compute a bijection between {1,…

Computational Complexity · Computer Science 2015-04-03 Swastik Kopparty , Mrinal Kumar , Michael Saks

Let $f(T)$ be a monic polynomial of degree $d$ with coefficients in a finite field $\mathbb{F}_q$. Extending earlier results in the literature, but now allowing $(q,2d)>1$, we give a criterion for $f$ to satisfy the following property: for…

Algebraic Geometry · Mathematics 2024-06-04 Kaloyan Slavov

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

Commutative Algebra · Mathematics 2013-11-12 Joachim von zur Gathen , Alfredo Viola , Konstantin Ziegler

Let $q$ be a power of a prime $p$, let $\mathbb F_q$ be the finite field with $q$ elements and, for each nonconstant polynomial $F\in \mathbb F_{q}[X]$ and each integer $n\ge 1$, let $s_F(n)$ be the degree of the splitting field (over…

Number Theory · Mathematics 2025-08-13 Lucas Reis

We prove an analogue of the classical Bateman-Horn conjecture on prime values of polynomials for the ring of polynomials over a large finite field. Namely, given non-associate, irreducible, separable and monic (in the variable $x$)…

Number Theory · Mathematics 2019-02-20 Alexei Entin

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

For a fixed polynomial $\Delta$, we study the number of polynomials $f$ of degree $n$ over $\mathbb F_q$ such that $f$ and $f+\Delta$ are both irreducible, an $\mathbb F_q[T]$-analogue of the twin primes problem. In the large-$q$ limit, we…

Number Theory · Mathematics 2024-10-15 Ofir Gorodetsky , Will Sawin

L. Bary-Soroker and R. Shmueli (2026) have given an asymptotic formula for the number of irreducible polynomials over the finite fields $\mathbb F_q$ of $q$ elements, such that their coefficients are perfect squares in $\mathbb F_q$ and…

Number Theory · Mathematics 2026-01-21 Alina Ostafe , Igor E. Shparlinski