EUVIMEDEUVIMED entdecken
Crossref

Stable polynomials via undirected colored graphs

Kelly Bickel, Yang Hong

The Electronic Journal of Linear Algebra · 24.03.2026 · 42 · 213-238

DOI: 10.13001/ela.2026.9645 ↗

Kurz gefasst

Fachartikel in der Zeitschrift The Electronic Journal of Linear Algebra, online erschienen am 24.03.2026. Verfasst von Kelly Bickel und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

APA

Bickel, K., & Hong, Y. (2026). Stable polynomials via undirected colored graphs. The Electronic Journal of Linear Algebra, 42, 213-238. https://doi.org/10.13001/ela.2026.9645

Vancouver

Bickel K, Hong Y. Stable polynomials via undirected colored graphs. The Electronic Journal of Linear Algebra. 2026;42:213-238. doi:10.13001/ela.2026.9645

BibTeX
@article{Bickel2026,
  author = {Bickel, Kelly and Hong, Yang},
  title = {Stable polynomials via undirected colored graphs},
  journal = {The Electronic Journal of Linear Algebra},
  year = {2026},
  volume = {42},
  pages = {213--238},
  doi = {10.13001/ela.2026.9645}
}
Kostenlos starten →