Pell's equation, sum-of-squares and equilibrium measures of a compact set
Jean-Bernard Lasserre (LAAS-POP)

TL;DR
This paper explores generalized Pell's equations linked to Christoffel functions and equilibrium measures for compact sets, extending classical results to higher dimensions and complex geometric shapes through algebraic and optimization techniques.
Contribution
It introduces a new interpretation of Pell's equations via Positivstellensatz, extending to arbitrary semi-algebraic sets and connecting orthogonal polynomials with real algebraic geometry.
Findings
Pell's equations are satisfied by Christoffel functions for various sets.
The approach applies to classical shapes like the simplex, ball, and box.
Connections established between orthogonal polynomials, sum-of-squares, and convex optimization.
Abstract
We first interpret Pell's equation satisfied by Chebyshev polynomials for each degree t, as a certain Positivstellensatz, which then yields for each integer t, what we call a generalized Pell's equation, satisfied by reciprocals of Christoffel functions of ''degree'' 2t, associated with the equilibrium measure of the interval [--1, 1] and the measure (1 -- x 2)d. We next extend this point of view to arbitrary compact basic semi-algebraic set S R n and obtain a generalized Pell's equation (by analogy with the interval [--1, 1]). Under some conditions, for each t the equation is satisfied by reciprocals of Christoffel functions of ''degree'' 2t associated with (i) the equilibrium measure of S and (ii), measures gd for an appropriate set of generators g of S. These equations depend on the particular choice of generators that define the set S. In addition to…
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 · Polynomial and algebraic computation · Matrix Theory and Algorithms
