Related papers: The Young bouquet and its boundary

We obtain a complete classification of the continuous unitary representations of oligomorphic permutation groups (those include the infinite permutation group $S_\infty$, the automorphism group of the countable dense linear order, the…

Classical Schur P-functions are the particular case of Hall-Littlewood polynomials when the parameter is equal to -1. We introduce factorial (interpolation) analogues of Schur P-functions. A dimension of a skew shifted Young diagram is the…

The classification of irreducible, spherical characters of the infinite-dimensional unitary/orthogonal/symplectic groups can be obtained by finding all possible limits of normalized, irreducible characters of the corresponding…

The paper consists of two parts. The first part introduces the representation ring for the family of compact unitary groups U(1), U(2),.... This novel object is a commutative graded algebra R with infinite-dimensional homogeneous…

A recently fertile strand of research in Group Theory is developing non-abelian analogues of classical combinatorial results for arithmetic Cayley graphs, describing properties such as growth, expansion, mixing, diameter, etc. We consider…

We construct supercharacter theories of finite unipotent groups in the orthogonal, symplectic and unitary types. Our method utilizes group actions in a manner analogous to that of Diaconis and Isaacs in their construction of supercharacters…

Motivated by the theory of graph limits, we introduce and study the convergence and limits of linear representations of finite groups over finite fields. The limit objects are infinite dimensional representations of free groups in…

In 1985, Golumbic and Scheinerman established an equivalence between comparability graphs and containment graphs, graphs whose vertices represent sets, with edges indicating set containment. A few years earlier, McMorris and Zaslavsky…

Let $\mathtt{k}$ be an algebraically closed field of characteristic zero. Let ${\stackrel{{\rm o}}{{\mathfrak{g}}}}$ be the Lie superalgebra ${\mathfrak{sl}}(n|m)$ and let $\mathfrak{W}$ be the Weyl groupoid introduced by Sergeev and…

We investigate the relationship between one of the classical notions of boundaries for infinite graphs, \emph{graph ends}, and self-adjoint extensions of the minimal Kirchhoff Laplacian on a metric graph. We introduce the notion of…

We present explicit upper bounds for the number and size of conjugacy classes in finite Chevalley groups and their variations. These results have been used by many authors to study zeta functions associated to representations of finite…

Let E be a finite set. Given permutations x and y of E that together generate a transitive subgroup, for which s is it true that x and the conjugate of y by s also generate a transitive subgroup? Such transitive permutation pairs encode…

We introduce a new oriented evolving graph model inspired by biological networks. A node is added at each time step and is connected to the rest of the graph by random oriented edges emerging from older nodes. This leads to a statistical…

This paper consists of two halves. In the first half of the paper, we consider real-valued functions $f$ whose domain is the vertex set of a graph $G$ and that are Lipschitz with respect to the graph distance. By placing a uniform…

We characterize the bipartite graphs that minimize the (first-degree based) entropy, among all bipartite graphs of given size, or given size and (upper bound on the) order. The extremal graphs turn out to be complete bipartite graphs, or…

We define and study supercharacters of the classical finite unipotent groups of symplectic and orthogonal types (over any finite field of odd characteristic). We show how supercharacters for groups of those types can be obtained by…

We prove an isoperimetric inequality for conjugation-invariant sets of size $k$ in $S_n$, showing that these necessarily have edge-boundary considerably larger than some other sets of size $k$ (provided $k$ is small). Specifically, let…

An $(r, s)$-formation is a concatenation of $s$ permutations of $r$ letters. If $u$ is a sequence with $r$ distinct letters, then let $\mathit{Ex}(u, n)$ be the maximum length of any $r$-sparse sequence with $n$ distinct letters which has…

Let $(X_n)_{n \ge 0}$ be an irreducible, aperiodic, homogeneous Markov chain, with state space a totally ordered finite alphabet of size $m$. Using combinatorial constructions and weak invariance principles, we obtain the limiting shape of…

Young diagrams are ubiquitous in combinatorics and representation theory. Here we explain these diagrams, focusing on how they are used to classify representations of the symmetric groups $S_n$ and various "classical groups": famous groups…