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:20241130T140000
RDATE:20250309T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
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:20250309T030000
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:93f2229772a9b230ee35f8a14687f5f2
CATEGORIES:Discrete Math
CREATED:20251128T110236
SUMMARY:Daniel Zhu - Hypercube Turán problems
LOCATION:Hill 705
DESCRIPTION:Speaker: Daniel Zhu (https://www.math.princeton.edu/people/daniel-zhu) (Pri
 nceton)\nTitle: Hypercube Turán problems\nAbstract: What is the smallest su
 bset of the hypercube {0, 1}^n that intersects every two-dimensional face? 
 What is the largest subgraph of the hypercube graph Q_n that doesn't contai
 n an 8-cycle? These questions are all examples of Turán problems on the hyp
 ercube, where we seek the minimum size of a subset (of either vertices and 
 edges) of the hypercube that guarantees the existence of a certain structur
 e. We discuss a framework for tackling such questions and some unexpected c
 onnections to structural graph theory and matroids.\n\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: 10pt; font-family: Lato; colo
 r: #000000; background-color: transparent; font-weight: bold; font-style: n
 ormal; font-variant: normal; text-decoration: none; vertical-align: baselin
 e; white-space: pre-wrap;"> </span><a href="https://www.math.princeton.edu/
 people/daniel-zhu" style="text-decoration: none;"><span style="font-size: 1
 1pt; font-family: Lato; color: #cc0000; background-color: transparent; font
 -weight: 400; font-style: normal; font-variant: normal; text-decoration: un
 derline; vertical-align: baseline; white-space: pre-wrap;">Daniel Zhu</span
 ></a><span style="font-size: 11pt; font-family: Lato; color: #000000; backg
 round-color: transparent; font-weight: 400; font-style: normal; font-varian
 t: normal; text-decoration: none; vertical-align: baseline; white-space: pr
 e-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;">: Hypercube Turán p
 roblems</span></p><p dir="ltr" style="line-height: 1.38; margin-top: 9pt; m
 argin-bottom: 0pt;"><span style="font-size: 11pt; font-family: Lato; color:
  #000000; background-color: transparent; font-weight: bold; font-style: nor
 mal; font-variant: normal; text-decoration: none; vertical-align: baseline;
  white-space: pre-wrap;">Abstract</span><span style="font-size: 11pt; font-
 family: Lato; color: #000000; background-color: transparent; font-weight: 4
 00; font-style: normal; font-variant: normal; text-decoration: none; vertic
 al-align: baseline; white-space: pre-wrap;">: What is the smallest subset o
 f the hypercube {0, 1}^n that intersects every two-dimensional face? What i
 s the largest subgraph of the hypercube graph Q_n that doesn't contain an 8
 -cycle? These questions are all examples of Turán problems on the hypercube
 , where we seek the minimum size of a subset (of either vertices and edges)
  of the hypercube that guarantees the existence of a certain structure. We 
 discuss a framework for tackling such questions and some unexpected connect
 ions to structural graph theory and matroids.</span></p><p dir="ltr" style=
 "line-height: 1.38; margin-top: 9pt; margin-bottom: 0pt;"><span style="font
 -size: 11pt; font-family: Lato; color: #000000; background-color: transpare
 nt; font-weight: bold; font-style: normal; font-variant: normal; text-decor
 ation: none; vertical-align: baseline; white-space: pre-wrap;"></span></p>
DTSTAMP:20260827T135020
DTSTART;TZID=America/New_York:20251201T140000
DTEND;TZID=America/New_York:20251201T150000
SEQUENCE:0
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR