BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: We discuss a dual version of a problem about perfect matchings
  in cubic graphs posed by Lovasz and Plummer. The dual version is formulate
 d as follows &quot;Every triangulation of an orientable surface has exponentiall
 y many groundstates&#39;&#39;\, where groundstates are the states at the lowest ene
 rgy in the antiferromagnetic Ising Model.  According to physicists\, this d
 ual formulation holds. In this talk\, I show a counterexample to the dual f
 ormulation\, a method to count groundstates which gives a better bound (for
  the original problem) on the class of Klee-graphs\, the complexity of the 
 related problems and\, if time allows\, some open problems.   This is joint
  work with Marcos Kiwi and Martin Loebl. 
DTSTAMP:20220627T174700
DTSTART:20220718T160000
CLASS:PUBLIC
LOCATION:Freie Universität Berlin \n Institut für Informatik \n Takustr. 9 
 \n 14195 Berlin \n Room 005 (Ground Floor)
SEQUENCE:0
SUMMARY:Andrea Jiménez (Universidad de Varparaíso\, Chile): Groundstates of
  the Ising Model on antiferromagnetic triangulations
UID:95692758@www.facetsofcomplexity.de
URL:http://www.facetsofcomplexity.de/monday/20220718-C-Jimenez.html
END:VEVENT
END:VCALENDAR
