Solvability of the Hankel determinant problem for real sequences

From MaRDI portal



Abstract: To each nonzero sequence s:=snngeq0 of real numbers we associate the Hankel determinants Dn=detmathcalHn of the Hankel matrices mathcalHn:=(si+j)i,j=0n, ngeq0, and the nonempty set Ns:=ngeq1,|,Dn−1eq0. We also define the Hankel determinant polynomials P0:=1, and Pn, ngeq1 as the determinant of the Hankel matrix mathcalHn modified by replacing the last row by the monomials 1,x,ldots,xn. Clearly Pn is a polynomial of degree at most n and of degree n if and only if ninNs. Kronecker established in 1881 that if Ns is finite then rank mathcalHn=r for each ngeqr−1, where r:=maxNs. 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 tnngeq0 to be of the form tn=Dn, ngeq0 for a real sequence snngeq0. This is the Hankel determinant problem. We derive from the Kronecker identities that each Hankel determinant polynomial Pn satisfying degPn=ngeq1 is preceded by a nonzero polynomial Pn−1 whose degree can be strictly less than n−1 and which has no common zeros with Pn. As an application of our results we obtain a new proof of a recent theorem by Berg and Szwarc about positive semidefiniteness of all Hankel matrices provided that D0>0,ldots,Dr−1>0 and Dn=0 for all ngeqr.












This page was built for publication: Solvability of the Hankel determinant problem for real sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5377709)