Dimensions of skew-shifted young diagrams and projective characters of the infinite symmetric group

1999 ◽  
Vol 96 (5) ◽  
pp. 3517-3530 ◽  
Author(s):  
V. N. Ivanov
2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Pierre-Loïc Mèliot

International audience We study the fluctuations of models of random partitions $(\mathbb{P}_n,ω )_n ∈\mathbb{N}$ stemming from the representation theory of the infinite symmetric group. Using the theory of polynomial functions on Young diagrams, we establish a central limit theorem for the values of the irreducible characters $χ ^λ$ of the symmetric groups, with $λ$ taken randomly according to the laws $\mathbb{P}_n,ω$ . This implies a central limit theorem for the rows and columns of the random partitions, and these ``geometric'' fluctuations of our models can be recovered by relating central measures on partitions, generalized riffle shuffles, and Brownian motions conditioned to stay in a Weyl chamber. Nous étudions les fluctuations de modèles de partitions aléatoires $(\mathbb{P}_n,ω )_n ∈\mathbb{N}$ issus de la théorie des représentations du groupe symétrique infini. En utilisant la théorie des fonctions polynomiales sur les diagrammes de Young, nous établissons un théorème central limite pour les valeurs des caractères irréductibles $χ ^λ$ des groupes symétriques, avec $λ$ pris aléatoirement suivant les lois $\mathbb{P}_n,ω$ . Ceci implique un théorème central limite pour les lignes et les colonnes des partitions aléatoires, et ces fluctuations ``géométriques'' de nos modèles peuvent être retrouvées en reliant les mesures centrales sur les partitions, les battages généralisés de cartes, et les mouvements browniens conditionnés à rester dans une chambre de Weyl.


2019 ◽  
pp. 33-43
Author(s):  
Vasilii S. Duzhin ◽  
◽  
Anastasia A. Chudnovskaya ◽  

Search for Young diagrams with maximum dimensions or, equivalently, search for irreducible representations of the symmetric group $S(n)$ with maximum dimensions is an important problem of asymptotic combinatorics. In this paper, we propose algorithms that transform a Young diagram into another one of the same size but with a larger dimension. As a result of massive numerical experiments, the sequence of $10^6$ Young diagrams with large dimensions was constructed. Furthermore, the proposed algorithms do not change the first 1000 elements of this sequence. This may indicate that most of them have the maximum dimension. It has been found that the dimensions of all Young diagrams of the resulting sequence starting from the 75778th exceed the dimensions of corresponding diagrams of the greedy Plancherel sequence.


1987 ◽  
Vol 106 ◽  
pp. 143-162 ◽  
Author(s):  
Nobuaki Obata

The infinite symmetric group is the discrete group of all finite permutations of the set X of all natural numbers. Among discrete groups, it has distinctive features from the viewpoint of representation theory and harmonic analysis. First, it is one of the most typical ICC-groups as well as free groups and known to be a group of non-type I. Secondly, it is a locally finite group, namely, the inductive limit of usual symmetric groups . Furthermore it is contained in infinite dimensional classical groups GL(ξ), O(ξ) and U(ξ) and their representation theories are related each other.


Author(s):  
A. O. Morris ◽  
A. K. Yaseen

In [6] the first author introduced some combinatorial concepts involving Young diagrams corresponding to partitions with distinct parts and applied them to the projective representations of the symmetric group Sn. A conjecture concerning the p-block structure of the projective representations of Sn was formulated in terms of these concepts which corresponds to the well-known, but long proved, Nakayama ‘conjecture’ for the p-block structure of the linear representations of Sn. This conjecture has recently been proved by Humphreys [1].


Sign in / Sign up

Export Citation Format

Share Document