English
Related papers

Related papers: The Young bouquet and its boundary

200 papers

This note is a continuation of the study of the relationship between the geometry of Cayley graphs and the size of its metric-functional boundary. We show that, if there exists a Cayley graph with finitely many Busemann points, then the…

Group Theory · Mathematics 2025-11-27 Corentin Bodart , Liran Ron-George , Ariel Yadin

We consider a number of examples of groups together with an infinite conjugation invariant generating set, including: the free group with the generating set of all separable elements; surface groups with the generating set of all…

Group Theory · Mathematics 2026-04-02 Sabine Chu , George Domat , Christine Gao , Ananya Prasanna , Alex Wright

With an arbitrary finite graph having a special form of 2-intervals (a diamond-shaped graph) we associate a subgroup of a symmetric group and a representation of this subgroup; state a series of problems on such groups and their…

Representation Theory · Mathematics 2019-11-20 A. Vershik , N Tslevich

Gelfand-Graev characters and their degenerate counterparts have an important role in the representation theory of finite groups of Lie type. Using a characteristic map to translate the character theory of the finite unitary groups into the…

Representation Theory · Mathematics 2007-05-23 Nathaniel Thiem , C. Ryan Vinroot

We propose a notion of graph convergence that interpolates between the Benjamini--Schramm convergence of bounded degree graphs and the dense graph convergence developed by L\'aszl\'o Lov\'asz and his coauthors. We prove that spectra of…

Combinatorics · Mathematics 2017-12-27 Péter E. Frenkel

Schur-Weyl duality is a fundamental framework in combinatorial representation theory. It intimately relates the irreducible representations of a group to the irreducible representations of its centralizer algebra. We investigate the analog…

Representation Theory · Mathematics 2018-10-30 Megan Ly

We consider sequences of degrees of ordinary irreducible $S_n$-characters. We assume that the corresponding Young diagrams have rows and columns bounded by some linear function of $n$ with leading coefficient less than one. We show that any…

Combinatorics · Mathematics 2014-06-09 Antonio Giambruno , Sergey Mishchenko

Let $G$ be a finite group with $k$ conjugacy classes, and $S(\infty)$ be the infinite symmetric group, i.e. the group of finite permutations of $\left\{1,2,3,\ldots\right\}$. Then the wreath product $G_{\infty}=G\sim S(\infty)$ of $G$ with…

Representation Theory · Mathematics 2026-05-08 Eugene Strahov

We define the superclasses for a classical finite unipotent group $U$ of type $B_{n}(q)$, $C_{n}(q)$, or $D_{n}(q)$, and show that, together with the supercharacters defined in a previous paper, they form a supercharacter theory. In…

Group Theory · Mathematics 2008-10-31 Carlos A. M. Andre , Ana Margarida Neto

We study a two-dimensional family of probability measures on infinite Gelfand-Tsetlin schemes induced by a distinguished family of extreme characters of the infinite-dimensional unitary group. These measures are unitary group analogs of the…

Representation Theory · Mathematics 2011-03-08 Alexei Borodin , Jeffrey Kuan

The representation theory of the symmetric groups S_n is intimately related to combinatorics: combinatorial objects such as Young tableaux and combinatorial algorithms such as Murnaghan-Nakayama rule. In the limit as n tends to infinity,…

Combinatorics · Mathematics 2014-04-22 Piotr Śniady

The work of Vershik and Kerov [1977], Logan and Shepp [1977] established that the shape of the scaled random young diagram in Russian notation, as determined by the Plancherel measure, converges to a deterministic shape. In this article, we…

Probability · Mathematics 2023-05-09 Mohamed Slim Kammoun

The crystals for finite dimensional representations of sl(n+1) can be realized using Young tableaux. The infinity crystal on the other hand is naturally realized using multisegments, and there is a simple description of the embedding of…

Quantum Algebra · Mathematics 2015-12-23 John Claxton , Peter Tingley

We study the asymptotics of the reducible representations of the wreath products G\wr S_q=G^q \rtimes S_q for large q, where G is a fixed finite group and S_q is the symmetric group in q elements; in particular for G=Z/2Z we recover the…

Representation Theory · Mathematics 2007-05-23 Piotr Sniady

We study actions of (infinitely presented) graphical small cancellation groups on the Gromov boundaries of their coned-off Cayley graphs. We show that a class of graphical small cancellation groups, including (infinitely presented)…

Group Theory · Mathematics 2025-09-09 Chris Karpinski , Damian Osajda , Koichi Oyakawa

Let $S(\infty)$ denote the infinite symmetric group formed by the finitary permutations of the set of natural numbers; this is a countable group. We introduce its virtual group algebra, a completion of the conventional group algebra…

Representation Theory · Mathematics 2025-04-04 Irina Devyatkova , Grigori Olshanski

The concept of a supercharacter theory of a finite group was introduced by Diaconis and Isaacs as an alternative to the usual irreducible character theory, and exemplified with a particular construction in the case of finite algebra groups.…

Representation Theory · Mathematics 2021-01-28 Carlos A. M. André , Jocelyn Lochon

The infinite-dimensional unitary group U(infinity) is the inductive limit of growing compact unitary groups U(N). In this paper we solve a problem of harmonic analysis on U(infinity) stated in the previous paper math/0109193. The problem…

Representation Theory · Mathematics 2007-05-23 Alexei Borodin , Grigori Olshanski

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…

Probability · Mathematics 2016-07-15 Grigori Olshanski

We consider supercritical long-range percolation on transitive graphs of polynomial growth. In this model, any two vertices $x$ and $y$ of the underlying graph $G$ connect by a direct edge with probability $1-\exp(-\beta J(x,y))$, where…

Probability · Mathematics 2026-01-13 Yago Moreno Alonso , Julia Komjathy