A q-analog of the hook walk algorithm and random Young tableaux
A \(q\)-analog of the hook walk algorithm and random Young tableaux
In the papers [\textit{C. Greene}, \textit{A. Nijenhuis} and \textit{H. S. Wilf}, Adv. Math. 31, 104-109 (1979; Zbl 0398.05008) and J. Comb. Theory, Ser. A 37, 127-135 (1984; Zbl 0561.05004)] a remarkable probabilistic algorithm, the hook walk, was introduced. It was used there for two purposes: to give a new probabilistic proof of the hook formula and to generate random Young tableaux distributed according to the Plancherel measure. In the present paper we suggest new applications of the original Greene- Nijenhuis-Wilf algorithm and define a \(q\)-analog of this algorithm. Two applications of the generalized version of the algorithm are presented. The first application deals with an interesting family of probability distributions on the space of (infinite) Young tableaux. This family can be considered as a \(q\)-deformation of the Plancherel measure, and its distributions are in one-to-one correspondence with Markov traces on Hecke algebras (these traces arise in the algebraic construction of link and knot invariants defined by Jones). The new algorithm provides an efficient generation procedure for random Young tableaux with these distributions. The second application is related to a new interpretation of the well- known \(q\)-analog of the hook formula. We show that one can associate multiplicities (depending on \(q\) rationally) with the edges of a Young graph in such a way that the \(q\)-dimension of a Young diagram, defined recurrently, is given by the \(q\)-hook formula. In the particular case \(q=1\) all the edges are simple and the proof yields the classical formula.
- 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
- Hook formula and related identities
- scientific article; zbMATH DE number 3766017 (Why is no real title available?)
- Locally semisimple algebras. Combinatorial theory and the \(K_ 0\)- functor
- On growing a random Young tableau
- The Hook Graphs of the Symmetric Group
- On growing a random Young tableau
- A random q,t-hook walk and a sum of Pieri coefficients
- A q-analog of the hook walk algorithm for random Young tableaux
- Explicit formulas for hook walks on continual Young diagrams
- Statistical properties of eigenvalues of Laplace-Beltrami operators
- Uncrowding algorithm for hook-valued tableaux
- The combinatorics of \(C^\ast \)-fixed points in generalized Calogero-Moser spaces and Hilbert schemes
- Randomized Schützenberger's jeu de taquin and approximate calculation of the cotransition probabilities of a central Markov process on the 3D Young graph
- Asymptotics of \(q\)-Plancherel measures.
- \(q\)-analog of tableau containment
- A formula for the specialization of skew Schur functions
- Reflection factorizations of Singer cycles
- Longest increasing subsequences, Plancherel-type measure and the Hecke insertion algorithm
This page was built for publication: A \(q\)-analog of the hook walk algorithm and random Young tableaux
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1324671)
