Basic semialgebraicity conjecture for symmetric nonnegative realizable spectra
Basic semialgebraicity conjecture for symmetric nonnegative realizable spectra
Let be a positive integer. A spectrum is realizable by a symmetric nonnegative matrix if it is the spectrum of an symmetric matrix with nonnegative entries. A subset of a real affine space is basic semi-algebraic if it can be described by finitely many polynomial equalities and inequalities.
Basic semialgebraicity conjecture. The set of spectra realizable by symmetric nonnegative matrices forms a basic semi-algebraic set.
This is the corresponding basic-semialgebraic-set question for the symmetric nonnegative inverse eigenvalue problem. If established, the result would provide a finite description by polynomial inequalities, addressing the difficulty of controlling the number of inequalities in the semi-algebraic approach.
Sources & referencesView supporting material
Primary source
Jared J. L. Brannan and Benjamin J. Clark, “The NIEP is solvable by reality and finitely many polynomial inequalities”, arXiv:2407.14472 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.