A bijection on Dyck paths and its cycle structure

dc.creatorCallan, David
dc.date2006-11-22
dc.date.accessioned2026-07-07T07:33:14Z
dc.date.available2026-07-07T07:33:14Z
dc.descriptionThe known bijections on Dyck paths are either involutions or have notoriously intractable cycle structure. Here we present a size-preserving bijection on Dyck paths whose cycle structure is amenable to complete analysis. In particular, each cycle has length a power of 2. A new manifestation of the Catalan numbers as labeled forests crops up enroute as does the Pascal matrix mod 2. We use the bijection to show the equivalence of two known manifestations of the Motzkin numbers. Finally, we consider some statistics on the new Catalan manifestation.
dc.description17 pages. Uses PSTricks for tree diagrams and Krattenthaler's LaTeX code for lattice path diagrams. No external (.eps) figures
dc.identifierhttps://arxiv.org/abs/math/0611698
dc.identifierhttp://arxiv.org/abs/math/0611698
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/119382
dc.subjectCombinatorics
dc.subject05A15; 05A19
dc.titleA bijection on Dyck paths and its cycle structure
dc.typetext

Files

Collections