Statistics of the symmetric group representations as a natural science question on asymptotics of Young diagrams

Author(s):  
Vladimir Arnold
2018 ◽  
Vol 356 (1) ◽  
pp. 1-4
Author(s):  
Anshul Adve ◽  
Alexander Yong

1958 ◽  
Vol 10 ◽  
pp. 17-32 ◽  
Author(s):  
D. E. Littlewood

Murnaghan (9) has proposed the following method of analyzing the Kronecker product of two symmetric group representations. If (λ) = (λ1, λ2, … , λi) is a partition of p, the representation of the symmetric group on n symbols corresponding to the partition (n — p, λ1 , … , λi) is denoted by [λ] and is said to be of depth p. If [λ] is of depth p and [μ] of depth q, then the terms in the Kronecker product [λ] X [μ] of depth p + q are terms which correspond to the terms in the product of S-functions {λ} {μ}).


2017 ◽  
Vol 20 (4) ◽  
Author(s):  
Eugenio Giannelli ◽  
Kay Jin Lim ◽  
William O’Donovan ◽  
Mark Wildon

AbstractWe prove the existence and main properties of signed Young modules for the symmetric group, using only basic facts about symmetric group representations and the Broué correspondence. We then prove new reduction theorems for the signed


1991 ◽  
Vol 01 (02) ◽  
pp. 207-221 ◽  
Author(s):  
JEAN-YVES THIBON

The Hopf algebra structure of the ring of symmetric functions is used to prove a new identity for the internal product, i.e., the operation corresponding to the tensor product of symmetric group representations. From this identity, or by similar techniques which can also involve the λ-ring structure, we derive easy proofs of most known results about this operation. Some of these results are generalized.


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.


Sign in / Sign up

Export Citation Format

Share Document