Event Detail

Event Type: 
Department Colloquium
Friday, November 9, 2007 - 08:00
Kidd 364

Speaker Info

Willamette University

We examine a certain class of three-regular graphs used to represent one-face maps. Numerical studies have revealed that the eigenvalue statistics of these graphs are the same as those of much larger and more widely studied classes of random matrices. Examining genus zero one-face maps, we find the eigenvalue statistics are strikingly different. In this talk, we will show how Dyck paths can be used to represent genus zero one-face maps, and how this representation can be used to recast questions about the probabilistic structure of random planar trees into straightforward counting problems.