The self-interlacing conjecture for the geometric-sum polynomial
The self-interlacing conjecture for the geometric-sum polynomial
Let
Let be the finite difference operator from the paper, and let a polynomial be self-interlacing when it has real simple zeros and the zeros of strictly interlace those of .
Self-interlacing conjecture. The polynomial is self-interlacing, or is a self-interlacing polynomial multiplied by .
The claim is motivated by calculations concerning the action of the operator on subclasses of complex polynomials. The source gives no proof or resolution.
Progress summary
The conjecture remains open: its original paper records it as a calculation-based expectation, with no publicly reported proof or verified counterexample.
The conjecture concerns whether applying the finite-difference operator to the geometric-sum polynomial produces a self-interlacing polynomial, possibly after multiplication by . The directly relevant paper presents this as a conjecture motivated by calculations, not as a theorem, and gives no resolution.
Current status (as of August 2026): The conjecture is unsettled; the retrieved source contains only its formulation and motivation, with no verified proof, counterexample, or claimed resolution.
Sources
Sources & referencesView supporting material
Primary source
Olga Katkova, Mikhail Tyaglov and Anna Vishnyakova, “Hermite-Poulain theorems for linear finite difference operators”, arXiv:1901.06398 (2019).
Solutions 1
Sign in to submit a solution.
Take , and consider the geometric-sum polynomial
Choose the admissible parameters
By the definition of the finite-difference operator,
Consequently,
The discriminant of its numerator is
Therefore this polynomial has two nonreal zeros. In particular, it is neither self-interlacing nor times a self-interlacing polynomial.
More generally, every
gives a counterexample, because the discriminant of is
Thus the proposed dichotomy fails already for and .