Complexity and criticality of the Ising problem

Combinatorics Seminar
Friday, March 4, 2011 - 15:05
1 hour (actually 50 minutes)
Skiles 006
Charles University, Prague, Czech Republic
The Ising problem on finite graphs is usually treated by a reduction to the dimer problem. Is this a wise thing to do? I will show two (if time allows) recent results indicating that the Ising problem allows better mathematical analysis than the dimer problem. Joint partly with Gregor Masbaum and partly with Petr Somberg.