相关论文: On the irreducibility of a truncated binomial expa…

In this paper we give an introduction on how one can extend a valuation from a field $K$ to the polynomial ring $K[x]$ in one variable over $K$. This follows a similar line as the one presented by the author in his talk at ALaNT 5. We will…

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…

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…

For a fixed integer N, and fixed numbers b_1,...,b_N, we consider sequences, the nth term (a_n) of which is the sum of the squares of the terms in the expansion of (b_1 + ... + b_N)^n. In the case all b_i=1, we give a formula for a…

We explore new types of binomial sums with Fibonacci and Lucas numbers. The binomial coefficients under consideration are $\frac{n}{n+k}\binom{n+k}{n-k}$ and $\frac{k}{n+k}\binom{n+k}{n-k}$. The identities are derived by relating the…

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…

Let $P_1,...,P_n$ be generic homogeneous polynomials in $n$ variables of degrees $d_1,...,d_n$ respectively. We prove that if $\nu$ is an integer satisfying ${\sum_{i=1}^n d_i}-n+1-\min\{d_i\}<\nu,$ then all multivariate subresultants…

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…

We study the polynomials $x^n + (1-x)^n + a^n, a \in\mathbb{Q}$, whose rational roots would yield counterexamples to Fermat's Last Theorem. We investigate their factorization over $\mathbb{Q}$. In the case $a \notin \{0, \pm 1\}$, we ask…

We investigate the computational complexity of deciding whether a given univariate integer polynomial p(x) has a factor q(x) satisfying specific additional constraints. When the only constraint imposed on q(x) is to have a degree smaller…

We analyze the sequence of polynomials defined by the differential-difference equation $P_{n+1}(x)=P_{n}^{\prime}(x)+x(n+1)P_{n}(x)$ asymptotically as $n\to\infty$. The polynomials $P_{n}(x)$ arise in the computation of higher derivatives…

We present a theorem about irreducibility of a polynomial that is the resultant of two others polynomials. The proof of this fact is based on the field theory. We also consider the converse theorem and some examples.

We obtain similar types of conclusions as that of Br\"{u}ck [1] for two differential polynomials which in turn radically improve and generalize several existing results. Moreover, a number of examples have been exhibited to justify the…

Here Euler notes the recursive relation for the general binomial coefficients, by assuming that (1+x)^a can be expanded in a power series.

We define a truncated Euler polynomial $E_{m,n}(x)$ as a generalization of the classical Euler polynomial $E_n(x)$. In this paper we give its some properties and relations with the hypergeometric Bernoulli polynomial.

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…

Let $p$ be a prime number. As a standard application of the irreducibility criterion of Eisenstein, it is well known that the $p$-th cyclotomic polynomial $\Phi_p(t)=1+t+\dots+t^{p-1}$ is the minimal polynomial of $e^{2\pi i/p}$ over…

We introduce the notion of non commutative truncated polynomial extension of an algebra A. We study two families of these extensions. For the first one we obtain a complete classification and for the second one, which we call upper…

We prove that a random bivariate polynomial with plus minus 1 coefficients is irreducible with high probability.

Motivated by a recent conjecture of R. P. Stanley we offer a lower bound for the sum of the coefficients of a Schubert polynomial in terms of $132$-pattern containment.