相关论文: The Young bouquet and its boundary

We give a new characterisation of virtually free groups using graph minors. Namely, we prove that a finitely generated, infinite group is virtually free if and only if for any finite generating set, the corresponding Cayley graph is minor…

Given a finitely generated group $G$ that is relatively finitely presented with respect to a collection of peripheral subgroups, we prove that every infinite subgroup $H$ of $G$ that is bounded in the relative Cayley graph of $G$ is…

Starting from considering deeper relationship between conjugacy classes and irreducible representations of a finite group $G$, we find some quite simple $R-$matrice defined by using finite groups. This construction produces many sets (or…

In this paper we obtain the orthogonality relations for the supergroup U(m|n), which are remarkably different from the ones for the U(N) case. We extend our results for ordinary representations, obtained some time ago, to the case of…

In this paper, we present the results of a computer investigation of asymptotics for maximum dimensions of linear and projective representations of the symmetric group. This problem reduces to the investigation of standard and strict Young…

Let $X,Y$ be jointly Gaussian vectors, and consider random variables $U,V$ that satisfy the Markov constraint $U-X-Y-V$. We prove an extremal inequality relating the mutual informations between all ${4 \choose 2}$ pairs of random variables…

We define the $L$-measure on the set of Dirichlet characters as an analogue of the Plancherel measure, once considered as a measure on the irreducible characters of the symmetric group. We compare the two measures and study the limit in…

Gel'fand and Cetlin constructed in the 1950s a canonical basis for a finite-dimensional representation V(\lambda) of U(n,\C) by successive decompositions of the representation by a chain of subgroups. Guillemin and Sternberg constructed in…

We study the combinatorial structure of the irreducible characters of the classical groups ${\rm GL}_n(\mathbb{C})$, ${\rm SO}_{2n+1}(\mathbb{C})$, ${\rm Sp}_{2n}(\mathbb{C})$, ${\rm SO}_{2n}(\mathbb{C})$ and the "non-classical" odd…

Twin-width is a recently introduced graph parameter with applications in algorithmics, combinatorics, and finite model theory. For graphs of bounded degree, finiteness of twin-width is preserved by quasi-isometry. Thus, through Cayley…

We show that the probability for a finitely generated subgroup of the modular group, of size $n$, to be almost malnormal or non-parabolic, tends to 0 as $n$ tends to infinity -- where the notion of the size of a subgroup is based on a…

We investigate the combinatorial structure of unrefinable partitions through their correspondence with numerical sets and Young diagrams. Building on the bijection introduced by Keith and Nath, we apply a general geometric criterion that…

With a view to determining character values of finite reductive groups at unipotent elements, we prove a number of results concerning inner products of generalised Gelfand-Graev characters with characteristic functions of character sheaves,…

Let $p$ be a prime number. In this article we study the restriction to $\mathfrak{S}_{n-1}$ of irreducible characters of degree coprime to $p$ of $\mathfrak{S}_n$. In particular, we study the combinatorial properties of the subgraph…

We extend work of McKay, Morse, and Wilf by giving exact formulas and asymptotic formulas for the number of skew Young tableaux T in two situations: (1) the "inside shape" and total number of cells of T are fixed, and (2) the inside shape…

In this paper, we study relationships between the normalized characters of symmetric groups and the Boolean cumulants of Young diagrams. Specifically, we show that each normalized character is a polynomial of twisted Boolean cumulants with…

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…

Let G be a finite non-abelian simple group and let p be a prime. We classify all pairs (G,p) such that the sum of the complex irreducible character degrees of G is greater than the index of a Sylow p-subgroup of G. Our classification…

This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected graphs with the same graphic degree sequence. In particular, we study and characterize the extremal graphs…

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,…