The Wonderful Geometry of the Vandermonde map

Abstract We study the geometry of the image of the nonnegative orthant under the power-sum and elementary symmetric polynomials maps. After analyzing the image in a finite number of variables, we concentrate on the limit as the number of variables approaches infinity. We explain how the geometry of the limit plays a crucial role in undecidability results in nonnegativity of symmetric polynomials, deciding validity of trace inequalities in linear algebra, and extremal combinatorics (recently observed by Grigoriy Blekherman, Annie Raymond, and Fan Wei. “Undecidability of polynomial inequalities in weighted graph homomorphism densities”. In: Forum of Mathematics, Sigma . Vol. 12. Cambridge University Press. 2024, e40.). We verify the experimental observation that the image has the combinatorial geometry of a cyclic polytope, as noted by Hana Melánová, Bernd Sturmfels, and Rosa Winter. “Recovery from Power Sums”. In: Experimental Mathematics (2022), pp. 1–10., and generalize results of Man-Duen Choi, Tsit-Yuen Lam, and Bruce Reznick. “Even symmetric sextics”. In: Mathematische Zeitschrift 195.4 (1987), pp. 559–580. on nonnegative even symmetric polynomials. We also show that undecidability does not hold for the normalized power sum map.

Authors

Institutions

Publication Details

Journal
Foundations of Computational Mathematics
Published
2025-09-22
DOI
https://doi.org/10.1007/s10208-025-09718-6
Primary Topic
Mathematics and Applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The Wonderful Geometry of the Vandermonde map

Sebastian Debus, Cordian Riener, Grigoriy Blekherman, José Acevedo
Foundations of Computational Mathematics
Mathematics and Applications
article

The Wonderful Geometry of the Vandermonde map

Sebastian Debus, Cordian Riener, Grigoriy Blekherman, José Acevedo
article en

Abstract

Abstract We study the geometry of the image of the nonnegative orthant under the power-sum and elementary symmetric polynomials maps. After analyzing the image in a finite number of variables, we concentrate on the limit as the number of variables approaches infinity. We explain how the geometry of the limit plays a crucial role in undecidability results in nonnegativity of symmetric polynomials, deciding validity of trace inequalities in linear algebra, and extremal combinatorics (recently observed by Grigoriy Blekherman, Annie Raymond, and Fan Wei. “Undecidability of polynomial inequalities in weighted graph homomorphism densities”. In: Forum of Mathematics, Sigma . Vol. 12. Cambridge University Press. 2024, e40.). We verify the experimental observation that the image has the combinatorial geometry of a cyclic polytope, as noted by Hana Melánová, Bernd Sturmfels, and Rosa Winter. “Recovery from Power Sums”. In: Experimental Mathematics (2022), pp. 1–10., and generalize results of Man-Duen Choi, Tsit-Yuen Lam, and Bruce Reznick. “Even symmetric sextics”. In: Mathematische Zeitschrift 195.4 (1987), pp. 559–580. on nonnegative even symmetric polynomials. We also show that undecidability does not hold for the normalized power sum map.

Foundations of Computational Mathematics
Universidad Industrial de Santander (CO), Georgia Institute of Technology (US), Chemnitz University of Technology (DE), UiT The Arctic University of Norway (NO)
National Science Foundation, European Commission, Deutsche Forschungsgemeinschaft
Openalex Percentile: Top 69%
Mathematics and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.