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:20231120T121500
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:b2b8648ff4e5b5c2dc650a8ebfc33e22
CATEGORIES:Graduate Student Combinatorics Seminar Sponsored by DIMACS
CREATED:20241113T154512
SUMMARY:How can we define prime vector parking functions?
LOCATION:HLL-701
DESCRIPTION:
CONTACT:Lucy Martinez
X-EXTRAINFO:Abstract: Classical parking functions are a central subject in combinatoric
 s. There are three natural sub-families of parking functions: the increasin
 g ones, the prime ones, and the prime increasing ones. In this talk, we con
 sider the vector parking functions for a non-decreasing sequence of positiv
 e integers $\boldsymbol{u}=(u_0, u_1, \ldots, u_{n-1})$. We say that a sequ
 ence $\boldsymbol{a} = (a_0, a_1, \ldots, a_{n-1})$ is a $\boldsymbol{u}$-p
 arking function of length $n$ if the order statistics of $\boldsymbol{a}$ s
 atisfy $a_{(i)}< u_i$ for each $i$. We propose the proper definition of 
 prime vector parking functions and then investigate combinatorial statistic
 s for the arithmetic vector $\boldsymbol{u}$ given by $u_i=a+bi$. Joint wor
 k with Joanne Beckford, Dillon Hanson, Naomi Krawzik, Olya Mandelshtam, and
  Catherine Yan.
DTSTAMP:20260828T011737
DTSTART;TZID=America/New_York:20241120T121500
DTEND;TZID=America/New_York:20241120T131500
SEQUENCE:0
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR