A \(q\)-analog of the hook walk algorithm and random Young tableaux

DOI10.1007/BF01075631zbMath0796.05092MaRDI QIDQ1324671

Sergei Kerov

Publication date: 26 July 1994

Published in: Functional Analysis and its Applications (Search for Journal in Brave)

zbMATH Keywords

hook formulaHecke algebrasMarkov tracesPlancherel measureYoung diagramprobability distributionsYoung graphhook walkGreene-Nijenhuis-Wilf algorithmrandom Yound tableaux

Mathematics Subject Classification ID

(q)-calculus and related topics (05A30) Combinatorial aspects of representation theory (05E10) Combinatorial probability (60C05)

Related Items (5)

A formula for the specialization of skew Schur functions ⋮ The combinatorics of \(C^\ast \)-fixed points in generalized Calogero-Moser spaces and Hilbert schemes ⋮ Asymptotics of \(q\)-Plancherel measures. ⋮ Reflection factorizations of Singer cycles ⋮ Statistical properties of eigenvalues of Laplace-Beltrami operators

Cites Work

• Unnamed Item
• Hook formula and related identities
• On growing a random Young tableau
• Locally semisimple algebras. Combinatorial theory and the \(K_ 0\)- functor
• A probabilistic proof of a formula for the number of Young tableaux of a given shape
• Another probabilistic method in the theory of Young tableaux
• The Hook Graphs of the Symmetric Group

This page was built for publication: A \(q\)-analog of the hook walk algorithm and random Young tableaux