Enumeration of bilaterally symmetric 3-noncrossing partitions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2008

Enumeration of bilaterally symmetric 3-noncrossing partitions

Abstract

Schützenberger'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 $\mathsf{MAPLE}$ package for $2$-dimensional vacillating lattice walk enumeration problems. As an application, we find an interesting relation between two special bilaterally symmetric partitions.
Fichier principal
Vignette du fichier
dmAJ0160.pdf (221.8 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01185147 , version 1 (19-08-2015)

Identifiers

Cite

Guoce Xin, Terence Y. J. Zhang. Enumeration of bilaterally symmetric 3-noncrossing partitions. 20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008), 2008, Viña del Mar, Chile. pp.705-716, ⟨10.46298/dmtcs.3613⟩. ⟨hal-01185147⟩

Collections

INSMI TDS-MACS
26 View
530 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More