BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of California\, Berkeley//UCB Events Calendar//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
DTSTART:19701029T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:19700402T020000
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20180116T082214Z
DTSTART;TZID=America/Los_Angeles:20180212T140000
DTEND;TZID=America/Los_Angeles:20180212T160000
TRANSP:OPAQUE
SUMMARY:Probabilistic operator Algebra Seminar: Asymptotics for a class of meandric systems\, via the Hasse diagram of $NC(n)$
UID:114449-ucb-events-calendar@berkeley.edu
ORGANIZER;CN="UC Berkeley Calendar Network":
LOCATION:736 Evans Hall
DESCRIPTION:Alexandru Nica\, University of Waterloo\n\nI will present a joint paper with Ian Goulden and Doron Puder (arXiv:1708.05188)\, concerning a family of diagrammatic objects called meandric systems. These objects have received a substantial amount of interest from mathematical physicists and from combinatorialists\, and the study of the number of components of a random meandric system offers some very appealing\, yet difficult problems. In particular\, we are not aware of any precise results concerning the asymptotic behaviour for $n \\rightarrow \\infty$ of the expected number of components of a random meandric system of order $n$. It is known that an equivalent description of the framework of meandric systems can be obtained by looking at the Hasse diagrams (i.e. graphs of covers) of the lattices of non-crossing partitions $NC(n)$\, and by studying the distance between two random partitions in $NC(n)$. By using this point of view we identify a non-trivial class of meandric systems “with shallow top”\, for which we can determine the precise asymptotic for expected number of components. The calculations leading to this result are inspired by free probability methods\, specifically by the idea of taking derivative at time $t = 1$ in a semigroup for free additive convolution. Let $c_n$ denote the expected number of components of a general meandric system of order $n$. By using a variation of the methods from the shallow-top case\, we prove that $c_n$ is in the interval $[0.17n\,0.51n]$ for n large enough. These bounds support the conjecture that $c_n$ follows a regime of “constant times $n$”\, where numerical experiments suggest that the constant is around 0.23. If time permits\, I will also present another result of the same paper\, giving a precise formula for the number of connected meandric systems (a.k.a. “meanders”) of order n which have shallow top. The formula is derived as a consequence of a bijection between meanders with shallow top and a class of trees. The average growth rate for meanders with shallow top comes out smaller than the estimates known for the growth rate for general meanders\, confirming the heuristics that a meandric system with shallow top is likely to have more components (and is less likely to be connected) than a general one.
URL:http://events.berkeley.edu/index.php/calendar/sn/pubaff.html?event_ID=114449&view=preview
SEQUENCE:0
CLASS:PUBLIC
CREATED:20180116T082214Z
LAST-MODIFIED:20180116T082214Z
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-OWNERAPPTID:-1
END:VEVENT
END:VCALENDAR