Meanders in a Cayley graph

Simple item page
dc.creatorHall, H. Tracy
dc.date2006-06-08
dc.date.accessioned2026-07-07T07:17:02Z
dc.date.available2026-07-07T07:17:02Z
dc.descriptionA 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.
dc.identifierhttps://arxiv.org/abs/math/0606170
dc.identifierhttp://arxiv.org/abs/math/0606170
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/113802
dc.subjectCombinatorics
dc.subjectGroup Theory
dc.subjectGeometric Topology
dc.subject57M20
dc.titleMeanders in a Cayley graph
dc.typetext

Files

Collections

arXiv