Determinant formulas relating to tableaux of bounded height

DOI10.1016/J.AAM.2007.04.007MaRDI QIDQ984023zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Guoce Xin

Publication date 13 July 2010

Published in Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

matchinglattice pathYoung tableaucrossingoscillating tableau

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Combinatorial aspects of representation theory (05E10)

Abstract: Chen et al. recently established bijections for $(d+1)$-noncrossing/ nonnesting matchings, oscillating tableaux of bounded height $d$, and oscillating lattice walks in the $d$-dimensional Weyl chamber. Stanley asked what is the total number of such tableaux of length $n$ and of any shape. We find a determinant formula for the exponential generating function. The same idea applies to prove Gessel's remarkable determinant formula for permutations with bounded length of increasing subsequences. We also give short algebraic derivations for some results of the reflection principle.

Recommendations

• Oscillating tableaux and nonintersecting lattice paths
• scientific article; zbMATH DE number 1522340
• Counting tableaux with row and column bounds
• On standard Young tableaux of bounded height
• A Baxter class of a different kind, and other bijective results using tableau sequences ending with a row shape

Cites work

• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 872231 (Why is no real title available?)
• scientific article; zbMATH DE number 1405492 (Why is no real title available?)
• A fast algorithm for MacMahon's partition analysis
• A linear operator for symmetric functions and tableaux in a strip with given trace
• Andre's reflection proof generalized to the many-candidate ballot problem
• Crossings and nestings of matchings and partitions
• Enumeration of bilaterally symmetric 3-noncrossing partitions
• On the distribution of the length of the longest increasing subsequence of random permutations
• Proof of the alternating sign matrix conjecture
• Random Walk in a Weyl Chamber
• Random walks in Weyl chambers and the decomposition of tensor powers
• Symmetric functions and P-recursiveness
• The Cauchy identity for Sp(2n)
• The On-Line Encyclopedia of Integer Sequences
• The flagged Cauchy determinant

Cited in

(6)

• Combinatorial properties of the numbers of tableaux of bounded height
• Enumeration of bilaterally symmetric 3-noncrossing partitions
• Counting permutations with no long monotone subsequence via generating trees and the kernel method
• Stieltjes moment sequences for pattern-avoiding permutations
• A note on statistical averages for oscillating tableaux
• Bijections for Weyl chamber walks ending on an axis, using arc diagrams and Schnyder woods

Describes a project that uses

Uses Software

• bs3np
• ROBBINS
• OEIS

This page was built for publication: Determinant formulas relating to tableaux of bounded height

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