BEGIN:VCALENDAR
VERSION:2.0
X-WR-CALNAME:Anna Beliakova: \"On simplification of combinatorial link F
 loer homology\"
PRODID:-//Apple Computer\, Inc//iCal 2.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:US/Eastern
LAST-MODIFIED:20080204T181759Z
BEGIN:STANDARD
DTSTART:20071104T060000
TZOFFSETTO:-0500
TZOFFSETFROM:+0000
TZNAME:EST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20080309T010000
TZOFFSETTO:-0400
TZOFFSETFROM:-0500
TZNAME:EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
DURATION:PT1H
LOCATION:Math 507\, Columbia University
DTSTAMP:20080204T181753Z
UID:9ECCACA3-18AC-4D78-B5CB-6FD7EF2505A5
SEQUENCE:7
URL;VALUE=URI:http://math.columbia.edu/~lipshitz/SGGT/
DTSTART;TZID=US/Eastern:20080215T130000
SUMMARY:Anna Beliakova: \"On simplification of combinatorial link Floer 
 homology\"
DESCRIPTION:Abstract:  We define a new combinatorial complex computing t
 he hat version of link Floer homology\, which turns out to be simpler th
 an Manolescu-Ozsvath-Sarkar one. We speculate that similar ideas can be 
 used to define Seidel-Smith complex combinatorially and show  that its h
 omology coincides with Khovanov's one.
ORGANIZER;CN="Robert Lipshitz":mailto:lipshitz@math.stanford.edu
END:VEVENT
END:VCALENDAR