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:20240130T140000
RDATE:20240310T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20241103T010000
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:20240310T030000
RDATE:20241103T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
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:394f0d160d5ba93f2cdf32b18dea0c45
CATEGORIES:Colloquia
CREATED:20250116T155856
SUMMARY:Colloquium: Cosmin Pohoata - The Heilbronn triangle problem
LOCATION:Hill 705
DESCRIPTION:Speaker:  Cosmin Pohoata, Emory\n\nTime and place:  Thursday January 30 at 
 2:00, Hill 705\n\nTitle: The Heilbronn triangle problemAbstract: How can on
 e place n points in the unit square so that no three points form a triangle
  with small area? This is the content of the so-called Heilbronn triangle p
 roblem, a classical problem in discrete geometry with several old and new c
 onnections to various topics in extremal and additive combinatorics, graph 
 theory, incidence geometry, harmonic analysis, and number theory. In this t
 alk, we will give an overview of some of these connections, and discuss som
 e recent developments. Based on joint work with Alex Cohen and Dmitrii Zakh
 arov. \n
X-ALT-DESC;FMTTYPE=text/html:<div style="font-style: normal; font-weight: 400; letter-spacing: normal; t
 ext-align: start; text-indent: 0px; text-transform: none; white-space: norm
 al; word-spacing: 0px; text-decoration: none; color: #000000; font-family: 
 UICTFontTextStyleBody; font-size: 21px;"><strong>Speaker:&nbsp;&nbsp;</stro
 ng>Cosmin Pohoata, Emory<br><br><strong>Time and place:&nbsp;&nbsp;</strong
 ><span dir="ltr" style="color: currentcolor;">Thursday January 30 at 2:00</
 span>, Hill 705<br><br><strong>Title</strong>: The Heilbronn triangle probl
 em</div><p><br style="font-style: normal; font-weight: 400; letter-spacing:
  normal; text-align: start; text-indent: 0px; text-transform: none; white-s
 pace: normal; word-spacing: 0px; text-decoration: none; color: #000000; fon
 t-family: UICTFontTextStyleBody; font-size: 21px;"><strong style="font-styl
 e: normal; letter-spacing: normal; text-align: start; text-indent: 0px; tex
 t-transform: none; white-space: normal; word-spacing: 0px; text-decoration:
  none; color: #000000; font-family: UICTFontTextStyleBody; font-size: 21px;
 ">Abstract</strong><span style="font-style: normal; font-weight: 400; lette
 r-spacing: normal; text-align: start; text-indent: 0px; text-transform: non
 e; white-space: normal; word-spacing: 0px; text-decoration: none; color: #0
 00000; font-family: UICTFontTextStyleBody; font-size: 21px; background-colo
 r: #ffffff; float: none;">:&nbsp;How can one place n points in the unit squ
 are so that no three points form a triangle with small area?&nbsp;This is t
 he content of the so-called Heilbronn triangle problem, a classical problem
  in discrete geometry with several old and new connections to various topic
 s in extremal and additive combinatorics, graph theory, incidence geometry,
  harmonic analysis, and number theory. In this talk, we will give an overvi
 ew of some of these connections, and discuss some recent developments. Base
 d on joint work with Alex Cohen and Dmitrii Zakharov.&nbsp;</span></p>
CONTACT:Cosmin Pohoata
DTSTAMP:20260826T145752
DTSTART;TZID=America/New_York:20250130T140000
DTEND;TZID=America/New_York:20250130T150000
SEQUENCE:0
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR