Identities for the number of standard Young tableaux in some (k,l)-hooks

MaRDI QIDQ624820zbMATHFDO

Authors Amitai Regev

Publication date 9 February 2011

Published in Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

hooknumber of standard Young tableaux

Mathematics Subject Classification ID

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

Abstract: Closed formulas are known for $S(k,0;n)$, the number of standard Young tableaux of size $n$ and with at most $k$ parts, where $1lekle5$. Here we study the analogue problem for $S(k,ell;n)$, the number of standard Young tableaux of size $n$ which are contained in the $(k,ell)$ hook. We deduce some formulas for the cases $k+ellle4$.

Recommendations

• Standard Young tableaux of height 4 and 5
• Maximal degrees for Young diagrams in the \((k,l)\) hook
• Bijective proofs of the hook formulas for the number of standard Young tableaux, ordinary and shifted
• Probabilities in the \((k,l)\) hook
• Standard Young tableaux in a \(( 2 , 1 )\)-hook and Motzkin paths

Cited in

(8)

• Probabilities in the \((k,l)\) hook
• Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata
• Standard Young tableaux of height 4 and 5
• On two related questions of Wilf concerning standard Young tableaux
• Asymptotics of Young tableaux in the \((k,\ell)\) hook
• Number of standard strong marked tableaux
• Enumeration of Standard Young Tableaux
• Pattern avoidance of generalized permutations

This page was built for publication: Identities for the number of standard Young tableaux in some \((k,l)\)-hooks

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