Homomorphisms from the torus
From MaRDI portal
Publication:6135867
DOI10.1016/j.aim.2023.109212zbMath1520.05066arXiv2009.08315MaRDI QIDQ6135867
Peter Keevash, Matthew Jenssen
Publication date: 28 August 2023
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.08315
Graph polynomials (05C31) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Signed and weighted graphs (05C22)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximate vertex-isoperimetric inequality for \(r\)-sets
- Odd cutsets and the hard-core model on \(\mathbb{Z}^{d}\)
- \(H\)-colouring bipartite graphs
- \(H\)-coloring tori
- Grounded Lipschitz functions on trees are typically flat
- Cluster expansion for abstract polymer models
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Generalized rank functions and an entropy argument
- On homomorphisms from the Hamming cube to \(\mathbb{Z}\)
- On random graph homomorphisms into \({\mathbb{Z}}\)
- Rigidity of 3-colorings of the discrete torus
- High-dimensional Lipschitz functions are typically flat
- Independent sets in the middle two layers of Boolean lattice
- Matroidal bijections between graphs
- Long-range order in the 3-state antiferromagnetic Potts model in high dimensions
- Sampling 3-colourings of regular bipartite graphs
- The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
- An Entropy Approach to the Hard-Core Model on Bipartite Graphs
- Lipschitz Functions on Expanders are Typically Flat
- Torpid Mixing of Local Markov Chains on 3-Colorings of the Discrete Torus
- A Threshold Phenomenon for Random Independent Sets in the Discrete Hypercube
- On Counting Independent Sets in Sparse Graphs
- On a Method of Calculation of Semi-Invariants
- Algorithms for #BIS-Hard Problems on Expander Graphs
- Sampling independent sets in the discrete torus
- An Ordering on the Even Discrete Torus
- On weighted graph homomorphisms
- On Phase Transition in the Hard-Core Model on ${\mathbb Z}^d$
- Left and right convergence of graphs with bounded degree
- Fast Algorithms for General Spin Systems on Bipartite Expanders
- Independent sets in the hypercube revisited
- Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures
- Counting independent sets in unbalanced bipartite graphs
- Algorithmic Pirogov-Sinai theory
- Slow mixing of Glauber dynamics for the hard‐core model on regular bipartite graphs
- Phase coexistence and torpid mixing in the 3-coloring model on ${\mathbb Z}^d$
- Optimal numberings and isoperimetric problems on graphs
- Counting Independent Sets and Colorings on Random Regular Bipartite Graphs
- Range of cube-indexed random walk
- Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs
