Related papers: Generalised polynomials and integer powers

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 extend and generalize the results of Scheiderer (2006) on the representation of polynomials nonnegative on two-dimensional basic closed semialgebraic sets. Our extension covers some situations where the defining polynomials do not…

Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…

We present a new formula for the highest power of $a+b$ that divides the sum $B(n,m,a,b)=\sum_{k=0}^{n}\binom{n}{k}^m a^{n-k}b^k$ for the case $m=2$. By using this formula, we give complete 3-adic valuation for central Dellanoy numbers.…

A hierarchy of matrix-valued polynomials which generalize the Jacobi polynomials is found. Defined by a Rodrigues formula, they are also products of a sequence of differential operators. Each class of polynomials is complete, satisfies a…

For an integer $k\ge 2$, let $\{F^{(k)}_{n}\}_{n\ge 2-k}$ be the $ k$--generalized Fibonacci sequence which starts with $0, \ldots, 0,1$ (a total of $k$ terms) and for which each term afterwards is the sum of the $k$ preceding terms. In…

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…

For a given length and a given degree and an arbitrary partition of the positive integers, there always is a cell containing a polynomial progression of that length and that degree; moreover, the coefficients of the generating polynomial…

A polynomial is a direct sum if it can be written as a sum of two non-zero polynomials in some distinct sets of variables, up to a linear change of variables. We analyze criteria for a homogeneous polynomial to be decomposable as a direct…

Let n,k be the positive integers, and let S_{k}(n) be the sums of the k-th power of positive integers up to n. By means of that we consider the evaluation of the sum of more general series by Bernstein polynomials. Additionally we show the…

We study the set of algebraic objects known as vanishing polynomials (the set of polynomials that annihilate all elements of a ring) over general commutative rings with identity. These objects are of special interest due to their close…

Let f and g be nonconstant polynomials over an arbitrary field K. In this paper we study the intersection of the polynomial rings K[f] and K[g], and in particular we ask whether this intersection is larger than K. We completely resolve this…

It is known that the greatest common divisor of two Fibonacci numbers is again a Fibonacci number. It is called the strong divisibility property. However, this property does not hold for every second order sequence. In this paper we study…

One of the most interesting results of the last century was the proof completed by Matijasevich that computably enumerable sets are precisely the diophantine sets [MRDP Theorem, 9], thus settling, based on previously developed machinery,…

Every binomial coefficient aficionado knows that the greatest common divisor of the binomial coefficients $\binom n1,\binom n2,\dots,\binom n{n-1}$ equals $p$ if $n=p^i$ for some $i>0$ and equals 1 otherwise. It is less well known that the…

Given a prime power $q$ and positive integers $m,t,e$ with $e > mt/2$, we determine the number of all monic irreducible polynomials $f(x)$ of degree $m$ with coefficients in $\mathbb{F}_q$ such that $f(x^t)$ contains an irreducible factor…

We prove that a bivariate polynomial f with exactly t non-zero terms, restricted to a real line {y=ax+b}, either has at most 6t-4 zeroes or vanishes over the whole line. As a consequence, we derive an alternative algorithm to decide whether…

We examine when the composition of two entire functions f and g is even, and extend some of our results to cyclic compositions in general. We prove some theorems for the cases when f or g is a polynomial. Two of the key theorems we use are…

Let $f(t_1, \ldots, t_r, X)\in \mathbb{Z}[t_1, \ldots, t_r,X]$ be irreducible and let $a_1, \ldots, a_r\in \mathbb{Z} \smallsetminus \{0,\pm 1\}$. Under a necessary ramification assumption on $f$, and conditionally on the Generalized…