Monday, November 10, 2025 11:30 am
-
12:30 pm
EST (GMT -05:00)
Title: Eigenpolytopes
| Speaker: | Chris Godsil |
| Affiliation: |
University of Waterloo |
| Location: | Please contact Sabrina Lato for Zoom link. |
Abstract: Each eigenspace of a graph gives rise to a real convex polytope. This connection works best for highly regular graphs - distance-regular graphs or, more generally, walk-regular graphs. I will discuss this relationship and give some applications, including a proof of the Erdos-Ko-Rado theorem.