BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of California\, Berkeley//UCB Events Calendar//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
DTSTART:19701029T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:19700402T020000
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20181026T101831Z
DTSTART;TZID=America/Los_Angeles:20181105T121000
DTEND;TZID=America/Los_Angeles:20181105T130000
TRANSP:OPAQUE
SUMMARY:Combinatorics Seminar: Inequalities for families of symmetric functions
UID:121151-ucb-events-calendar@berkeley.edu
ORGANIZER;CN="UC Berkeley Calendar Network":
LOCATION:939 Evans Hall
DESCRIPTION:Curtis Greene\, Haverford College and MSRI\n\nWe are interested in families of inequalities of the form $f(X) \\geq g(X)$\, where $f(X)$ and $g(X)$ are symmetric polynomials in $X = (x_1\,...\,x_n)$ and the inequality must hold for all nonnegative substitutions of the variables. We will focus initially on inequalities involving well known combinatorial families (elementary\, monomial\, Schur\, etc.). Far too much is known to permit a comprehensive survey\, even within this limited scope\, but there will be time to mention several interesting open problems and conjectures. The second part of the talk concerns a "positivity principle" that can be used to prove most (if not all) known symmetric function inequalities of this type\, and apparently has not been studied before. Eventually\, such proofs rest entirely on tableau combinatorics.
URL:http://events.berkeley.edu/index.php/calendar/sn/pubaff.html?event_ID=121151&view=preview
SEQUENCE:0
CLASS:PUBLIC
CREATED:20181026T101831Z
LAST-MODIFIED:20181026T101831Z
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-OWNERAPPTID:-1
END:VEVENT
END:VCALENDAR