Slices of stable polynomials and connections to the Grace-Walsh-Szegő theorem

Univariate polynomials are called stable with respect to a domain D if all of their roots lie in D . We study linear slices of the space of stable univariate polynomials with respect to a half-plane. We show that a linear slice always contains a stable polynomial with only a few distinct roots. Subsequently, we apply these results to symmetric polynomials and varieties. We show that for varieties defined by few multiaffine symmetric polynomials, the existence of a point in D n with few distinct coordinates is necessary and sufficient for the intersection with D n to be non-empty. This is at the same time a generalization of the so-called degree principle to stable polynomials and a result similar to Grace-Walsh-Szegő's coincidence theorem.

Institutions

Publication Details

Journal
Journal of Symbolic Computation
Published
2025-08-15
DOI
https://doi.org/10.1016/j.jsc.2025.102488
Primary Topic
Geochemistry and Geologic Mapping
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Slices of stable polynomials and connections to the Grace-Walsh-Szegő theorem

Journal of Symbolic Computation
Geochemistry and Geologic Mapping
article

Slices of stable polynomials and connections to the Grace-Walsh-Szegő theorem

article en

Abstract

Univariate polynomials are called stable with respect to a domain D if all of their roots lie in D . We study linear slices of the space of stable univariate polynomials with respect to a half-plane. We show that a linear slice always contains a stable polynomial with only a few distinct roots. Subsequently, we apply these results to symmetric polynomials and varieties. We show that for varieties defined by few multiaffine symmetric polynomials, the existence of a point in D n with few distinct coordinates is necessary and sufficient for the intersection with D n to be non-empty. This is at the same time a generalization of the so-called degree principle to stable polynomials and a result similar to Grace-Walsh-Szegő's coincidence theorem.

Journal of Symbolic ComputationVol. 133
University of Konstanz (DE), Chemnitz University of Technology (DE), UiT The Arctic University of Norway (NO)
Openalex Percentile: Top 70%
Geochemistry and Geologic Mapping
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.

Slices of stable polynomials and connections to the Grace-Walsh-Szegő theorem · Journal of Symbolic Computation (2025) | TGRS Research Map | TGRS