Image de couverture de livre

On boundedness of zeros of the independence polynomial of tori

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	de Boer, David, Buys, Pjotr, Peters, Han, Regts, Guus
Format:	Preprint
Publié:	2023
Sujets:	Combinatorics Data Structures and Algorithms Mathematical Physics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
par: Bencs, Ferenc, et autres
Publié: (2025)

Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem
par: Jenssen, Matthew, et autres
Publié: (2023)

A near-optimal zero-free disk for the Ising model
par: Patel, Viresh, et autres
Publié: (2023)

Deterministic approximate counting of colorings with fewer than $2Δ$ colors via absence of zeros
par: Bencs, Ferenc, et autres
Publié: (2024)

Barvinok's interpolation method meets Weitz's correlation decay approach
par: Bencs, Ferenc, et autres
Publié: (2025)

Approximating the volume of a truncated relaxation of the independence polytope
par: Bencs, Ferenc, et autres
Publié: (2024)

On zeros and algorithms for disordered systems: mean-field spin glasses
par: Bencs, Ferenc, et autres
Publié: (2025)

Generalising the maximum independent set algorithm via Boolean networks
par: Gadouleau, Maximilien, et autres
Publié: (2024)

Zero-free regions of partition functions with applications to algorithms and graph limits
par: Regts, Guus
Publié: (2015)

Decay of correlations and zeros for the hard-core model
par: Peters, Han, et autres
Publié: (2026)

From Zero-Freeness to Strong Spatial Mixing via a Christoffel-Darboux Type Identity
par: Shao, Shuai, et autres
Publié: (2024)

Implicit representations via the polynomial method
par: Cardinal, Jean, et autres
Publié: (2026)

Totally $Δ$-modular IPs with two non-zeros in most rows
par: Kober, Stefan
Publié: (2024)

Stable Approximation Algorithms for Dominating Set and Independent Set
par: de Berg, Mark, et autres
Publié: (2024)

Toward Minimum Graphic Parity Networks
par: Cao, Yixin, et autres
Publié: (2025)

Induced Minor Models. II. Sufficient conditions for polynomial-time detection of induced minors
par: Dallard, Clément, et autres
Publié: (2024)

Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension
par: Bartier, Valentin, et autres
Publié: (2023)

On The Maximum Linear Arrangement Problem for Trees
par: Alemany-Puig, Lluís, et autres
Publié: (2023)

Sampling Balanced Forests of Grids in Polynomial Time
par: Cannon, Sarah, et autres
Publié: (2023)

Perturbation results for distance-edge-monitoring numbers
par: Yang, Chenxu, et autres
Publié: (2023)

Enumerating minimal solution sets for metric graph problems
par: Bergougnoux, Benjamin, et autres
Publié: (2023)

An Algebraic Approach to the Longest Path Problem
par: Khazali, Omar Al -
Publié: (2023)

A new width parameter of graphs based on edge cuts: $α$-edge-crossing width
par: Chang, Yeonsu, et autres
Publié: (2023)

An Alternate Proof of Near-Optimal Light Spanners
par: Bodwin, Greg
Publié: (2023)

Towards the Characterization of Terminal Cut Functions: a Condition for Laminar Families
par: Chen, Yu, et autres
Publié: (2023)

Traversing combinatorial 0/1-polytopes via optimization
par: Merino, Arturo, et autres
Publié: (2023)

Linear-Sized Spectral Sparsifiers and the Kadison-Singer Problem
par: Paschalidis, Phevos, et autres
Publié: (2023)

The Strong Birthday Problem Revisited
par: Tripathy, Chijul B.
Publié: (2025)

Reconfiguration of List Colourings
par: Cambie, Stijn, et autres
Publié: (2025)

Parameterized complexity of isometric path partition: treewidth and diameter
par: Chakraborty, Dibyayan, et autres
Publié: (2025)

On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
par: Ghanbari, Babak, et autres
Publié: (2025)

On the Enumeration of all Unique Paths of Recombining Trinomial Trees
par: Torres, Ethan, et autres
Publié: (2025)

Vigemers: on the number of $k$-mers sharing the same XOR-based minimizer
par: Ingels, Florian, et autres
Publié: (2026)

Induced Cycles of Many Lengths
par: Chudnovsky, Maria, et autres
Publié: (2026)

Approximating maximum-size properly colored forests
par: Bai, Yuhang, et autres
Publié: (2024)

Problems on Group-labeled Matroid Bases
par: Hörsch, Florian, et autres
Publié: (2024)

$α_i$-Metric Graphs: Hyperbolicity
par: Dragan, Feodor F., et autres
Publié: (2024)

Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
par: Deák, Bence, et autres
Publié: (2026)

Rainbow Arborescence Conjecture
par: Bérczi, Kristóf, et autres
Publié: (2024)

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
par: An, Shinwoo, et autres
Publié: (2025)