Barry Brent
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|.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.
Building upon the work of A. Booker and C. Pomerance (2017), we prove that for a prime power $q \geq 7$, every residue class modulo an irreducible polynomial $F \in \mathbb{F}_q[X]$ has a non-constant, square-free representative which has no irreducible factors of degree exceeding $\text{deg}~F -1$. We also give applications to generating sequences of irreducible polynomials.
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 irreducible polynomial of degree n and order 2^rt with t odd, the construction produces ord_t(2)/d irreducible polynomials of degree n and order t for a certain divisor d of n. The construction can be used, for example, to search irreducible polynomials with specific requirements on its coefficients.
We study degree preserving maps over the set of irreducible polynomials over a finite field. In particular, we show that every permutation of the set of irreducible polynomials of degree $k$ over $\mathbb{F}_q$ is induced by an action from a permutation polynomial of $\mathbb{F}_{q^k}$ with coefficients in $\mathbb{F}_q$. The dynamics of these permutations of irreducible polynomials of degree $k$ over $\mathbb{F}_q$, such as fixed points and cycle lengths, are studied. As an application, we also generate irreducible polynomials of the same degree by an iterative method.
We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the {\em total degree} and the {\em vector degree}, are considered. We show that the number of irreducibles can be computed recursively by degree and that the number of relatively prime pairs can be expressed in terms of the number of irreducibles. We also obtain asymptotic formulas for the number of irreducibles and the number of relatively prime pairs. The asymptotic formulas for the num…
Let $P(x)$ be an irreducible quadratic polynomial in $\mathbb{Z}[x]$. We show that for almost all $n$, $P(n)$ does not lie in the range of Euler's totient function.
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 irreducible. Further, when the necessary conditions are satisfied, we obtain the probability for $b(x^d)$ to be irreducible.
We prove that a random bivariate polynomial with plus minus 1 coefficients is irreducible with high probability.
We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].
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 $C$ is irreducible. As a second result, we give an algorithm to determine whether all the elements in $C$ are irreducible, using only $O( \#S (\log q)^3 q^{1/2} )$ operations.
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).
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, given a divisor $D>2$ of $q+1$ and an irreducible polynomial $f\in \mathbb F_{q}[x]$ of degree $n$ such that $n$ is even or $D\not \equiv 2\pmod 4$, we show how to obtain from $f$ a sequence $\{f_i\}_{i\ge 0}$ of irreducible polynomials over $\mathbb F_q$ with $\mathrm{deg}(f_i)=n\cdot D^{i}$.
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 sufficient condition on $s$ for $g_s(y)$ to be irreducible.
Using an explicit version of Selberg's upper sieve, we obtain explicit upper bounds for the number of $n\leq x$ such that a non-empty set of irreducible polynomials $F_i(n)$ with integer coefficients are simultaneously prime; this set can contain as many polynomials as desired. To demonstrate, we present computations for some irreducible polynomials and obtain an explicit upper bound for the number of Sophie Germain primes up to $x$, which have practical applications in cryptography.
Let $\mathcal S$ be a set of monic degree $2$ polynomials over a finite field and let $C$ be the compositional semigroup generated by $\mathcal S$. In this paper we establish a necessary and sufficient condition for $C$ to be consisting entirely of irreducible polynomials. The condition we deduce depends on the finite data encoded in a certain graph uniquely determined by the generating set $\mathcal S$. Using this machinery we are able both to show examples of semigroups of irreducible polynomials generated by two degree $2$ polynomials and to give some non-existence results for some of these…
We study the number of irreducible polynomials over $\mathbf{F}_{q}$ with some coefficients prescribed. Using the technique developed by Bourgain, we show that there is an irreducible polynomial of degree $n$ with $r$ coefficients prescribed in any location when $r \leq \left[\left(1/4 - ε\right)n \right]$ for any $ε>0$ and $q$ is large; and when $r\leqδn$ for some $δ>0$ and for any $q$. The result is improved from the earlier work of Pollack that the similar result holds for $r\leq\left[(1-ε)\sqrt{n}\right]$.
We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a finite field F_q whose coefficients are restriced to lie in a given subset of F_q.
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 sum over rational primes. For a given $f \in \mathbb{Z}[x]$, our result yields a finite list of primes that certifies the number of distinct irreducible factors of $f$.
Iterative constructions of irreducible polynomials from isogenies
该研究用椭圆曲线同源解释有限域上由有理分式迭代生成不可约多项式的变换，借助复乘理论设计算法，生成大量可对正密度初始不可约多项式产出无穷不可约多项式族的有理分式。
In this paper we obtained the formula for the number of irreducible polynomials with degree $n$ over finite fields of characteristic two with given trace and subtrace. This formula is a generalization of the result of Cattell et al.(2003) [2].
All bi-unitary perfect polynomials over $\F_2$ with at most four irreducible factors
该研究确定了有限域$\text{F}_2$上至多含四个不可约因子的双酉完全多项式的全部类型
In this article, we consider polynomials of the form $f(x)=a_0+a_{n_1}x^{n_1}+a_{n_2}x^{n_2}+\dots+a_{n_r}x^{n_r}\in \mathbb{Z}[x],$ where $|a_0|\ge |a_{n_1}|+\dots+|a_{n_r}|,$ $|a_0|$ is a prime power and $|a_0|\nmid |a_{n_1}a_{n_r}|$. We will show that under the strict inequality these polynomials are irreducible for certain values of $n_1$. In the case of equality, apart from its cyclotomic factors, they have exactly one irreducible non-reciprocal factor.
H. Lenstra has pointed out that a cubic polynomial of the form (x-a)(x-b)(x-c) + r(x-d)(x-e), where {a,b,c,d,e} is some permutation of {0,1,2,3,4}, is irreducible modulo 5 because every possible linear factor divides one summand but not the other. We classify polynomials over finite fields that admit an irreducibility proof with this structure.
Let $R(x)=g(x)/h(x)$ be a rational expression of degree three over the finite field $\mathbb{F}_q$. We count the irreducible polynomials in $\mathbb{F}_q[x]$, of a given degree, which have the form $h(x)^{\mathrm{deg}\, f}\cdot f\bigl(R(x)\bigr)$ for some $f(x)\in\mathbb{F}_q[x]$. As an application, we recover the number of irreducible transformation shift registers of order three, previously computed by Jiang and Yang.
For a subgroup of $PGL(2,q)$ we show how some irreducible polynomials over $\mathbb{F}_q$ arise from the field of invariant rational functions. The proofs rely on two actions of $PGL(2,F)$, one on the projective line over a field $F$ and the other on the rational function field $F(x)$. The invariant functions in $F(x)$ are used to show that regular patterns exist in the factorization of certain polynomials into irreducible polynomials. We use some results about group actions and the orbit polynomial, whose proofs are included. An unusual connection to the conjugacy classes of $PGL(2,q)$ is sho…
In the past few years, an action of $\mathrm{PGL}_2(\mathbb F_q)$ on the set of irreducible polynomials in $\mathbb F_q[x]$ has been introduced and many questions have been discussed, such as the characterization and number of invariant elements. In this paper, we analyze some recent works on this action and provide full generalizations of them, yielding final theoretical results on the characterization and number of invariant elements.
In this paper we show how a theorem of Jantzen relating the character of a finite dimensional irreducible representation of a disconnected semisimple algebraic group on elements outside the connected component of identity to character of an irreducible representation of another connected semisimple algebraic group can be deduced from properties of the canonical bases.
The largest prime factor of an irreducible cubic polynomial
将Heath-Brown关于$n^3+2$存在大于$n^{1+c}$的素因子的结论推广到任意首一不可约三次整系数多项式，并给出依赖于多项式的指数$c_p$。
We study the explicit factorization of $2^n r$-th cyclotomic polynomials over finite field $\mathbb{F}_q$ where $q, r$ are odd with $(r, q) =1$. We show that all irreducible factors of $2^n r$-th cyclotomic polynomials can be obtained easily from irreducible factors of cyclotomic polynomials of small orders. In particular, we obtain the explicit factorization of $2^n 5$-th cyclotomic polynomials over finite fields and construct several classes of irreducible polynomials of degree $2^{n-2}$ with fewer than 5 terms. The reciprocals of these irreducible polynomials are irreducible polynomials of …
Schinzel's Hypothesis H is a general conjecture in number theory on prime values of polynomials that generalizes, e.g., the twin prime conjecture and Dirichlet's theorem on primes in arithmetic progression. We prove an arithmetic analog of this conjecture for polynomial rings over pseudo algebraically closed fields. This implies results over large finite fields. A main tool in the proof is an irreducibility theorems à la Hilbert.
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 $\{α,α^q,\dots,α^{q^{n-1}}\}$. An irreducible polynomial in $\mathbb{F} _q[x]$ is called an $N$-polynomial if its roots are linearly independent over $\mathbb{F} _q$. Let $p$ be the characteristic of $\mathbb{F} _q$. Pelis et al. showed that every monic irreducible polynomial with degree $n$ and nonzero trace is an $N$-polynomial provided that $n$ is either a power of $p$ or a prime differe…
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 further provide some applications of our main result, including lower bounds for the number of irreducible factors of $f(L(x))$, constructions of high degree irreducible polynomials and the explicit factorization of $f(x^q-x)$ under certain conditions on $f(x)$.
Irreducible Polynomials with Coefficients in an Affine Algebraic Set
本文研究了系数在仿射代数集中的有限域上不可约多项式的误差界问题。
Let $n$ be a positive integer and let $\mathbb F_{q^n}$ be the finite field with $q^n$ elements, where $q$ is a power of a prime. This paper introduces a natural action of the Projective Semilinear Group $\text{P}Γ\text{L}(2, q^n)=\text{PGL}(2, q^n)\rtimes \text{Gal}(\mathbb{F}_{q^n}/\mathbb{F}_q)$ on the set of monic irreducible polynomials over the finite field $\mathbb{F}_{q^n}$. Our main results provide information on the characterization and number of fixed points.
Counting Irreducible polynomials with coefficients from thin subgroups
本文提出了一种新的方法，用于计数具有系数来自有限域F_q小子群的不可约多项式，并扩展了该方法以考虑判别式的预设条件。
Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready to spill two of their secrets: (i) There exists a unique "base-$x$" representation of such polynomials that makes the ring $\mathbb{Z}[x]$ into an ordered domain; and (ii) There is a 1-1 correspondence between positive rational primes $p$ and certain infinite sets of irreducible polynomials $f(x)$ that attain the value $p$ at sufficiently large $x$, each ge…
On dynamical irreducible set of polynomials
研究有限域上多项式动态不可约性，证明充要条件，给出$\mathbb{F}_{p^p}$上显式构造，确立$\mathbb{F}_q$上大小至少为$p^2$的集的存在性并给出测试集基数界限。
Monogenity of the irreducible factors of $(k,t)$-Fibonacci and $(k,t)$-Lucas polynomials
本文利用 Dickson 多项式与分圆域的联系，证明了广义 $(k,t)$-Fibonacci 和 $(k,t)$-Lucas 多项式不可约因子生成数域的单项性，并推广至经典 Fibonacci、Lucas 及 Chebyshev 多项式。
The problem of constructing a perfect cuboid is related to a certain class of univariate polynomials with three integer parameters $a$, $b$, and $u$. Their irreducibility over the ring of integers under certain restrictions for $a$, $b$, and $u$ would mean the non-existence of perfect cuboids. This irreducibility is conjectured and then verified numerically for approximately 10000 instances of $a$, $b$, and $u$.
In this note, we prove an irreducibility criterion for the polynomial of the form $f(x) = a_{n}x^{n} + a_{n-1}x^{n-1} + \cdots + a_{m}x^{m} + p^{u} \in \mathbb{Z}[x]$, where $p$ is a prime number, $u \geqslant 1$, $\gcd(u, m) = 1$, $p \nmid a_{m}$ and $p^{u} > |a_{n}| + |a_{n-1}| + \cdots + |a_{m}|$. In particular, we show that the conjecture of Koley and Reddy is true.
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 coset of a subgroup <g^s>, s|(q-1). We give the number explicitly for s=2, 3, 4 when q=p, and for s|(p^e+1) when r=2en. Finally, we give explicit formulae for the number when both trace and norm are fixed, p=2 and m =< 30.
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 results with the analogous existing ones in the integer case, where one studies all the natural numbers up to $x$ with exactly $k$ prime factors. In particular, we show that the number of monic polynomials grows at a surprisingly higher rate when $k$ is a little larger than $\log n$ than what one would speculate from looking at the integer case.
We provide upper bounds for the sum of the multiplicities of the non-constant irreducible factors that appear in the canonical decomposition of a polynomial $f(X)\in\mathbb{Z}[X]$, in case all the roots of $f$ lie inside an Apollonius circle associated to two points on the real axis with integer abscissae $a$ and $b$, with ratio of the distances to these points depending on the admissible divisors of $f(a)$ and $f(b)$. In particular, we obtain such upper bounds for the case where $f(a)$ and $f(b)$ have few prime factors, and $f$ is an Eneström-Kakeya polynomial, or a Littlewood polynomial, or …
We give a method of constructing polynomials of arbitrarily large degree irreducible over a global field F but reducible modulo every prime of F. The method consists of finding quadratic f in F[x] whose iterates have the desired property, and it depends on new criteria ensuring all iterates of f are irreducible. In particular when F is a number field in which the ideal (2) is not a square, we construct infinitely many families of quadratic f such that every iterate f^n is irreducible over F, but f^n is reducible modulo all primes of F for n at least 2. We also give an example for each n of a q…
Bilinear Kloosterman sums in function fields and the distribution of irreducible polynomials
本文通过改进双线性Kloosterman和的界，拓展了不可约多项式分布的水平，并给出了超越1/2的Bombieri-Vinogradov定理的类比。
Let $\F_q$ be the finite field with $q$ elements, $p=\Char \F_q$. The group $\GL_2(\F_q)$ acts naturally in the set of irreducible polynomials over $\F_q$ of degree at least $2$. In this paper we are interested in the characterization and number of the irreducible polynomials that are fixed by the elements of a subgroup $H$ of $\GL_2(\F_q)$. We make a complete characterization of the fixed polynomials in the case when $H$ has only elements of the form $\left(\begin{matrix} 1&b\\ 0&1 \end{matrix}\right)$, corresponding to translations $x\mapsto x+b$ and, as a consequence, the case when $H$ is a…
In this paper, we show that for each $n\geq 1$, the generalised Hermite-Laguerre Polynomials $G_{\frac{1}{4}}$ and $G_{\frac{3}{4}}$ are either irreducible or linear polynomial times an irreducible polynomial of degree $n-1$.
We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.
A second order polynomial sequence is of Fibonacci-type $\mathcal{F}_{n}$ (Lucas-type $\mathcal{L}_{n}$) if its Binet formula has a structure similar to that for Fibonacci (Lucas) numbers. Under certain conditions these polynomials are irreducible if and only if $n$ is a prime number. For example, the Fibonacci polynomials, Pell polynomials, Fermat polynomials, Lucas polynomials, Pell-Lucas polynomials, Fermat-Lucas polynomials are irreducible when $n$ is a prime number; and Chebyshev polynomials (second kind), Morgan-Voyce polynomials (Fibonacci type), and Vieta polynomials are reducible when…
Monogenity of Fibonacci polynomials and Lucas polynomials
研究Fibonacci多项式F_n(x)和Lucas多项式L_n(x)的不可约因子的单生成性，证明对所有奇数n，F_n(x)的不可约因子是单生成的；对所有偶数n，L_n(x)的不可约因子是单生成的。
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 $24$ as a function of $n$, after a suitable normalization. A similar result holds over $\mathbb{F}_{5^r}$, with the period being $60$. We also show that this is a phenomena unique to characteristics $2$ and $5$. The result is strongly related to the supersingularity of certain curves associated with cyclotomic function fields, and in particular it complements a…
We suggest a construction of the minimal polynomial $m_{β^k}$ of $β^k\in \mathbb F_{q^n}$ over $\mathbb F_q$ from the minimal polynomial $f= m_β$ for all positive integers $k$ whose prime factors divide $q-1$. The computations of our construction are carried out in $\mathbb F_q$. The key observation leading to our construction is that for $k \mid q-1$ holds $$m_{β^k}(X^k) = \prod_{j=1}^{\frac kt} ζ_k^{-jn} f (ζ_k^j X),$$ where $t= \max \{m\mid \gcd(n,k): f (X) = g (X^m), g \in \mathbb F_q[X]\}$ and $ζ_{k}$ is a primitive $k$-th root of unity in $\mathbb F_q$. The construction allows to constru…
Irreducible trinomials of given degree n over $F_2$ do not always exist and in the cases that there is no irreducible trinomial of degree n it may be effective to use trinomials with an irreducible factor of degree n. In this paper we consider some conditions under which irreducible polynomials divide trinomials over $F_2$. A condition for divisibility of self-reciprocal trinomials by irreducible polynomials over $F_2$ is established. And we extend Welch's criterion for testing if an irreducible polynomial divides trinomials $x^m+x^s+1$ to the trinomials $x^{am}+x^{bs}+1$.
The Proportion of Irreducible p-adic Polynomials
本文研究首一 $p$-adic 多项式中不可约多项式的精确占比，并在 n 为素数且 $p\ eq n$、以及 $n=4$ 且 $p\ eq2$ 时给出关于 p 的有理函数表达式。
In this paper we deal with the construction of sequences of irreducible polynomials with coefficients in finite fields of even characteristic. We rely upon a transformation used by Kyuregyan in 2002, which generalizes the $Q$-transform employed previously by Varshamov and Meyn for the synthesis of irreducible polynomials. While in the iterative procedure described by Kyuregyan the coefficients of the initial polynomial of the sequence have to satisfy certain hypotheses, in the present paper we construct infinite sequences of irreducible polynomials of non-decreasing degree starting from any ir…
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 proofs involve counting the number of points on certain algebraic curves over finite fields, a technique which arose from Fourier-analysing the known formulae for the $\mathbb{F}_2$ base field cases, reverse-engineering an economical new proof and then extending it. This approach gives rise to fibre products of supersingular curves and makes explicit why the fo…
Rudin-Shapiro function along irreducible polynomials over finite fields
本文在有限域 $\mathbb{F}_q$ 的首一多项式上定义了 Rudin-Shapiro 函数，并证明当次数 $n$ 趋于无穷时，该函数在不可约多项式上取任意值的数量均渐近于 $q^{n-1}/n$。
We study the number of prime polynomials of degree $n$ over $\mathbb{F}_q$ in which the $i^{th}$ coefficient is either preassigned to be $a_i \in \mathbb{F}_q$ or outside a small set $S_i \subset \mathbb{F}_q$. This serves as a function field analogue of a recent work of Maynard, which counts integer primes that do not have specific digits in their base-$q$ expansion. Our work relates to Pollack's and Ha's work, which count the amount of prime polynomials with $\ll \sqrt{n}$ and $\ll n$ preassigned coefficients, respectively. Our result demonstrates how one can prove asymptotics of the number …
Superpolynomially Large Support in Every Irreducible Factor of Lacunary Polynomials
本文证明存在无穷多个仅含m个非零系数的有理系数多项式，其每个不可约因子都含指数级（exp(Ω(√(m/log m)))）非零系数，表明乘法与幂、复合等运算的稀疏性原理截然不同，并给出无条件、与次数无关的稀疏分解障碍。
In this paper we extend to the function field setting the heuristics formerly developed by Conrey, Farmer, Keating, Rubinstein and Snaith, for the integral moments of $L$-functions. We also adapt to the function setting the heuristics first developed by Conrey, Farmer and Zirnbauer to the study of mean values of ratios of $L$-functions. Specifically, the focus of this paper is on the family of quadratic Dirichlet $L$-functions $L(s,χ_{P})$ where the character $χ$ is defined by the Legendre symbol for polynomials in $\mathbb{F}_{q}[T]$ with $\mathbb{F}_{q}$ a finite field of odd cardinality and…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。