Title: Non-Commutative Algebras and GraphsSpeaker: Chris Godsil Affiliation: University of Waterloo Room: MC 5479
I will discuss some of the non-commutative algebras that arise naturally in graph theory.
Title: Counting subdivergence-free gluing of treesSpeaker: Clair Dai Affiliation: University of Waterloo Room: MC 5417
If we take two rooted trees with the same number of leaves and form a graph by gluing the leaves of one tree to the other, then we say the graph is subdivergence-free if no 2-edge cut have been generated.
Title: The combinatorics of nearest and furthest valuesSpeaker: Lily Wang Affiliation: University of Waterloo Room: MC 5417
A classical problem asks us to find, for each element $A[i]$ of an array of integers, the position of the nearest smallest element.
Title: Bijections among symmetric tableaux via folding and mixed insertionSpeaker: Yuval Ohapkin Affiliation: University of Waterloo Room: MC 5417
A standard Young tableau with entries $-M < \cdots -1 < 1 < \cdots < M$ can be "folded" by performing certain conversions and rectifications in sequence.