The CAGE (Combinatorics, Algebra, and Geometry) Seminar: Doron Zeilberger, 13 November 2024


Refined Counting of Binary Trees (Inspired by Werner Krandick)

Doron Zeilberger | 2024-11-13 at 11:00 AM, at Drexel University, Computer Science, 3675 Market St, room 1053

This is a Krandick lecture at Drexel's CCI. For access to the building, please RSVP to Darij Grinberg (dg899@drexel.edu) and Vanessa Rodriques (vr437@drexel.edu).

Abstract: The number of (full) binary trees with \( n \) internal vertices is famously the Catalan number \( \dfrac{(2n)!}{n! (n+1)!} \) . Twenty years ago, Werner Krandick published a combinatorial gem investigating certain "jump" statistics on such trees, and related them to trees that occur in real root isolation. I will illustrate the power of symbolic computation (so dear to Krandick) to expand on this theme.


Back to the seminar homepage.