中文
相关论文

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

200 篇论文

Given a field $K$ and $n > 1$, we say that a polynomial $f \in K[x]$ has newly reducible $n$th iterate over $K$ if $f^{n-1}$ is irreducible over $K$, but $f^n$ is not (here $f^i$ denotes the $i$th iterate of $f$). We pose the problem of…

数论 · 数学 2021-11-24 Peter Illig , Rafe Jones , Eli Orvis , Yukihiko Segawa , Nick Spinale

We generalize an approach from a 1960 paper by Ljunggren, leading to a practical algorithm that determines the set of $N > \operatorname{deg}(c) + \operatorname{deg}(d)$ such that the polynomial $$f_N(x) = x^N c(x^{-1}) + d(x)$$ is…

数论 · 数学 2018-03-30 William Sawin , Mark Shusterman , Michael Stoll

We extend the asymptotic formula for counting integral matrices with a given irreducible characteristic polynomial by Eskin, Mozes and Shah in 1996 to the case of counting elements in a maximal order of certain central simple algebra with a…

数论 · 数学 2025-03-05 Jiaqi Xie

We give a criterion for a quasi-ordinary polynomial to be irreducible. The criterion is based on the notion of approximate roots and that of generalized Newton polygons.

代数几何 · 数学 2009-04-29 Abdallah Assi

Let $p$ be a prime and $b(x)$ be an irreducible polynomial of degree $k$ over $\mathbb{F}_p$. Let $d\geq 1$ be an integer. Consider the following question: Is $b(x^d)$ irreducible? We derive necessary conditions for $b(x^d)$ to be…

数论 · 数学 2016-04-29 Palash Sarkar , Shashank Singh

Let $F$ be a field of $q$ elements, where $q$ is a power of an odd prime. Fix $n = (q+1)/2$. For each $s \in F$, we describe all the irreducible factors over $F$ of the polynomial $g_s(y): = y^n + (1-y)^n -s$, and we give a necessary and…

数论 · 数学 2018-02-07 Ron Evans , Mark Van Veen

In this paper we construct infinite sequences of monic irreducible polynomials with coefficients in odd prime fields by means of a transformation introduced by Cohen in 1992. We make no assumptions on the coefficients of the first…

数论 · 数学 2015-03-13 Simone Ugolini

Let $\mathcal{A}$ and $\mathcal{B}$ be sets of polynomials of degree $n$ over a finite field. We show, that if $\mathcal{A}$ and $\mathcal{B}$ are large enough, then $A+B$ has an irreducible divisor of large degree for some…

数论 · 数学 2022-06-28 László Mérai

Let $q$ be a prime power and $U$ the group of lower unitriangular matrices of order $n$ for some natural number $n$. We give a lower bound for the degrees of irreducible constituents of Andr\'{e}-Yan supercharacters and classify the…

表示论 · 数学 2013-12-13 Richard Dipper , Qiong Guo

The set of linear, differential operators preserving the vector space of couples of polynomials of degrees n and n-2 in one real variable leads to an abstract associative graded algebra A(2). The irreducible, finite dimensional…

solv-int · 物理学 2009-10-30 Y. Brihaye , S. Giller , P. Kosinski , J. Nuyts

For a degree $n$ polynomial $f$ over the rationals, the elements in the fiber $f^{-1}(a)$ are of degree $n$ over $\mathbb Q$ for most rational values $a$ by Hilbert's irreducibility theorem. Determining the set of exceptional $a$'s without…

数论 · 数学 2022-09-09 Joachim König , Danny Neftin

Suppose E/F is a field extension. We ask whether or not there exists an element of E whose characteristic polynomial has one or more zero coefficients in specified positions. We show that the answer is frequently ``no''. We also prove…

代数几何 · 数学 2007-05-23 Zinovy Reichstein , Boris Youssin

We obtain upper bounds for the number of monic irreducible polynomials over $\mathbb Z$ of a fixed degree $n$ and a growing height $H$ for which the field generated by one of its roots has a given discriminant. We approach it via counting…

数论 · 数学 2021-11-18 Rainer Dietmann , Alina Ostafe , Igor E. Shparlinski

In this paper we present and analyse a construction of irreducible polynomials over odd prime fields via the transforms which take any polynomial $f \in \mathbf{F}_p[x]$ of positive degree $n$ to $\left(\frac{x}{k} \right)^n \cdot…

数论 · 数学 2015-03-13 Simone Ugolini

For any integer n >= 2 and any nonnegative integers r,s with r+2s = n, we give an unconditional construction of infinitely many monic irreducible polynomials of degree n with integer coefficients having squarefree discriminant and exactly r…

数论 · 数学 2011-05-05 Kiran S. Kedlaya

When monic integral polynomials of degree $n \geq 2$ are ordered by the maximum of the absolute value of their coefficients, the Hilbert irreducibility theorem implies that asymptotically 100% are irreducible and have Galois group…

数论 · 数学 2019-10-08 Robert J. Lemke Oliver , Frank Thorne

For any positive integers $n \ge 3$ and $r \ge 1$, we prove that the number of monic irreducible polynomials of degree $n$ over $\mathbb{F}_{2^r}$ in which the coefficients of $T^{n-1}$, $T^{n-2}$ and $T^{n-3}$ are prescribed has period…

数论 · 数学 2019-11-26 Ofir Gorodetsky

We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it…

交换代数 · 数学 2014-01-25 Markus Lange-Hegermann

We find explicitly the multiplicities in the (mixed) trace cocharacter sequence of two $3\times 3$ matrices over a field of characteristic 0 and show that asymptotically they behave as polynomials of seventh degree. As a consequence we…

环与代数 · 数学 2007-05-23 Vesselin Drensky , Georgi K. Genov , Angela Valenti

We investigate the problem asking when any square matrix whose entries lie in a finite field of characteristic 2 is decomposable into the sum of a diagonalizable matrix and a nilpotent matrix with index of nilpotency at most 2 and, as a…

环与代数 · 数学 2026-04-17 Peter Danchev , Esther García , Miguel Gómez Lozano