Some combinatorics related to central binomial coefficients: Grand-Dyck paths, coloured noncrossing partitions and signed pattern avoiding permutations

Simple item page
dc.creatorFerrari, Luca
dc.date2008-06-05
dc.date.accessioned2026-07-07T09:42:50Z
dc.date.available2026-07-07T09:42:50Z
dc.descriptionWe give some interpretations to certain integer sequences in terms of parameters on Grand-Dyck paths and coloured noncrossing partitions, and we find some new bijections relating Grand-Dyck paths and signed pattern avoiding permutations. Next we transfer a natural distributive lattice structure on Grand-Dyck paths to coloured noncrossing partitions and signed pattern avoiding permutations, thus showing, in particular, that it is isomorphic to the structure induced by the (strong) Bruhat order on a certain set of signed pattern avoiding permutations.
dc.description25 pages, submitted
dc.identifierhttps://arxiv.org/abs/0806.0973
dc.identifierhttp://arxiv.org/abs/0806.0973
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/162333
dc.subjectCombinatorics
dc.subject06A07; 05A05; 05A19; 06D05
dc.titleSome combinatorics related to central binomial coefficients: Grand-Dyck paths, coloured noncrossing partitions and signed pattern avoiding permutations
dc.typetext

Files

Collections

arXiv