Determinant formulas relating to tableaux of bounded height

DOI10.1016/J.AAM.2007.04.007zbMATH Open1209.05012DBLPjournals/aam/Xin10arXiv0704.3381OpenAlexW2064209384WikidataQ60692084 ScholiaQ60692084MaRDI QIDQ984023FDOQ984023

Guoce Xin

Publication date: 13 July 2010

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

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.

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

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

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)

Cites Work

• The On-Line Encyclopedia of Integer Sequences
• Proof of the alternating sign matrix conjecture
• Title not available (Why is that?)
• On the distribution of the length of the longest increasing subsequence of random permutations
• Symmetric functions and P-recursiveness
• Title not available (Why is that?)
• Crossings and nestings of matchings and partitions
• Random Walk in a Weyl Chamber
• Random walks in Weyl chambers and the decomposition of tensor powers
• Title not available (Why is that?)
• A fast algorithm for MacMahon's partition analysis
• The Cauchy identity for \(Sp(2n)\)
• The flagged Cauchy determinant
• 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
• Enumeration of bilaterally symmetric 3-noncrossing partitions

Cited In (6)

• Combinatorial properties of the numbers of tableaux of bounded height
• Asymptotic lattice path enumeration using diagonals
• 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
• Bijections for Weyl chamber walks ending on an axis, using arc diagrams and Schnyder woods

Uses Software

• OEIS
• ROBBINS
• bs3np

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)