pith. sign in

arxiv: math/0606170 · v1 · submitted 2006-06-08 · 🧮 math.CO · math.GR· math.GT

Meanders in a Cayley graph

classification 🧮 math.CO math.GRmath.GT
keywords graphmeanderscayleygammalambdalineorderplane
0
0 comments X
read the original 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 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.