Solvability of the Hankel determinant problem for real sequences
Andrew Bakan (Institute of Mathematics, Natl. Acad. Sci. of Ukraine), and Christian Berg (University of Copenhagen)

TL;DR
This paper investigates the conditions under which Hankel determinants derived from real sequences are solvable, providing new proofs and insights into the structure of Hankel matrices and their associated polynomials.
Contribution
It offers a simplified proof of Kronecker's classical result and characterizes sequences that generate Hankel determinants, advancing understanding of the Hankel determinant problem.
Findings
Short proof of Kronecker's result on Hankel matrix rank
Characterization of sequences with given Hankel determinants
New proof of a theorem on positive semidefiniteness of Hankel matrices
Abstract
To each nonzero sequence of real numbers we associate the Hankel determinants of the Hankel matrices , , and the nonempty set . We also define the Hankel determinant polynomials , and , as the determinant of the Hankel matrix modified by replacing the last row by the monomials . Clearly is a polynomial of degree at most and of degree if and only if . Kronecker established in 1881 that if is finite then rank for each , where . By using an approach suggested by I.S.Iohvidov in 1969 we give a short proof of this result and a transparent proof of the conditions on a real sequence $\{t_n\}_{n\geq…
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.
Taxonomy
TopicsMathematical functions and polynomials · Nonlinear Optical Materials Research · Molecular spectroscopy and chirality
