Characterization of non-trivial discrete multiplier sequences
Let be a non-trivial sequence, meaning it is not zero for all but at most two indices, and suppose that for some . A discrete multiplier sequence is a sequence whose diagonal finite difference operator preserves . Characterization conjecture. The sequence is a discrete multiplier sequence if and only if it is a classical multiplier sequence and
This is proposed as a discrete analogue of the classical Pólya–Schur characterization of multiplier sequences. The claim concerns non-trivial sequences and remains open in the supplied source.
References
Primary source
P. Brändén, I. Krasikov and B. Shapiro, “Elements of Polya-Schur theory in finite difference setting”, arXiv:1204.2963 (2013).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.