The Division Algorithm in Sextic Truncated Moment Problems
Raul E. Curto, Seonguk Yoo

TL;DR
This paper develops a division algorithm approach to analyze extremal sextic moment problems, providing new representation theorems for sextic polynomials and completing the understanding of these problems.
Contribution
It introduces a division algorithm method from algebraic geometry to establish representation theorems for sextic polynomials in extremal moment problems.
Findings
Established representation theorems for sextic polynomials vanishing on algebraic varieties.
Completed the analysis of extremal sextic moment problems.
Provided algebraic tools to verify consistency in moment problems.
Abstract
For a degree 2n finite sequence of real numbers to have a representing measure , it is necessary for the associated moment matrix to be positive semidefinite, and for the algebraic variety associated to , , to satisfy as well as the following consistency} condition: if a polynomial of degree at most 2n vanishes on , then the Riesz functional . Positive semidefiniteness, recursiveness, and the variety condition of a moment matrix are necessary and sufficient…
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
TopicsAdvanced Optimization Algorithms Research · Mathematical functions and polynomials · Iterative Methods for Nonlinear Equations
