BEGIN:VCALENDAR
VERSION:2.0
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
BEGIN:VEVENT
CATEGORIES:Lecture / Talk / Workshop
DESCRIPTION:Alejandro Morales\, Université du Québec à Montréal\n\n\nTitle:
Bounds on integral flows of graphs and the Kostant partition function\n\n\
nAbstract: Integer flows on networks are very important objects in optimiza
tion\, combinatorics\, and representation theory. For example the number of
integer flows on a complete graph is also known as the type A Kostant's ve
ctor partition function that can be used to compute Kostka and Littlewood-R
ichardson coefficients. In this talk we will talk about bounds on the Kosta
nt partition function starting from elementary ones\, continuing with more
sophisticated ones using subdivisions of flow polytopes\, and ending with l
ower bounds based on Gurvits capacity method of certain Lorentzian polynomi
als. The last method adapts the results of Brändén--Leake--Pak on lattice p
oints of transportation polytopes to flow polytopes whose lattice points ar
e counted by the Kostant partition function.\n\nThe talk is based on joint
work with Jonathan Leake.
DTEND:20240419T220000Z
DTSTAMP:20240612T195221Z
DTSTART:20240419T210000Z
GEO:34.022409;-118.291027
LOCATION:Kaprielian Hall (KAP)\, 414
SEQUENCE:0
SUMMARY:Combinatorics Seminar: Bounds on integral flows of graphs and the K
ostant partition function
UID:tag:localist.com\,2008:EventInstance_46138517381206
URL:https://calendar.usc.edu/event/combinatorics-seminar-bounds-on-integral
-flows-of-graphs-and-the-kostant-partition-function
END:VEVENT
END:VCALENDAR