Related papers: The boundary of Young graph with Jack edge multipl…
We study the Young graph with edge multiplicities arising in a Pieri-type formula for Jack symmetric polynomials $P_\mu(x;a)$ with a parameter $a$. Starting with the empty diagram, we define recurrently the `dimensions' $\dim_a$ in the same…
We find the Martin boundary for the Young-Fibonacci lattice YF. Along with the lattice of Young diagrams, this is the most interesting example of a differential poset. The Martin boundary construction provides an explicit Poisson-type…
We construct examples of nonnegative harmonic functions on certain graded graphs: the Young lattice and its generalizations. Such functions first emerged in harmonic analysis on the infinite symmetric group. Our method relies on…
The graph of zigzag diagrams is a close relative of Young's lattice. The boundary problem for this graph amounts to describing coherent random permutations with descent-set statistic, and is also related to certain positive characters on…
We show that the order on probability measures, inherited from the dominance order on the Young diagrams, is preserved under natural maps reducing the number of boxes in a diagram by $1$. As a corollary we give a new proof of the Thoma…
The Gelfand-Tsetlin graph is an infinite graded graph that encodes branching of irreducible characters of the unitary groups. The boundary of the Gelfand-Tsetlin graph has at least three incarnations --- as a discrete potential theory…
In this paper, we consider the Johnson's graphs. We study the extremal properties of the Johnson's graphs. Namely, we investigate the number of edges in an arbitrary subgraph of this graph. Namely, in this article we prove analogs of…
Consider a fixed connected, finite graph $\Gamma$ and equip its vertices with weights $p_i$ which are non-negative integers. We show that there is a finite number of possibilities for the coefficients of the canonical cycle of a numerically…
We describe the asymptotic behavior of the multivariate BC-type Jacobi polynomials as the number of variables and the Young diagram indexing the polynomial go to infinity. In particular, our results describe the approximation of the…
We introduce a large class of random Young diagrams which can be regarded as a natural one-parameter deformation of some classical Young diagram ensembles; a deformation which is related to Jack polynomials and Jack characters. We show that…
Let $p$ be a real number greater than one and let $\Gamma$ be a connected graph of bounded degree. We show that the $p$-Royden boundary of $\Gamma$ with the $p$-harmonic boundary removed is a $F_{\sigma}$-set. We also characterize the…
Boundary analysis is developed for a rich class of generally infinite weighted graphs with compact metric completions. These graph completions have totally disconnected boundaries. The classical notion of $\epsilon$-components and the…
This paper establishes universal formulas describing the global asymptotics of two distinct discrete versions of $\beta$-ensembles in the high, low and fixed temperature regimes. Our results affirmatively answer a question posed by the…
This paper introduces new structural decompositions for almost symmetric numerical semigroups through the combinatorial lens of Young diagrams. To do that, we use the foundational correspondence between numerical sets and Young diagrams,…
We introduce Jack (unitary) characters and prove two kinds of formulas that are suitable for their asymptotics, as the lengths of the signatures that parametrize them go to infinity. The first kind includes several integral representations…
The classification results for the extreme characters of two basic "big" groups, the infinite symmetric group S(infinity) and the infinite-dimensional unitary group U(infinity), are remarkably similar. It does not seem to be possible to…
In this paper, we review the representation theory of the infinite symmetric group, and we extend the works of Kerov and Vershik by proving that the irreducible characters of the infinite symmetric group always satisfy a central limit…
The article presents the results of experiments in computation of statistical values related to Young diagrams, including the estimates on maximum and average (by Plancherel distribution) dimension of irreducible representation of symmetric…
On a finite graph with a chosen partition of the vertex set into interior and boundary vertices, a $\lambda$-polyharmonic function is a complex function $f$ on the vertex set which satisfies $(\lambda \cdot I - P)^n f(x) = 0$ at each…
The Jack symmetric polynomials $P_\lambda^{(\alpha)}$ form a class of symmetric polynomials which are indexed by a partition $\lambda$ and depend rationally on a parameter $\alpha$. They reduced to the Schur polynomials when $\alpha=1$, and…