BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal: Date iCal//NONSGML kigkonsult.se iCalcreator 2.18//
METHOD:PUBLISH
X-WR-CALNAME;VALUE=TEXT:Calendar of Events
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:STANDARD
DTSTART:20261101T020000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20260308T020000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.69990.field_date.0@calendar.lafayette.edu
DTSTAMP:20260716T164024Z
DESCRIPTION:*Title*: An introduction to noncrossing partitions\n*Abstract*:
  Given a configuration of points in the plane\, its 'convex hull' \nis the
  smallest convex polygon which contains those points—imagine the area \nco
 ntained by a rubber band which is being held in place by some thumb tacks.
  \nRelatedly\, a 'noncrossing partition' of points in the plane is a way o
 f \ngrouping those points into parts so that the convex hulls of the parts
  do not \noverlap. In this talk\, I will provide an overview of noncrossin
 g partitions \nand some results from previous work of mine with undergradu
 ate coauthors \nCohen\, Harsh\, Martin (2022)\; Fang\, Jiang\, Lin\, Linde
 nmuth\, Pokras\, Root \n(2024)\; and Root (2025). This will include some c
 onnections to combinatorics \nand abstract algebra\, but no prior backgrou
 nd will be needed.\n 
DTSTART;TZID=America/New_York:20251204T121500
DTEND;TZID=America/New_York:20251204T131500
LAST-MODIFIED:20251201T153147Z
LOCATION:Pardee 217
SUMMARY:MAAD talk - An introduction to noncrossing partitions
URL;TYPE=URI:https://calendar.lafayette.edu/node/69990
END:VEVENT
END:VCALENDAR