A bijection between certain non-crossing partitions and sequences

Simple item page
dc.creatorNatarajan, Rekha
dc.date2005-07-19
dc.date.accessioned2026-07-07T05:21:51Z
dc.date.available2026-07-07T05:21:51Z
dc.descriptionWe present a bijection between non-crossing partitions of the set $[2n+1]$ into $n+1$ blocks such that no block contains two consecutive integers, and the set of sequences $\{s_{i}\}_{1}^{n}$ such that $1 \leq s_{i} \leq i$, and if $s_{i}=j$, then $s_{i-r} \leq j-r$ for $1 \leq r \leq j-1$.
dc.description8 pages, 6 figures
dc.identifierhttps://arxiv.org/abs/math/0507397
dc.identifierhttp://arxiv.org/abs/math/0507397
dc.identifierDiscrete Mathematics 286 (2004) 269-275
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/75841
dc.subjectCombinatorics
dc.titleA bijection between certain non-crossing partitions and sequences
dc.typetext

Files

Collections

arXiv