A simplified proof of a Lee-Yang type theorem

2014/07/22 by Piyush Srivastava, Márió Szegedy, Srivastava, Piyush +1
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computability, Logic, AI Algorithms #FOS: Physical sciences #Mathematical Physics (math-ph)

paper · pdf · doi:10.48550/arxiv.1407.5991

openalex publication_date 2014/07/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this short note, we give a simple proof of a Lee-Yang type theorem which appeared in "Lee-Yang theorems and the complexity of computing averages" by Alistair Sinclair and Piyush Srivastava.

Related

• A note on the Lee-Yang circle theorem
• The early historical roots of Lee-Yang theorem
• Lee-Yang theorems and the complexity of computing averages
• A simple proof of the Chuang's inequality
• A Proof of the Ergodic Theorem using Nonstandard Analysis