Anca Iuliana Bonciocat, Alexandru Zaharescu
We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions of polynomials.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We study certain kind of polynomials associated with Lissajous curves, called Chebyshev-Lissajous polynomials. We investigate their irreducibilities over the real numbers and complex numbers, thus comfirming two conjectures proposed by Merino.
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$.
The Krawtchouck polynomials arise naturally in both coding theory and probability theory and have been studied extensively from these points of view. However, very little is known about their irreducibility and Galois properties. Just like many classical families of orthogonal polynomials (e.g. the Legendre and Laguerre), the Krawtchouck polynomials can be viewed as special cases of Jacobi polynomials. In this paper we determine the Newton Polygons of certain Krawtchouck polynomials and show that they are very similar to those of the Legendre polynomials (and exhibit new cases of irreducibilit…
A polynomial $f(x)\in {\mathbb Z}[x]$ of degree $N$ is called \emph{monogenic} if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,θ,θ^2,\ldots ,θ^{N-1}\}$ is a basis for the ring of integers of ${\mathbb Q}(θ)$, where $f(θ)=0$. Define ${\mathcal F}(x):=x^m+Ax^{m-1}+B$. In this article, we determine sets of conditions on $m$, $A$, and $B$, such that the power-compositional trinomial ${\mathcal F}(x^{p^n})$ is monogenic for all integers $n\ge 0$ and a given prime $p$. Furthermore, we prove the actual existence of infinite families of such trinomials ${\mathcal F}(x)$.
We prove the irreducibility of integer polynomials $f(X)$ whose roots lie inside an Apollonius circle associated to two points on the real axis with integer abscisae $a$ and $b$, with ratio of the distances to these points depending on the canonical decomposition of $f(a)$ and $f(b)$. In particular, we obtain irreducibility criteria for the case where $f(a)$ and $f(b)$ have few prime factors, and $f$ is either an Eneström-Kakeya polynomial, or has a large leading coefficient. Analogous results are also provided for multivariate polynomials over arbitrary fields, in a non-Archimedean setting.
We consider the irreducibility of Generalised Laguerre Polynomials for negative integral values given by $L_n^{(-1-n-s)}(x)=\displaystyle\sum_{j=0}^{n}\binom{n-j+s}{n-j}\frac{x^j}{j!}.$ For different values of $s,$ this family gives polynomials which are of great interest. It was proved earlier that for $0 \leq s \leq 60,$ these polynomials are irreducible over $\mathbb{Q}.$ In this paper we improve this result upto $s \leq 88.$
We give a new proof of the Brawley-Carlitz theorem on irreducibility of the composed products of irreducible polynomials. Our proof shows that associativity of the binary operation for the composed product is not necessary. We then investigate binary operations defined by polynomial functions, and give a sufficient condition in terms of degrees for the requirement in the Brawley-Carlitz theorem.
In this article, we consider the polynomials of the form $f(x)=a_0+a_1x+a_2x^2+\cdots+a_nx^n\in \mathbb{Z}[x],$ where $|a_0|=|a_1|+\dots+|a_n|$ and $|a_0|$ is a prime. We show that these polynomials have a cyclotomic factor whenever reducible. As a consequence, we give a simple procedure for checking the irreducibility of trinomials of this form and separability criterion for certain quadrinomials.
Let $E_k$ be the normalized Eisenstein series of weight $k$ on $\mathrm{SL}_{2}(\mathbb{Z})$. Let $φ_k$ be the polynomial that encodes the $j$-invariants of non-elliptic zeros of $E_k$. In 2001, Gekeler observed that the polynomials $φ_k$ seem to be irreducible (and verified this claim for $k\leq 446$). We show that $φ_k$ is irreducible for infinitely many $k$.
For a real polynomial $f$ we present explicit zero-free angular sectors in the complex plane, symmetric with respect to the real axis, with angles depending only on the degree of $f$, and vertices expressed in terms of the coefficients of $f$. We also describe zero-free lens-shaped regions for $f$ that are associated to the zero-free sectors of the reciprocal of $f$. As an application, we use these zero-free regions to obtain irreducibility criteria for polynomials with integer coefficients that take a prime or a prime power value.
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…
On the irreducibility of the non-cyclotomic part of most 0,1-polynomials with few terms
本文对Schinzel的结果给出另一种证明：对固定项数k≥2，几乎所有正整数指数选择下，少项0,1多项式去掉分圆因子后不可约。
Let T_{n,k}(X) be the characteristic polynomial of the n-th Hecke operator acting on the space of cusp forms of weight k for the full modular group. We show that if there exists n>1 such that T_{n,k}(X) is irreducible and has the full symmetric group as Galois group, then the same is true of T_{p,k}(X) for all primes p.
We prove a quantitative version of Hilbert's irreducibility theorem for function fields: If $f(T_1,\ldots, T_n,X)$ is an irreducible polynomial over the field of rational functions over a finite field $\mathbb{F}_q$ of characteristic $p$, then the proportion of $n$-tuples $(t_1,\ldots, t_n)$ of monic polynomials of degree $d$ for which $f(t_1,\ldots, t_n,X)$ is reducible out of all $n$-tuples of degree $d$ monic polynomials is $O(dq^{-d/2})$.
Quantitative Hilbert irreducibility and almost prime values of polynomial discriminants
本文结合 Fourier 分析与算术方法，研究 Galois 群含于 A_n 的 n 次多项式的定量 Hilbert 不可约性，并给出判别式为殆素数的首一多项式及数域数量的下界。
Let $P(T,X)$ be an irreducible polynomial in two variables with rational coefficients. It follows from Hilbert's Irreducibility Theorem that for most rational numbers $t$ the specialized polynomial $P(t,X)$ is irreducible and has the same Galois group as $P$. We discuss here a method for obtaining an explicit description of the set of exceptional numbers $t$, i.e., those for which $P(t,X)$ is either reducible or has a different Galois group than $P$. To illustrate the method we determine the exceptional specializations of two polynomials of degrees four and six.
Irreducibility of Polynomials with Square Coefficients over Finite Fields
本文研究有限域上系数均匀取自平方元的随机多项式的不可约性，证明当域大小趋于无穷时其不可约概率渐近为 $1/n + O(q^{-1/2})$，并将分析方法推广到其他特定系数集合。
For a rational $q=u+\fracα{d}$ with $u, α, d\in \ACOBZ$ with $u\ge 0, 1\le α<d$, $\gcd(α, d)=1$, the \emph{generalized Hermite-Laguerre polynomials $G_q(x)$} are defined by \begin{align*} G_q(x)&=a_nx^n+a_{n-1}(α+(n-1+u)d)x^{n-1}+\cdots\\ &\quad+a_1\left(\prod^{n-1}_{i=1}(α+(i+u)d)\right)x+a_0 \left(\prod^{n-1}_{i=0}(α+(i+u)d)\right) \end{align*} where $a_0, a_1, \cdots, a_n$ are arbitrary integers. We prove some irreducibility results of $G_q(x)$ when $q\in \{\frac{1}{3}, \frac{2}{3}\}$ and extend some of the earlier irreducibility results when $q$ of the form $u+\frac{1}{2}$. We also prove a…
For a class of polynomials $f \in \mathbb{Z}[X]$, which in particular includes all quadratic polynomials, and also trinomials of some special form, we show that, under some natural conditions (necessary for quadratic polynomials), the set of primes $p$ such that all iterations of $f$ are irreducible modulo $p$ is of relative density zero. Furthermore, we give an explicit bound on the rate of the decay of the density of such primes in an interval $[1, Q]$ as $Q \to \infty$. For this class of polynomials this gives a more precise version of a recent result of A. Ferraguti (2018), which applies t…
Monte-Carlo Irreducibility and Imprimitivity Detection of Polynomials over $\mathbb{Q}$
本文提出了一种高效的蒙特卡洛算法，用于检测有理数域上多项式的算术不可约性，并通过子域提取提供构造性代数证书。
Dynamical Irreducibility of Certain Families of Polynomials over Finite Fields
本研究确定了有限域上单临界点多项式动力学不可约的充要条件，拓展了已有相关研究结果，并进一步探究了三次多项式和移位线性化多项式的动力学不可约条件。
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 irreducible over $\mathbb Q$, where $c, d \in \mathbb Z[x]$ are polynomials with nonzero constant terms and satisfying suitable conditions. As an application, we show that $x^N - k x^2 + 1$ is irreducible for all $N \ge 5$ and $k \in \{3, 4, \ldots, 24\} \setminus \{9, 16\}$. We also give a complete description of the factorization of polynomials of the form $x^N + …
For positive integers $n>k$, let $P_{n,k}(x)=\displaystyle\sum_{j=0}^k \binom{n}{j}x^j $ be the polynomial obtained by truncating the binomial expansion of $(1+x)^n$ at the $k^{th}$ stage. These polynomials arose in the investigation of Schubert calculus in Grassmannians. In this paper, the authors prove the irreducibility of $P_{n,k}(x)$ over the field of rational numbers when $2\leqslant 2k \leqslant n<(k+1)^3$.
The famous irreducibility criteria of Schönemann-Eisenstein and Dumas rely on information on the divisibility of the coefficients of a polynomial by a single prime number. In this paper we provide several irreducibility criteria of Schönemann-Eisenstein-Dumas-type for polynomials with integer coefficients, criteria that are given by some divisibility conditions for their coefficients with respect to arbitrarily many prime numbers. A special attention will be paid to those irreducibility criteria that require information on the divisibility of the coefficients by two distinct prime numbers.
For integers $a_0,a_1,\ldots,a_n$ with $|a_0a_n|=1$ and either $α=u$ with $1\leq u \leq 50$ or $α=u+ \frac{1}{2}$ with $1 \leq u \leq 45$, we prove that $ψ_n^{(α)}(x;a_0,a_1,\cdots,a_n)$ is irreducible except for an explicit finite set of pairs $(u,n)$. Furthermore all the exceptions other than $n=2^{12},α=89/2$ are necessary. The above result with $0\leqα\leq 10$ is due to Filaseta, Finch and Leidy and with $α\in \{-1/2,1/2\}$ due to Schur.
For a positive integer $n$ and a real number $α$, the generalized Laguerre polynomials are defined by \begin{align*} L^{(α)}_n(x)=\sum^n_{j=0}\frac{(n+α)(n-1+α)\cdots (j+1+α)(-x)^j}{j!(n-j)!}. \end{align*} These orthogonal polynomials are solutions to Laguerre's Differential Equation which arises in the treatment of the harmonic oscillator in quantum mechanics. Schur studied these Laguerre polynomials for its interesting algebraic properties. He obtained irreducibility results of $L^{(\pm \frac{1}{2})}_n(x)$ and $L^{(\pm \frac{1}{2})}_n(x^2)$ and derived that the Hermite polynomials $H_{2n}(x)…
Irreducibility criteria for pairs of polynomials whose resultant is a prime number
本文针对结式为素数或含大素因子的整数系数多项式对，给出不可约性判据，并推广至二元多项式对，通过结式分解与根距上界不可约因子个数。
In this paper, we classify, up to three possible exceptions, all monic, post-critically finite quadratic polynomials $f(x)\in \mathbb{Z}[x]$ with an iterate reducible module every prime, but all of whose iterates are irreducible over $\mathbb{Q}$. In particular, we obtain infinitely many new examples of the phenomenon studied in \cite{Jones}. While doing this, we also find, up to three possible exceptions, all integers $a$ such that all iterates of the quadratic polynomial $(x+a)^2-a-1$ are irreducible over $\mathbb{Q}$, which answers a question posed in \cite{AyadMcdonald}, except for three v…
We give a new proof of the Hansen-Mullen irreducibility conjecture. The proof relies on an application of a (seemingly new) sufficient condition for the existence of elements of degree $n$ in the support of functions on finite fields. This connection to irreducible polynomials is made via the least period of the discrete Fourier transform (DFT) of functions with values in finite fields. We exploit this relation and prove, in an elementary fashion, that a relevant function related to the DFT of characteristic elementary symmetric functions (which produce the coefficients of characteristic polyn…
A study of some recent irreducibility criteria for polynomials having integer coefficients
该研究针对有理数域上的整系数多项式，梳理介绍了其相关的最新不可约性检验准则，为数论领域多项式不可约性的判定研究提供了近期成果的梳理参考。
Irreducibility of Generalised Laguerre Polynomials for Large Integer Parameters
本文针对正整数参数n的广义拉盖尔多项式，通过推导潜在整数根的严格约束并运用牛顿多边形几何性质，将其在有理数域上不可约的参数范围从$0 \le a \le 50$大幅扩展至$a \le 1000$。
In this paper we obtain new quantitative forms of Hilbert's Irreducibility Theorem. In particular, we show that if $f(X, T_1, \ldots, T_s)$ is an irreducible polynomial with integer coefficients, having Galois group $G$ over the function field $\mathbb{Q}(T_1, \ldots, T_s)$, and $K$ is any subgroup of $G$, then there are at most $O_{f, \varepsilon}(H^{s-1+|G/K|^{-1}+\varepsilon})$ specialisations $\mathbf{t} \in \mathbb{Z}^s$ with $|\mathbf{t}| \le H$ such that the resulting polynomial $f(X)$ has Galois group $K$ over the rationals.
We study the irreducibility of Wronskian Hermite polynomials labelled by partitions. It is known that these polynomials factor as a power of x times a remainder polynomial. We show that the remainder polynomial is irreducible for the partitions (n, m) with m <= 2, and (n, n) when n + 1 is a square. Our main tools are two theorems that we prove for all partitions. The first result gives a sharp upper bound for the slope of the edges of the Newton polygon for the remainder polynomial. The second result is a Schur-type congruence for Wronskian Hermite polynomials. We also explain how irreducibili…
Irreducibility and locus of complex roots of polynomials related to Fermat's Last Theorem
研究有理数a下多项式x^n+(1-x)^n+a^n的不可约性，证明多个无穷族的不可约性，并分析复根位置，同时揭示a=±1时与Cauchy-Mirimanoff多项式及Nanninga多项式的因式分解关系。
Irreducibility of polynomials defining parabolic parameters of period 3
本文证明了周期3的delta因子不可约，并展示了周期大于3时存在无穷多个不可约delta因子，解决了Morton和Vivaldi猜想在周期3的情形。
We study the algebraic properties of Generalized Laguerre polynomials for negative integral values of a given parameter which is $L_{n}^{(-1-n-r)}(x)= \sum\limits_{j=0}^{n} \binom{n-j+r}{n-j} \frac{x^{j}}{j!}$ for integers $r\geq 0, n\geq 1$. For different values of parameter $r$, this family provides polynomials which are of great interest. Hajir conjectured that for integers $r\geq 0$ and $n\geq 1$, $L_{n}^{(-1-n-r)}(x)$ is an irreducible polynomial whose Galois group contains $A_n$, the alternating group on $n$ symbols. Extending earlier results of Schur, Hajir, Sell, Nair and Shorey, we co…
We prove that the generalised Laguerre polynomials $L_{n}^{(α)}(x)$ with $0\le \al\le 50$ are irreducible except for finitely many pairs $(n, \al)$ and that these exceptions are necessary. In fact it follows from a more general statement.
In the first article of this series we have presented the history of auxiliary primes from Legendre's proof of the quadratic reciprocity law up to Artin's reciprocity law. We have also seen that the proof of Artin's reciprocity law consists of several steps, the first of which is the verification of the reciprocity law for cyclotomic extensions. In this article we will show that this step can be identified with one of Dedekind's proofs of the irreducibility of the cyclotomic polynomial.
On the irreducibility of $f(2^n,3^m,X)$ and other such polynomials
本文研究将不可约整系数多项式中的参数替换为整数幂后的不可约性，在分歧条件并依赖广义黎曼猜想的情形下，证明了对几乎所有指数组合所得有理系数多项式仍不可约。
It is known that random monic integral polynomials of bounded degree $d$ and integral coefficients distributed uniformly and independently in $[-H,H]$ are irreducible over $\mathbb{Z}$ with probability tending to $1$ as $H\to \infty$. In this paper, we give a general criterion for guaranteeing the same conclusion under much more general coefficient distributions, allowing them to be nonuniformly and dependently distributed over arbitrary sets.
Irreducibility of polynomials with random multiplicative coefficients revisited
本文针对取值于{±1}的随机完全乘法函数构成的多项式，证明其不可约概率的上极限随次数趋于无穷时等于1，推进了随机乘法系数多项式不可约性的研究。
Irreducibility of lacunary polynomials with 0,1 coefficients
本文证明了高次且项数较少的0,1-系数缺项多项式在均匀分布下以高概率不可约，并给出了其可约概率在极限下趋于0的严格数学证明。
We consider random polynomials with independent identically distributed coefficients with a fixed law. Assuming the Riemann hypothesis for Dedekind zeta functions, we prove that such polynomials are irreducible and their Galois groups contain the alternating group with high probability as the degree goes to infinity. This settles a conjecture of Odlyzko and Poonen conditionally on RH for Dedekind zeta functions.
The Odlyzko-Poonen Conjecture on Irreducibility of Random Polynomials
本文无条件证明了Odlyzko-Poonen猜想：系数从{0,1}独立均匀选取的首一多项式，在次数趋于无穷时不可约概率趋于1。
Integral Specializations of Polynomials: Hilbert Irreducibility, Coprimality, and Density
本文重新证明并强化了整体域整数环$\boldsymbol{\textit{O}}_K$的整希尔伯特性质，证明其整希尔伯特子集具正密度，推广了Ekedahl–Poonen公式并得到算术级数有界高度点估计。
We consider the question of certifying that a polynomial in ${\mathbb Z}[x]$ or ${\mathbb Q}[x]$ is irreducible. Knowing that a polynomial is irreducible lets us recognise that a quotient ring is actually a field extension (equiv.~that a polynomial ideal is maximal). Checking that a polynomial is irreducible by factorizing it is unsatisfactory because it requires trusting a relatively large and complicated program (whose correctness cannot easily be verified). We present a practical method for generating certificates of irreducibility which can be verified by relatively simple computations; we…
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$.
A new criterion for the absolute irreducibility of multivariate polynomials over finite fields
本文提出了一种新的判据，用于判断有限域上由多变量多项式定义的超曲面的绝对不可约性，无需测试基域或扩展域的不可约性，仅需多变量GCD计算和平方自由性质。
Given a global field $K$ and a positive integer $n$, we present a diophantine criterion for a polynomial in one variable of degree $n$ over $K$ not to have any root in $K$. This strengthens the known result that the set of non-$n$-th-powers in $K$ is diophantine when $K$ is a number field. We also deduce a diophantine criterion for a polynomial over $K$ of given degree in a given number of variables to be irreducible. Our approach is based on a generalisation of the quaternion method used by Poonen and Koenigsmann for first-order definitions of $\mathbb{Z}$ in $\mathbb{Q}$.
Let T^{N,chi}_{p,k}(x) be the characteristic polynomial of the Hecke operator T_p acting on the space of cusp forms S_k(N,chi). We describe the factorization of T^{N,chi}_{p,k}(x) mod l as k varies, and we explicitly calculate those factorizations for N=1 and small l. These factorizations are used to deduce the irreducibility of certain T^{1,1}_{q,k}(x) from the irreducibility of T^{1,1}_{2,k}(x).
We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic polynomials. Our data supports conjectures made by Odlyzko and Poonen and by Konyagin, and we formulate a universality heuristic and new conjectures that connect their work with Hilbert's Irreducibility Theorem and work of van der Waerden. The data indicates that the probability that a random polynomial is reducible divided by the probability that there is …
Galois groups over rational function fields and explicit Hilbert irreducibility
该文研究有理系数二元多项式在有理函数域上的伽罗瓦群，提出计算该群及显式刻画使特化多项式伽罗瓦群或因式分解异常的有理数的方法，通过实例验证并将其应用于证明算术动力学的新结论。
A generalized Dumas irreducibility criterion
将经典杜马斯不可约性结果推广到任意秩的Krull赋值域上的多项式，证明其分解定理及因子次数下界，统一并改进了多个已知不可约性结果。
Let P_nk(x) denote the sum of the lowest k+1 terms in the expansion of (1+x)^n. We investigate the irreducibility of P_nk(x) and more general univariate polynomials related to it. Polynomials P_nk(x) naturally arise in Schubert calculus, see ArXiv e-print math.RT/0409329 by I.Scherbak.
In this article we study the irreducibility of polynomials of the form $x^n+ε_1 x^m+p^kε_2$, $p$ being a prime number. We will show that they are irreducible for $m=1$. We have also provided the cyclotomic factors and reducibility criterion for trinomials of the form $x^n+ε_1x^m+ε_2$, where $ε_i\in \{\, -1,+1\,\}$. This corrects few of the existing results of W. Ljuggren's on $x^n+ε_1x^m+ε_2$.
Irreducibility of Littlewood polynomials of special degrees
本文研究 Littlewood 多项式的不可约性，无条件证明了其不可约概率的上极限随次数趋于无穷时为 1，部分证实了此前仅在 GRH 下成立的民间猜想。
Irreducibility of the characteristic polynomials of random tridiagonal matrices
在某些戴德金ζ函数黎曼假设成立的条件下，证明了大维随机三对角矩阵特征多项式不可约的概率指数级接近1且伽罗瓦群为对称或交错群，对应了其他随机矩阵类结果并分析了伽罗瓦群更小的相关矩阵类。
We present an elementary proof that the Schur polynomial corresponding to an increasing sequence of exponents (c_0,..., c_{n-1}) with c_0 = 0 is irreducible over every field of characteristic p whenever the numbers d_i = c_{i+1} - c_i are all greater than 1, not divisible by p, and satisfy gcd(d_i, d_{i+1}) = 1 for every i.
On the frequency of primes preserving dynamical irreducibility of polynomials
本文针对算术动力学中多项式迭代模素数不可约性的素数密度问题，通过使用 Selberg 筛法改进了以往基于 Brun 筛法的结果，在部分情况下实现了显著的定量提升。
Irreducibility via location of zeros
本文通过在系数上施加Perron型充分条件，获得了几类零点位于原点开圆盘内或闭合环状区域外的整数系数不可约多项式。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。