中文
相关论文

相关论文: The Number of Irreducible Polynomials over Finite …

200 篇论文

Let $q$ be a power of a prime, let $\mathbb{F}_q$ be the finite field with $q$ elements and let $n \geq 2$. For a polynomial $h(x) \in \mathbb{F}_q[x]$ of degree $n \in \mathbb{N}$ and a subset $W \subseteq [0,n] := \{0, 1, \ldots, n\}$, we…

数论 · 数学 2016-05-03 Aleksandr Tuxanidy , Qiang Wang

Let $\F_q$ ($q=p^r$) be a finite field. In this paper the number of irreducible polynomials of degree $m$ in $\F_q[x]$ with prescribed trace and norm coefficients is calculated in certain special cases and a general bound for that number is…

数论 · 数学 2015-05-13 Marko Moisio

For any positive integers $n\geq 3, r\geq 1$ we present formulae for the number of irreducible polynomials of degree $n$ over the finite field $\mathbb{F}_{2^r}$ where the coefficients of $x^{n-1}$, $x^{n-2}$ and $x^{n-3}$ are zero. Our…

Let $f$ be sampled uniformly at random from the set of degree $n$ polynomials whose coefficients lie in $\{ \pm 1\}$. A folklore conjecture, known to hold under GRH, states that the probability that $f$ is irreducible tends to $1$ as $n$…

数论 · 数学 2024-01-09 Lior Bary-Soroker , David Hokken , Gady Kozma , Bjorn Poonen

We establish a lower bound for the frequency with which an irreducible monic cubic polynomial with negative discriminant can be expressed as a sum of two squares ($\square_{2}$). This provides a quantitative answer to a question posed by…

数论 · 数学 2026-05-19 Siddharth Iyer

In \cite{D1}, Dickson listed all permutation polynomials up to degree 5 over an arbitrary finite field, and all permutation polynomials of degree 6 over finite fields of odd characteristic. The classification of degree 6 permutation…

组合数学 · 数学 2010-02-16 Jiyou Li , David B. Chandler , Qing Xiang

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…

数论 · 数学 2017-01-30 D. R. Heath-Brown , Giacomo Micheli

We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.

We consider the set $\mathcal{M}_n(\mathbb{Z}; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain upper and lower bounds on the number of distinct irreducible characteristic polynomials which correspond to…

数论 · 数学 2025-02-18 László Mérai , Igor E. Shparlinski

A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and…

交换代数 · 数学 2019-02-20 Joachim von zur Gathen

We address some questions concerning indecomposable polynomials and their spectrum. How does the spectrum behave via reduction or specialization, or via a more general ring morphism? Are the indecomposability properties equivalent over a…

代数几何 · 数学 2015-05-13 Arnaud Bodin , Pierre Dèbes , Salah Najib

We give, in this paper, all bi-unitary perfect polynomials over the prime field $\mathbb{F}_2$, with at most four irreducible factors.

数论 · 数学 2022-05-24 Olivier Rahavandrainy

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

数论 · 数学 2018-10-30 Clemens Fuchs , Christina Karolus

A key property of an algebraic variety is whether it is absolutely irreducible, meaning that it remains irreducible over the algebraic closure of its defining field, and determining absolute irreducibility is important in algebraic geometry…

代数几何 · 数学 2026-02-03 Carlos Agrinsoni , Heeralal Janwa , Moises Delgado

A formula for the number of monic irreducible self-reciprocal polynomials, of a given degree over a finite field, was given by Carlitz in 1967. In 2011 Ahmadi showed that Carlitz's formula extends, essentially without change, to a count of…

数论 · 数学 2023-02-21 Sandro Mattarei , Marco Pizzato

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$…

Say a trinomial $x^n+A x^m+B \in \Q[x]$ has reducibility type $(n_1,n_2,...,n_k)$ if there exists a factorization of the trinomial into irreducible polynomials in $\Q[x]$ of degrees $n_1$, $n_2$,...,$n_k$, ordered so that $n_1 \leq n_2 \leq…

数论 · 数学 2011-12-20 Andrew Bremner , Maciej Ulas

We establish new results on root separation of integer, irreducible polynomials of degree at least four. These improve earlier bounds of Bugeaud and Mignotte (for even degree) and of Beresnevich, Bernik, and Goetze (for odd degree).

数论 · 数学 2014-02-26 Yann Bugeaud , Andrej Dujella

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

交换代数 · 数学 2009-08-22 Ivan V. Arzhantsev , Anatoliy P. Petravchuk

We obtain an effective analytic formula, with explicit constants, for the number of distinct irreducible factors of a polynomial $f \in \mathbb{Z}[x]$. We use an explicit version of Mertens' theorem for number fields to estimate a related…

数论 · 数学 2020-12-11 Stephan Ramon Garcia , Ethan Simpson Lee , Josh Suh , Jiahui Yu