Zeros and approximations of Holant polynomials on the complex plane

We present fully polynomial approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials. We transform these problems into partition functions of abstract combinatorial structures known as polymers in statistical physics. Our method involves...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2020-02
Hauptverfasser:	Casel, Katrin, Fischbeck, Philipp, Friedrich, Tobias, Göbel, Andreas, Gregor Lagodzinski, J A
Format:	Artikel
Sprache:	eng
Schlagworte:	Addition polymerization Algorithms Approximation Combinatorial analysis Computer Science - Data Structures and Algorithms Computer Science - Discrete Mathematics Low temperature Partitions (mathematics) Polynomials Sampling
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!