On Yamada polynomial of spatial graphs obtained by edge replacements
Miaowang Li, Fengchun Lei, Fengling Li, Andrei Vesnin

TL;DR
This paper develops formulas for calculating the Yamada polynomial of complex spatial graphs created by replacing edges with spatial components, revealing dense zero distributions and linking to chain polynomials.
Contribution
It introduces new formulas for Yamada polynomials of spatial graphs formed by edge replacements and explores their zero distributions and relation to chain polynomials.
Findings
Zeros of Yamada polynomials are dense in a specific complex region.
Formulas relate Yamada polynomials to chain polynomials.
Spatial graph constructions influence polynomial properties.
Abstract
We present formulae for computing the Yamada polynomial of spatial graphs obtained by replacing edges of plane graphs, such as cycle-graphs, theta-graphs, and bouquet-graphs, by spatial parts. As a corollary, it is shown that zeros of Yamada polynomials of some series of spatial graphs are dense in a certain region in the complex plane, described by a system of inequalities. Also, the relation between Yamada polynomial of graphs and the chain polynomial of edge-labelled graphs is obtained.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Graph Theory Research · Point processes and geometric inequalities
