Spin systems on graphs with complex edge functions and specified degree regularities

DOI10.1007/978-3-642-22685-4_13MaRDI QIDQ3087946zbMATH OpenOpenAlexFDO

Authors Jin-Yi Cai, Michael Kowalczyk

Publication date 17 August 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22685-4_13

zbMATH Keywords

counting complexitydichotomy theoremholographic algorithmsinterpolation

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• Spin systems on k-regular graphs with complex edge functions
• Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions
• A Dichotomy for k-Regular Graphs with {0, 1}-Vertex Assignments and Real Edge Functions
• Holant problems for regular graphs with complex edge functions
• Holant problems for 3-regular graphs with complex edge functions

Cited in

(5)

• Spin models on triangle-free connected graphs
• Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions
• Spin systems on k-regular graphs with complex edge functions
• Hecke graphs, Ramanujan graphs and generalized duality transformations for lattice spin systems
• Approximating the partition function of planar two-state spin systems

This page was built for publication: Spin systems on graphs with complex edge functions and specified degree regularities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3087946)