相关论文: Irreducibility of generalized Hermite-Laguerre Pol…

For a positive integer $n$ and a real number $\alpha$, the generalized Laguerre polynomials are defined by \begin{align*} L^{(\alpha)}_n(x)=\sum^n_{j=0}\frac{(n+\alpha)(n-1+\alpha)\cdots (j+1+\alpha)(-x)^j}{j!(n-j)!}. \end{align*} These…

For a rational $q=u+\frac{\alpha}{d}$ with $u, \alpha, d\in \ACOBZ$ with $u\ge 0, 1\le \alpha<d$, $\gcd(\alpha, 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}(\alpha…

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…

For $n \geq 3$ and $s \leq 92$, it is proved in \cite{ShSi} that, except for finitely many pairs $(n, s), G_1(x) = G_1(x, n, s) $ is either irreducible or linear factor times an irreducible polynomial. If $s \leq 30$, we determine here…

We prove that the generalised Laguerre polynomials $L_{n}^{(\alpha)}(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…

We consider the irreducibility of polynomial $L_n^{(\alpha)} (x) $ where $\alpha$ is a negative integer. We observe that the constant term of $L_n^{(\alpha)} (x) $ vanishes if and only if $n \geq |\alpha| = -\alpha$. Therefore we assume…

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…

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…

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

Using the theory of Newton Polygons, we formulate a simple criterion for the Galois group of a polynomial to be ``large.'' For a fixed $\alpha \in \Q - \Z_{<0}$, Filaseta and Lam have shown that the $n$th degree Generalized Laguerre…

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…

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…

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].

We show that for a random polynomial \[ F(X) = \sum_{n=1}^{N} f(n) X^{n-1}, \] where $f(n)$ is a random completely multiplicative function taking values in $\{\pm 1\}$, one has \[ \limsup_{N \to \infty} \mathbb{P}\big[F(X) \text{ is…

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…

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…

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…

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

This paper investigates whether or not polynomials that are irreducible over $\mathbb{Q}$ and $\mathbb{Z}$ can remain irreducible under substitution by all quadratic polynomials. It answers this question in the negative in the degree 2 and…

Let $m\geq 1$ and $a_m$ be integers. Let $\alpha$ be a rational number which is not a negative integer such that $\alpha = \frac{u}{v}$ with $\gcd(u,v) = 1, v>0$. Let $\phi(x)$ belonging to $\Z[x]$ be a monic polynomial which is irreducible…