Abstract: The number of (full) binary trees with n internal vertices is famously the Catalan number (2n)!/(n!(n+1!). Twenty years ago, Dr. Werner Krandick published a combinatorial gem investigating certain "jump" statistics on such trees, and related them to trees that occur in real root isolation.

 

Dr. Doron Zeilberger, Distinguished Professor of Mathematics at Rutgers University, New Brunswick, will illustrate the power of symbolic computation (so dear to Krandick) to expand on this theme.

 

Click here to join on Zoom.