Decomposition Matrices for the Spin Characters of the Symmetric Group 23 ≤ n ≤ 24

2021 ◽  
Vol 15 (6) ◽  
pp. 743-750
1980 ◽  
Vol 21 (1) ◽  
pp. 23-28 ◽  
Author(s):  
J. F. Humphreys

It is well-known [3; V.13.7] that each irreducible complex character of a finite group G is rational valued if and only if for each integer m coprime to the order of G and each g ∈ G, g is conjugate to gm. In particular, for each positive integer n, the symmetric group on n symbols, S(n), has all its irreducible characters rational valued. The situation for projective characters is quite different. In [5], Morris gives tables of the spin characters of S(n) for n ≤ 13 as well as general information about the values of these characters for any symmetric group. It can be seen from these results that in no case are all the spin characters of S(n) rational valued and, indeed, for n ≥ 6 these characters are not even all real valued. In section 2 of this note, we obtain a necessary and sufficient condition for each irreducible character of a group G associated with a 2-cocycle α to be rational valued. A corresponding result for real valued projective characters is discussed in section 3. Section 1 contains preliminary definitions and notation, including the definition of projective characters given in [2].


Author(s):  
Heather M Russell ◽  
Julianna Tymoczko

Abstract Webs are planar graphs with boundary that describe morphisms in a diagrammatic representation category for $\mathfrak{sl}_k$. They are studied extensively by knot theorists because braiding maps provide a categorical way to express link diagrams in terms of webs, producing quantum invariants like the well-known Jones polynomial. One important question in representation theory is to identify the relationships between different bases; coefficients in the change-of-basis matrix often describe combinatorial, algebraic, or geometric quantities (e.g., Kazhdan–Lusztig polynomials). By ”flattening” the braiding maps, webs can also be viewed as the basis elements of a symmetric group representation. In this paper, we define two new combinatorial structures for webs: band diagrams and their one-dimensional projections, shadows, which measure depths of regions inside the web. As an application, we resolve an open conjecture that the change of basis between the so-called Specht basis and web basis of this symmetric group representation is unitriangular for $\mathfrak{sl}_3$-webs ([ 33] and [ 29].) We do this using band diagrams and shadows to construct a new partial order on webs that is a refinement of the usual partial order. In fact, we prove that for $\mathfrak{sl}_2$-webs, our new partial order coincides with the tableau partial order on webs studied by the authors and others [ 12, 17, 29, 33]. We also prove that though the new partial order for $\mathfrak{sl}_3$-webs is a refinement of the previously studied tableau order, the two partial orders do not agree for $\mathfrak{sl}_3$.


1995 ◽  
Vol 46 (2) ◽  
pp. 201-234 ◽  
Author(s):  
JOANNA SCOPES
Keyword(s):  

1989 ◽  
Vol 1 (19) ◽  
pp. 3073-3082 ◽  
Author(s):  
K Slevin ◽  
E Castano ◽  
J B Pendry

2006 ◽  
Vol 38 (1) ◽  
pp. 147-155 ◽  
Author(s):  
A. Caranti ◽  
F. Dalla. Volta
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document