- Series
- Combinatorics Seminar
- Time
- Friday, March 4, 2011 - 3:05pm for 1 hour (actually 50 minutes)
- Location
- Skiles 006
- Speaker
- Martin Loebl – Charles University, Prague, Czech Republic
- Organizer
- Robin Thomas
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.