Enumeration of bilaterally symmetric 3-noncrossing partitions

DOI10.1016/J.DISC.2008.06.007MaRDI QIDQ1025510zbMATH OpenOpenAlexFDO

Authors Guoce Xin, Terence Y. J. Zhang

Publication date 19 June 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0810.1344

zbMATH Keywords

\(D\)-finite\(P\)-recurrencepartitionRSK-correspondencetableau

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18)

Abstract: Schutzenberger'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.

Recommendations

• Enumeration of bilaterally symmetric 3-noncrossing partitions
• Crossings and nestings of matchings and partitions
• Some properties of crossings and partitions
• A simple bijection for enhanced, classical, and 2-distant \(k\)-noncrossing partitions
• Distribution of crossings, nestings and alignments of two edges in matchings and partitions

Cites work

• A fast algorithm for MacMahon's partition analysis
• A residue theorem for Malcev-Neumann series.
• Baxter permutations
• Crossings and nestings of matchings and partitions
• D-finite power series
• Determinant formulas relating to tableaux of bounded height
• Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
• Generalized Robinson-Schensted-Knuth correspondence
• Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 872231 (Why is no real title available?)
• La correspondance de Robinson
• On partitions avoiding 3-crossings
• Permutations, matrices, and generalized Young tableaux
• Resurrecting the asymptotics of linear recurrences
• Schur operators and Knuth correspondences
• The method of creative telescoping
• The number of Baxter permutations
• Walks in the quarter plane: Kreweras' algebraic model

Cited in

(8)

• Bijections for Weyl chamber walks ending on an axis, using arc diagrams and Schnyder woods
• Bijections for walks ending on an axis, using open arc diagrams
• Enumeration of bilaterally symmetric 3-noncrossing partitions
• Bipartite 3-regular counting problems with mixed signs
• On refinements of Wilf-equivalence for involutions
• Equidistribution of set-valued statistics on standard Young tableaux and transversals
• Tableau sequences, open diagrams, and Baxter families
• Determinant formulas relating to tableaux of bounded height

Describes a project that uses

Uses Software

• OEIS
• Maple
• bs3np

This page was built for publication: Enumeration of bilaterally symmetric 3-noncrossing partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025510)