BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//jEvents 2.0 for Joomla//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:STANDARD
DTSTART:20251102T010000
RDATE:20260308T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20261101T010000
RDATE:20270314T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20271107T010000
RDATE:20280312T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20281105T010000
RDATE:20290311T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20250426T140000
RDATE:20251102T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20260308T030000
RDATE:20261101T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20270314T030000
RDATE:20271107T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20280312T030000
RDATE:20281105T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:8bb13db2646fef20e5c09b7f4d04f83a
CATEGORIES:Discrete Math
CREATED:20260422T141718
SUMMARY:Hung-Hsun Yu - The entropy method and the mixture bound
LOCATION:Hill 705
DESCRIPTION:Speaker: Hung-Hsun Yu  (https://sites.google.com/view/hunghsun-hans-yu/)(Pr
 inceton)\nTitle: The entropy method and the mixture bound\nAbstract: In thi
 s talk, I will talk about applications of the entropy method and a tool tha
 t we call the mixture bound. To demonstrate how the mixture bound can be ap
 plied, I will show how one can prove Lovász's version of the Kruskal--Katon
 a theorem. I will also present some recent results on the rainbow triangle 
 problem, which asks to determine the maximum number of rainbow triangles in
  a 3-edge-colored simple graph with a given number of edges. This talk is b
 ased on joint work with Ting-Wei Chao and Maya Sankar. \n
X-ALT-DESC;FMTTYPE=text/html:<p dir="ltr" style="line-height: 1.38; margin-top: 9pt; margin-bottom: 0pt;
 "><span style="font-size: 11pt; font-family: Lato; color: #000000; backgrou
 nd-color: transparent; font-weight: bold; font-style: normal; font-variant:
  normal; text-decoration: none; vertical-align: baseline; white-space: pre-
 wrap;">Speaker</span><span style="font-size: 11pt; font-family: Lato; color
 : #000000; background-color: transparent; font-weight: 400; font-style: nor
 mal; font-variant: normal; text-decoration: none; vertical-align: baseline;
  white-space: pre-wrap;">: </span><a href="https://sites.google.com/view/hu
 nghsun-hans-yu/" style="text-decoration: none;"><span style="font-size: 11p
 t; font-family: Lato; color: #cc0000; background-color: transparent; font-w
 eight: 400; font-style: normal; font-variant: normal; text-decoration: unde
 rline; vertical-align: baseline; white-space: pre-wrap;">Hung-Hsun Yu </spa
 n></a><span style="font-size: 11pt; font-family: Lato; color: #212121; back
 ground-color: transparent; font-weight: 400; font-style: normal; font-varia
 nt: normal; text-decoration: none; vertical-align: baseline; white-space: p
 re-wrap;">(Princeton)</span></p><p dir="ltr" style="line-height: 1.38; marg
 in-top: 9pt; margin-bottom: 10pt;"><span style="font-size: 11pt; font-famil
 y: Lato; color: #000000; background-color: transparent; font-weight: bold; 
 font-style: normal; font-variant: normal; text-decoration: none; vertical-a
 lign: baseline; white-space: pre-wrap;">Title</span><span style="font-size:
  11pt; font-family: Lato; color: #000000; background-color: transparent; fo
 nt-weight: 400; font-style: normal; font-variant: normal; text-decoration: 
 none; vertical-align: baseline; white-space: pre-wrap;">: The entropy metho
 d and the mixture bound</span></p><p dir="ltr" style="line-height: 1.38; ma
 rgin-top: 9pt; margin-bottom: 0pt;"><span style="font-size: 11pt; font-fami
 ly: Lato; color: #000000; background-color: transparent; font-weight: bold;
  font-style: normal; font-variant: normal; text-decoration: none; vertical-
 align: baseline; white-space: pre-wrap;">Abstract</span><span style="font-s
 ize: 11pt; font-family: Lato; color: #000000; background-color: transparent
 ; font-weight: 400; font-style: normal; font-variant: normal; text-decorati
 on: none; vertical-align: baseline; white-space: pre-wrap;">: In this talk,
  I will talk about applications of the entropy method and a tool that we ca
 ll the mixture bound. To demonstrate how the mixture bound can be applied, 
 I will show how one can prove Lovász's version of the Kruskal--Katona theor
 em. I will also present some recent results on the rainbow triangle problem
 , which asks to determine the maximum number of rainbow triangles in a 3-ed
 ge-colored simple graph with a given number of edges. This talk is based on
  joint work with Ting-Wei Chao and Maya Sankar.&nbsp;</span></p>
DTSTAMP:20260829T003007
DTSTART;TZID=America/New_York:20260427T140000
DTEND;TZID=America/New_York:20260427T150000
SEQUENCE:0
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR