Stable Polynomials via Undirected Colored Graphs

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Bickel, Kelly, Hong, Yang
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866915343778185216
author Bickel, Kelly
Hong, Yang
author_facet Bickel, Kelly
Hong, Yang
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2506_12624
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Stable Polynomials via Undirected Colored Graphs
Bickel, Kelly
Hong, Yang
Complex Variables
Functional Analysis
Primary 32A08, Secondary 05C50, 32A40, 47A48
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.
title Stable Polynomials via Undirected Colored Graphs
topic Complex Variables
Functional Analysis
Primary 32A08, Secondary 05C50, 32A40, 47A48
url https://arxiv.org/abs/2506.12624