Parity of Polynomial Multiplier Sequences for the Chebyshev Basis
Andrzej Piotrowski, Joshua Shterenberg

TL;DR
This paper characterizes polynomial multiplier sequences for Chebyshev polynomials, showing non-even polynomials do not form such sequences and providing a complete description of geometric sequences for this basis.
Contribution
It proves that only even polynomials can generate multiplier sequences for Chebyshev polynomials and characterizes all geometric multiplier sequences for this basis.
Findings
Non-even polynomials are not Chebyshev multiplier sequences.
Complete characterization of geometric multiplier sequences.
Provides criteria for polynomial multiplier sequences for Chebyshev basis.
Abstract
We demonstrate that if and is not an even function, then is not a multiplier sequence for the basis of Chebyshev polynomials of the first kind. We also give a characterization of geometric multiplier sequences for the Chebyshev basis.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Differential Equations and Dynamical Systems · Coding theory and cryptography · Mathematical Analysis and Transform Methods
