BEGIN:VCALENDAR
VERSION:2.0
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
BEGIN:VEVENT
CATEGORIES:Conferences/Seminars/Lectures
DESCRIPTION:SPEAKER: Tamas Kalman (Tokyo Institute of Technology)\n\nTITL
E: Hypergraph polynomials and the Bernardi process\n\nABSTRACT:\n\nThe pro
duct of two simplices can be triangulated by non-crossing trees. I will sta
rt with a generalization of this fact: the root polytope of an arbitrary bi
partite graph has a dissection by a simple class of spanning trees derived
from a ribbon structure. Moreover\, the dissection comes with a natural sh
elling order. The resulting h-vector is equivalent to (a) the Ehrhart polyn
omial of the root polytope and thus\, by earlier joint work with Postnikov\
, to the common 'interior polynomial' of the two hypergraphs induced by the
bipartite graph (b) a new variant of the interior polynomial\, defined usi
ng the ribbon structure along the lines of Bernardi's approach to the Tutte
polynomial. Hence we obtain a Bernardi-type definition of the interior pol
ynomial. This is joint work with Lilla Tóthmérész.
DTEND:20181003T211500Z
DTSTAMP:20210731T065445Z
DTSTART:20181003T201500Z
LOCATION:Room 2-147
SEQUENCE:0
SUMMARY:Combinatorics Seminar
UID:tag:localist.com\,2008:EventInstance_3968982
URL:https://calendar.mit.edu/event/combinatorics_seminar_8286
END:VEVENT
END:VCALENDAR