Estimate of time needed for a coordinate of a Bernoulli scheme to fall into the first column of a Young tableau

DOI10.1134/S0016266320020069zbMath1450.05096OpenAlexW3086820836MaRDI QIDQ2206357

I. F. Azangulov, G. V. Ovechkin

Publication date: 22 October 2020

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

Full work available at URL: https://doi.org/10.1134/s0016266320020069

zbMATH Keywords

permutationsRSK algorithmBernoulli scheme

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of representation theory (05E10) Grassmannians, Schubert varieties, flag manifolds (14M15)

Related Items (2)

Combinatorial encoding of Bernoulli schemes and the asymptotic behavior of Young tableaux ⋮ Poisson limit of bumping routes in the Robinson-Schensted correspondence

Cites Work

• Unnamed Item
• Unnamed Item
• Jeu de taquin dynamics on infinite Young tableaux and second class particles
• Permutations, matrices, and generalized Young tableaux
• The Characters of the Infinite Symmetric Group and Probability Properties of the Robinson–Schensted–Knuth Algorithm

This page was built for publication: Estimate of time needed for a coordinate of a Bernoulli scheme to fall into the first column of a Young tableau