arXiv · 2506.12624
Stable Polynomials via Undirected Colored Graphs
Abstract
This paper initiates a systematic study of connections between undirected colored graphs and associated two-variable stable polynomials obtained via Cauchy transform-type formulas. Examples of such stable polynomials have played crucial roles in other recent studies, though their general properties have remained rather opaque. Using linear algebra techniques, this paper characterizes when these stable polynomials have boundary zeros and studies the finer behavior, called contact order, of their zero sets near the guaranteed boundary zeros.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Kelly Bickel, Yang Hong. 2025-06-14. Stable Polynomials via Undirected Colored Graphs. https://arxiv.org/abs/2506.12624
Cite the original work for its findings. Save a collection to share your selection of sources.