Bijections for refined restricted permutations

Simple item page
dc.creatorElizalde, Sergi
dc.creatorPak, Igor
dc.date2002-12-23
dc.date.accessioned2026-07-07T04:54:02Z
dc.date.available2026-07-07T04:54:02Z
dc.descriptionWe present a bijection between 321- and 132-avoiding permutations that preserves the number of fixed points and the number of excedances. This gives a simple combinatorial proof of recent results of Robertson, Saracino and Zeilberger, and the first author. We also show that our bijection preserves additional statistics, which extends the previous results.
dc.description9 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/math/0212328
dc.identifierhttp://arxiv.org/abs/math/0212328
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/66085
dc.subjectCombinatorics
dc.subject05A05
dc.titleBijections for refined restricted permutations
dc.typetext

Files

Collections

arXiv