Enumeration of bilaterally symmetric 3-noncrossing partitions

Simple item page
dc.creatorXin, Guoce
dc.creatorZhang, Terence Y. J.
dc.date2008-10-08
dc.date.accessioned2026-07-07T10:08:28Z
dc.date.available2026-07-07T10:08:28Z
dc.descriptionSchutzenberger's theorem for the ordinary RSK correspondence naturally extends to Chen et. al's correspondence for matchings and partitions. Thus the counting of bilaterally symmetric $k$-noncrossing partitions naturally arises as an analogue for involutions. In obtaining the analogous result for 3-noncrossing partitions, we use a different technique to develop a Maple package for 2-dimensional vacillating lattice walk enumeration problems. The package also applies to the hesitating case. As applications, we find several interesting relations for some special bilaterally symmetric partitions.
dc.description22 pages
dc.identifierhttps://arxiv.org/abs/0810.1344
dc.identifierhttp://arxiv.org/abs/0810.1344
dc.identifierdoi:10.1016/j.disc.2008.06.007
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/171003
dc.subjectCombinatorics
dc.subject05A15; 05A18, 05E10
dc.titleEnumeration of bilaterally symmetric 3-noncrossing partitions
dc.typetext

Files

Collections

arXiv