arXiv:math/0606170 [math.CO]AbstractReferencesReviewsResources
Meanders in a Cayley graph
Published 2006-06-08Version 1
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 Gamma_n be the Cayley graph of the symmetric group S_n as generated by all (n choose 2) transpositions. Let Lambda_n be any interval of maximal length in Gamma_n; 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 Lambda_n.
Subjects: 57M20
Related articles: Most relevant | Search more
On distance two in Cayley graphs of Coxeter groups
arXiv:1502.07392 [math.CO] (Published 2015-02-25)
Spectra of Cayley Graphs of Complex Reflection Groups
arXiv:2011.14604 [math.CO] (Published 2020-11-30)
Factor of i.i.d. processes and Cayley diagrams