Reflection Positivity as Complement to the Location of Zeros of Partition Functions

on YouTube ↗57m

" summary

Reflection positivity is presented as a concrete tool that produces periodic minimizers and an exponential bound e^{-a n} on the probability that any chosen set of n edges is “bad,” via chessboard estimates and a Peierls-type argument; applied to a dimer model with nearest-neighbor alignment it rigorously yields orientational LRO (1979) and later a separate proof (2017) shows absence of translational order, so a liquid‑crystal phase is constructed and proved to exist.

AI-written summary · about

" chapters (8)

1. 0:00Introduction to phase transitions
2. 7:24Concept of reflection positivity
3. 11:34Applying reflection positivity
4. 17:11Ising model and correlations
5. 22:07Proving long-range order
6. 30:02Dimer systems and liquid crystals
7. 38:44Phase transitions in dimer models
8. 45:44Summary and conclusions

" related talks

• 01h 11mThe Partition Function, Sampling and Equilibration in PhysicsFlorent Krzakala, Lenka Zdeborova · Counting Complexity and Phase Transitions Boot Camp
• 01h 03mDecay of Correlations in Spin SystemsYitong Yin · Counting Complexity and Phase Transitions Boot Camp
• 50mRandom Combinatorial MatricesAmin Coja-Oghlan · Algorithmic Advances for Statistical Inference with Combinatorial Structure
• 29mExtended Formulations and Information ComplexityAnkur Moitra · Information Theory in Complexity Theory and Combinatorics 2015
• 01h 00mAverage-case Complexity for Polynomials, and All ThatEmanuele Viola · Lower Bounds, Learning, and Average-Case Complexity
• 30mThe Hitting Proof SystemYuval Filmus · Proof Complexity and Meta-Mathematics 2023
• 01h 37mMatrix RigiditySatya Lokam · Algorithms and Complexity in Algebraic Geometry Boot Camp 2014
• 01h 05mOn the Critical Point Method and Deciding Connectivity Queries in Real Algebraic SetsMohab Safey El Din · Solving Polynomial Equations (Simons Institute, 2014)