{"title":"Slices of stable polynomials and connections to the Grace-Walsh-Szegő theorem","authors":"Sebastian Debus , Cordian Riener , Robin Schabert","doi":"10.1016/j.jsc.2025.102488","DOIUrl":null,"url":null,"abstract":"<div><div>Univariate polynomials are called stable with respect to a domain <em>D</em> if all of their roots lie in <em>D</em>. 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 <span><math><msup><mrow><mi>D</mi></mrow><mrow><mi>n</mi></mrow></msup></math></span> with few distinct coordinates is necessary and sufficient for the intersection with <span><math><msup><mrow><mi>D</mi></mrow><mrow><mi>n</mi></mrow></msup></math></span> 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.</div></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"133 ","pages":"Article 102488"},"PeriodicalIF":1.1000,"publicationDate":"2025-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Symbolic Computation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0747717125000707","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
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 with few distinct coordinates is necessary and sufficient for the intersection with 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.
期刊介绍:
An international journal, the Journal of Symbolic Computation, founded by Bruno Buchberger in 1985, is directed to mathematicians and computer scientists who have a particular interest in symbolic computation. The journal provides a forum for research in the algorithmic treatment of all types of symbolic objects: objects in formal languages (terms, formulas, programs); algebraic objects (elements in basic number domains, polynomials, residue classes, etc.); and geometrical objects.
It is the explicit goal of the journal to promote the integration of symbolic computation by establishing one common avenue of communication for researchers working in the different subareas. It is also important that the algorithmic achievements of these areas should be made available to the human problem-solver in integrated software systems for symbolic computation. To help this integration, the journal publishes invited tutorial surveys as well as Applications Letters and System Descriptions.