Asymptotics of Traces of Paths in the Young and Schur Graphs


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

Let G be a graded graph with levels V0, V1, . . .. Fix m and choose a vertex v in Vn where n ≥ m. Consider the uniform measure on the paths from V0 to v. Each such path has a unique vertex at the level Vm, so a measure \( {\nu}_v^m \) on Vm is induced. It is natural to expect that these measures have a limit as the vertex v goes to infinity in some “regular” way. We prove this (and compute the limit) for the Young and Schur graphs, for which regularity is understood as follows: the fraction of boxes contained in the first row and the first column goes to 0. For the Young graph, this was essentially proved by Vershik and Kerov in 1981; our proof is more straightforward and elementary.

About the authors

F. V. Petrov

St. Petersburg Department of Steklov Institute of Mathematics and St. Petersburg State University

Author for correspondence.
Email: fedyapetrov@gmail.com
Russian Federation, St. Petersburg

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2019 Springer Science+Business Media, LLC, part of Springer Nature