Meanders in a Cayley graph
Abstract
A meander of order n is a simple closed curve in the plane which intersects a horizontal line transversely at 2n points. (Meanders which differ by an isotopy of the line and plane are considered equivalent.) Let Gamman be the Cayley graph of the symmetric group Sn as generated by all (n choose 2) transpositions. Let Lambdan be any interval of maximal length in Gamman; this graph is the Hasse diagram of the lattice of noncrossing partitions. The meanders of order n are in one-to-one correspondence with ordered pairs of maximally separated vertices of Lambdan.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.