Linear Chord Diagrams with Long Chords
Date: 3:30pm - 4:30pm PDT October 19 Location: John Howard 115
John Howard 115
Everett Sullivan, a Visiting Assistant Professor of Mathematics will present his research.
The Ménage problem is a classical combinatorics problem in which couples must sit in a circle so that no one sits next to their partner. In this talk, we will generalize this problem so that the couples sit in a line and require that people sit some minimum distance form their partner.
Solutions to this problem can be described by linear chord diagrams. We will compute the number of such solutions and explore the patterns generated by them.
This talk will be accessible for students who have taken Discrete Mathematics.