Enumeration of $(k,2)$-noncrossing partitions

Simple item page
dc.creatorMansour, Toufik
dc.creatorSeverini, Simone
dc.date2008-08-08
dc.date.accessioned2026-07-07T09:55:39Z
dc.date.available2026-07-07T09:55:39Z
dc.descriptionA set partition is said to be $(k,d)$-noncrossing if it avoids the pattern $12... k12... d$. We find an explicit formula for the ordinary generating function of the number of $(k,d)$-noncrossing partitions of $\{1,2,...,n\}$ when $d=1,2$.
dc.description9 pages, 1 table
dc.identifierhttps://arxiv.org/abs/0808.1157
dc.identifierhttp://arxiv.org/abs/0808.1157
dc.identifierDiscrete Mathematics 308:20 (2008) 4570-4577
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/166702
dc.subjectCombinatorics
dc.subject05A05; 05A15
dc.titleEnumeration of $(k,2)$-noncrossing partitions
dc.typetext

Files

Collections

arXiv