Related papers: The boundary of the Gelfand-Tsetlin graph: A new a…
In the recent paper [arXiv:1109.1412], Borodin and Olshanski have presented a novel proof of the celebrated Edrei-Voiculescu theorem which describes the boundary of the Gelfand-Tsetlin graph as a region in an infinite-dimensional coordinate…
The goal of the paper is to describe new connections between representation theory and algebraic combinatorics on one side, and probability theory on the other side. The central result is a construction, by essentially algebraic tools, of a…
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…
We consider the problem of constructing a Gelfand--Tsetlin basis in irreducible representations of an infinite-dimensional general linear group. For a finite-dimensional irreducible representation of a general linear group, all elements of…
In the paper we completely describe characters (central positive-definite functions) of simple locally finite groups that can be represented as inductive limits of (products of) symmetric groups under block diagonal embeddings. Each such…
In the paper we consider a realization of a finite dimensional irreducible representation of the Lie algebra $\mathfrak{gl}_n$ in the space of functions on the group $GL_n$. It is proved that functions corresponding to Gelfand-Tsetlin…
A continuation of the joint work by Vadim Gorin and the author, J. Funct. Anal. 270 (2016), 375-418; arXiv:1504.06832. The extended Gelfand-Tsetlin graph, introduced in that paper, is a novel combinatorial object. Its q-boundary is formed…
The present work stemmed from the study of the problem of harmonic analysis on the infinite-dimensional unitary group U(\infty). That problem consisted in the decomposition of a certain 4-parameter family of unitary representations, which…
The classical Gelfand-Tsetlin formulas provide a basis in terms of tableaux and an explicit action of the generators of $\mathfrak{gl} (n)$ for every irreducible finite-dimensional $\mathfrak{gl} (n)$-module. These formulas can be used to…
A discrete Gelfand-Tsetlin pattern is a configuration of particles in Z^2. The particles are arranged in a finite number of consecutive rows, numbered from the bottom. There is one particle on the first row, two particles on the second row,…
We study the boundary theory of a connected weighted graph $G$ from the viewpoint of stochastic integration. For the Hilbert space \HE of Dirichlet-finite functions on $G$, we construct a Gel'fand triple $S \ci {\mathcal H}_{\mathcal E} \ci…
We define, for any graph $G=(V,E)$, a boundary $\partial G \subseteq V$. The definition coincides with what one would expected for the discretization of (sufficiently nice) Euclidean domains and contains all vertices from the…
This paper is a study of the polyhedral geometry of Gelfand-Tsetlin patterns arising in the representation theory $\mathfrak{gl}_n \C$ and algebraic combinatorics. We present a combinatorial characterization of the vertices and a method to…
The problem of the description of finite factor representations of the infinite-dimensional unitary group, investigated by Voiculescu in 1976, is equivalent to the description of all totally positive Toeplitz matrices. Vershik-Kerov showed…
Young's orthogonal basis is a classical basis for an irreducible representation of a symmetric group. This basis happens to be a Gelfand-Tsetlin basis for the chain of symmetric groups. It is well-known that the chain of alternating groups,…
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…
We define a graded graph, called the Schur--Weyl graph, which arises naturally when one considers simultaneously the RSK algorithm and the classical duality between representations of the symmetric and general linear groups. As one of the…
We consider two bases for an arbitrary finite dimensional irreducible representation of a complex special linear Lie algebra: the classical Gelfand-Tsetlin basis and the relatively new Chari-Loktev basis. Both are parametrized by the set of…
A Gelfand-Tsetlin tableau $T(v)$ induces a character $\chi_v$ of the Gelfand-Tsetlin subalgebra $\Gamma$ of $U = U(\mathfrak{gl}(n,\mathbb C))$. By a theorem due to Ovsienko, for each tableau $T(v)$ there exists a finite number of…
Let $G$ be a finite group, and let ${\rm{cd}}(G)$ denote the set of degrees of the irreducible complex characters of $G$. Define then the character degree graph $\Delta(G)$ as the (simple undirected) graph whose vertices are the prime…