On the characterization of the degree of interpolation polynomials in terms of certain combinatorical matrices
Frank Klinker, Christoph Reineke

TL;DR
This paper links the degree of interpolation polynomials with the regularity of combinatorial matrices, providing a new characterization for equidistant base points.
Contribution
It introduces a novel characterization of interpolation polynomial degree using combinatorial matrix regularity, enhancing understanding of polynomial interpolation.
Findings
Degree of interpolation polynomial characterized by matrix regularity
Connection established between combinatorial matrices and interpolation degree
Provides a new perspective on polynomial interpolation with equidistant points
Abstract
In this note we show that the degree of the interpolation polynomial for equidistant base points is characterized by the regularity of matrices of combinatorical type.
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
