Meanders in a Cayley graph

Details Meanders in a Cayley graph Meanders in a Cayley graph

2006-06-08

arxiv.org/abs/math/0606170v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Meanders in a Cayley graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Meanders in a Cayley graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Meanders in a Cayley graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-507339