Lara Pudwell, Rutgers Experimental Mathematics Seminar, September 26, 2013.
See part 2 at vimeo.com/75574041.
Abstract: Pattern-avoiding trees have appeared in various computational contexts since at least the 1980s. A more recent topic of interest is the exact enumeration of trees that avoid some other tree pattern. In 2010, Rowland considered this enumeration problem for rooted, ordered binary trees where tree T contains tree pattern t if and only if T contains t as a contiguous rooted, ordered subtree. In this talk we consider Rowland's contiguous tree patterns as well as non-contiguous tree patterns. We also consider implications of tree enumeration results for pattern-avoiding permutations.
Loading more stuff…
Hmm…it looks like things are taking a while to load. Try again?