Nestings of Matchings and Permutations and North Steps in PDSAWs

Simple item page
dc.creatorRubey, Martin
dc.date2007-12-17
dc.date2008-04-11
dc.date.accessioned2026-07-07T09:31:27Z
dc.date.available2026-07-07T09:31:27Z
dc.descriptionWe present a simple bijective proof of the fact that matchings of [2n] with N nestings are equinumerous to partially directed self avoiding walks confined to the symmetric wedge defined by y=+-x, with n east steps and N north steps. A very similar construction connects permutations with N nestings and PDSAWs remaining below the x-axis, again with N north steps. Furthermore, both bijections transport several combinatorially meaningful parameters.
dc.description11 pages, 7 figures, corrected some inaccuracies and minor mistakes
dc.identifierhttps://arxiv.org/abs/0712.2804
dc.identifierhttp://arxiv.org/abs/0712.2804
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/158462
dc.subjectCombinatorics
dc.subject05A15
dc.titleNestings of Matchings and Permutations and North Steps in PDSAWs
dc.typetext

Files

Collections

arXiv