Related papers: Multiplier sequences and logarithmic mesh
We use linear algebraic methods to obtain general results about linear operators on a space of polynomials that we apply to the operators associated with a polynomial sequence by the monomiality property. We show that all such operators are…
The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. The chain polynomials of the partition lattices and their standard type $B$ analogues are shown to have only real roots.…
In their classic 1914 paper, Polya and Schur introduced and characterized two types of linear operators acting diagonally on the monomial basis of R[x], sending real-rooted polynomials (resp. polynomials with all nonzero roots of the same…
We provide an explicit formula for the coefficient polynomials of a Hermite diagonal differential operator. The analysis of the zeros of these coefficient polynomials yields the characterization of generalized Hermite multiplier sequences…
Our overall goal is to unify and extend some results in the literature related to the approximation of generating functions of finite and infinite sequences over a field by rational functions. In our approach, numerators play a significant…
In this paper, given a simple linear recurrence sequence of algebraic numbers, which has either a dominant characteristic root or exactly two characteristic roots of maximal modulus, we give some explicit lower bounds for the index beyond…
Our main result is that any real cubic algebraic number has a continued fraction expansion with polynomial coefficients. Some generalizations are mentioned.
We consider hyperbolicity preserving operators with respect to a new linear operator representation on $\mathbb{R}[x]$. In essence, we demonstrate that every Hermite and Laguerre multiplier sequence can be diagonalized into a sum of…
The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This method requires only 'primitive'…
Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…
We establish analogues of the Hermite-Poulain theorem for linear finite difference operators with constant coefficients defined on sets of polynomials with roots on a straight line, in a strip, or in a half-plane. We also consider the…
We prove several results on the multiplier spectrum of polynomials. We provide a detailed proof of the theorem stating that the multiplier spectrum morphism is generically injective on the moduli space of polynomials. We obtain a…
We extend the algorithms of Robinson, Smyth, and McKee--Smyth to enumerate all real-rooted integer polynomials of a fixed degree, where the first few (at least three) leading coefficients are specified. Additionally, we introduce new linear…
In this paper we give a new characterization of simple sets of polynomials B with the property that the set of B-multiplier sequences contains all Q-multiplier sequence for every simple set Q. We characterize sequences of real numbers which…
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…
A bimatroid is a matroid-like generalization of the collection of regular minors of a matrix. In this article, we use the theory of Lorentzian polynomials to study the logarithmic concavity of natural sequences associated to bimatroids.…
This paper considers fast algorithms for operations on linearized polynomials. We propose a new multiplication algorithm for skew polynomials (a generalization of linearized polynomials) which has sub-quadratic complexity in the polynomial…
We fully classify completely multiplicative sequences which are given by generalised polynomial formulae, and obtain a similar result for (not necessarily completely) multiplicative sequences under the additional restriction that the…
We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…