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:20250311T170000
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:d1188dd9f4cdbe038b4e2d2bcd6e660f
CATEGORIES:Experimental Mathematics Seminar
CREATED:20260219T183538
SUMMARY: Counting Colored Trees
LOCATION:https://rutgers.zoom.us/j/95103383827    password: 6564120420
DESCRIPTION:<p style="color: #000000; font-family: 'Times New Roman'; font-size: medium
 ; font-weight: 400; letter-spacing: normal; orphans: 2; text-align: start; 
 text-indent: 0px; text-transform: none; white-space: normal; widows: 2; wor
 d-spacing: 0px;">A plane tree is a rooted tree where each node's children h
 ave a left-to-right order. Classically, the number of plane trees with n+1 
 vertices is equal to the nth Catalan number. We can generalize this basic e
 numeration problem to plane trees with colored vertices. We consider colori
 ng rules that, given the color of the parent node, restrict the choices of 
 how to color the children. This general framework is fertile ground for com
 binatorial exploration. For one thing, it generalizes many different exampl
 es that have been studied in the literature. It also leads to many new resu
 lts, including bijections with other known problems. In this talk, we will 
 explore various families of coloring rules and explore the integer sequence
 s that enumerate plane trees colored according to those rules. This is join
 t work with Stoyan Dimitrov, Kimberly Hadaway, Ashley Tharp, and Stephan Wa
 gner.</p>
CONTACT: Nathan Fox, Canisius University
DTSTAMP:20260828T060814
DTSTART;TZID=America/New_York:20260312T170000
DTEND;TZID=America/New_York:20260312T180000
SEQUENCE:0
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR