On some combinatorial aspects of Representation Theory
|
|
- Annabelle Osborne
- 5 years ago
- Views:
Transcription
1 On some combinatorial aspects of Representation Theory Doctoral Defense Waldeck Schützer Rutgers University March 24, 2004 Representation Theory and Combinatorics p.1/46
2 Overview Degree one nonsymmetric Pieri rule New recursions for characters and multiplicities Complexity of character formulas Representation Theory and Combinatorics p.2/46
3 Part 1 Degree 1 nonsymmetric Pieri rule Representation Theory and Combinatorics p.3/46
4 The classical Pieri rule The classical Pieri rule is a combinatorial description for the product of a Schur polynomial with a complete (or an elementary) symmetric polynomial: h m s µ = λ µ hor. m strip s λ. This is a special case of the well-known Littlewood-Richardson rule for the product of any two Schur polynomials. Representation Theory and Combinatorics p.4/46
5 Jack polynomials Jack polynomials J (α) λ polynomials. generalize Schur In fact, J (1) λ is a scalar multiple of s λ. The Pieri rule for these was found by Stanley in 1989: J (α) m J (α) µ = λ µ hor. m strip c λ m,µ(α)j (α) λ. The Littlewood-Richardson rule is not known for the J (α) λ. Representation Theory and Combinatorics p.5/46
6 The nonsymmetric Pieri rule Nonsymmetric analogs F η (α) where introduced in 1995 by Heckman and Opdam. They are indexed by compositions, i.e. η Z n +. The Pieri rule for them is F ν (α) F η (α) = λ g λ νη(α)f (α) λ where ν {0, 1} n. This is not fully known yet, but we will give a complete answer for the case ν = ε k. Representation Theory and Combinatorics p.6/46
7 Nonsymmetric Jack polynomials Up to a scalar multiple, F η can be defined as a simultaneous polynomial eigenfunction for the commuting family of Cherednik operators ξ i = αx i + x i k<i x i x i x k (1 s ik ) + k>i x k x i x k (1 s ik ) + 1 i, for i = 1,..., n, with eigenvalues η i = η i α #{k < i η k η i } #{k > i η k > η i }. Here s ik is the transposition permuting x i and x k. Representation Theory and Combinatorics p.7/46
8 Main Results Two main questions answered for the product F εk F η : Which polynomials occur in the decomposition? What are values of the coefficients? To answer the first question we need a few definitions. Representation Theory and Combinatorics p.8/46
9 Composition diagrams The diagram of η is the set diag(η) = {(i, j) 1 i n, 1 j η i }. Representation Theory and Combinatorics p.9/46
10 Composition diagrams The diagram of η is the set diag(η) = {(i, j) 1 i n, 1 j η i }. Graphically, for η = (312): j or better 3 3 i Representation Theory and Combinatorics p.9/46
11 Composition diagrams The diagram of η is the set diag(η) = {(i, j) 1 i n, 1 j η i }. Graphically, for η = (312): j or better 3 3 i Usually we identify diag(η) with η. Representation Theory and Combinatorics p.9/46
12 An ordering on compositions Define an ordering on compositions by asking that ν η if there exists a permutation π such that ν i < η π(i), if i < π(i), ν i η π(i), if i π(i). This extends the usual ordering (inclusion of diagrams). Representation Theory and Combinatorics p.10/46
13 Minimal elements above η For L = {j 1,..., j l } {1,..., n}, let η = (η 1,..., η j1,..., η j2,..., η jl,..., η n ), and define µ = C L (η) by µ = (η 1,..., η j2,..., η j3,..., η j1 + 1,..., η n ). η = j 1 j 2 j 3 c L (η) = Representation Theory and Combinatorics p.11/46
14 First main theorem Theorem. gε λ k η 0 if and only if: (i) λ = C S (η) where S = {i 1,..., i s } := {i η i λ i }, (ii) Either i s k or #{i k η i = η i1 + 1} > 0, (iii) if η i1 = η 1 = = η k then i 1 < k. k k Representation Theory and Combinatorics p.12/46
15 Example The following are all compositions occurring in the expansion of F ε2 F (1121) : = These are some compositions which do not occur for the indicated reason: k Not minimal Wrong i 1 Representation Theory and Combinatorics p.13/46
16 Remarks S need not be the only set to satisfy (i). In fact, as we will see below, there is always a (unique) maximal set L such that λ = c L (η). Representation Theory and Combinatorics p.14/46
17 Maximal sets A subset L = {j 1,..., j l } {1,..., n} is maximal w.r.t. η if: η i η j1, if i < j 1, η i η jt, if j t 1 < i < j t, η i η j1 + 1, if i > j l. One can show that if λ = C M (η) = C L (η) and L is maximal, then M L, hence λ = C L (η) determines L uniquely. In particular, S L. Representation Theory and Combinatorics p.15/46
18 Remarks Let S L. Then (ii) is equivalent to j l k. We are going to describe g λ ε k η combinatorially. We will need two auxiliary polynomials b ηλ (α) and b (k) ηλ (α). They will be defined by playing a jeu de flèches (an arrow shooting game). First, we recall some fundamental concepts. Representation Theory and Combinatorics p.16/46
19 Composition statistics For a box s = (i, j) of η we define the coarm length and the arm lengths as so coarm a η(s) s arm a η (s) # = a η(s) = j 1, # = a η (s) = η i j. Representation Theory and Combinatorics p.17/46
20 Composition statistics For a box s = (i, j) of η we define the leg length as : so # = l η (s) = #{k < i j η k + 1 η i } + #{k > i j η k η i }. Representation Theory and Combinatorics p.17/46
21 Composition statistics For a box s = (i, j) of η we define the coleg length as : so # = l η(s) = #{k < i η k η i } + #{k > i η k > η i }. Representation Theory and Combinatorics p.17/46
22 Composition statistics For a box s = (i, j) of η we define the lower hook length polynomial as d η(s) = (a η (s) + 1)α + l η (s). : e.g. d η(3, 2) = 2α + 3. We also define the upper hook polynomial as d η (s) = d η(s) + 1. Representation Theory and Combinatorics p.17/46
23 Composition statistics The content of a box in η is defined as c η (s) = (a η(s) + 1)α l η(s). : e.g. c η (3, 2) = 2α 1. Remark: the eigenvalue η i is just the content c η (i, η i ) of the rightmost box on row i of η. Representation Theory and Combinatorics p.17/46
24 Hook tableaux Let η = (01312), λ = (13211) and k = 1. Then L = {1, 2, 3, 5} is maximal w.r.t. η and λ = C L (η). α+2 d λ α+3 d η 3α+4 2α+2 α 3α+5 2α+3 α+1 2α+3 α+1 α+1 d η α+2 d λ 2α+4 α+3 α Representation Theory and Combinatorics p.18/46
25 Hook tableaux Let η = (01312), λ = (13211) and k = 1. Then L = {1, 2, 3, 5} is maximal w.r.t. η and λ = C L (η). For the moment, forget the non-colored rows and think of the colored ones as if they formed a cycle, namely regard the first row as if it came below the last one. Place the arrows close to the right end of each (colored) row as follows. Representation Theory and Combinatorics p.18/46
26 Hook tableaux Let η = (01312), λ = (13211) and k = 1. Then L = {1, 2, 3, 5} is maximal w.r.t. η and λ = C L (η). α+3 3α+5 2α+3 α+1 α+2 3α+4 2α+2 α 2α+3 α+1 α+1 α+2 2α+4 α+3 α The arrows can only reach as far as the next row in cycle. Representation Theory and Combinatorics p.18/46
27 Hook tableaux Let η = (01312), λ = (13211) and k = 1. Then L = {1, 2, 3, 5} is maximal w.r.t. η and λ = C L (η). 1 α+3 3α+5 2α+3 1 3α+4 1 α 2α+3 α+1 α+1 α+2 2α+4 1 α b ηλ :=2 (α+3)(3 α+5)(2 α+3) 2 (α+1) 2 (α+2) 2 (3 α+4)α 2 Representation Theory and Combinatorics p.18/46
28 Hook tableaux Let η = (01312), λ = (13211) and k = 1. Then L = {1, 2, 3, 5} is maximal w.r.t. η and λ = C L (η). Now we are going to take k into account. Do so by placing a shield on row k protecting from the arrows. Then repeat the jeu de flèches. Representation Theory and Combinatorics p.18/46
29 Hook tableaux Let η = (01312), λ = (13211) and k = 1. Then L = {1, 2, 3, 5} is maximal w.r.t. η and λ = C L (η). α+2 shield α+3 3α+4 1 α 3α+5 2α+3 1 2α+3 α+1 α+1 α+2 2α+4 1 α b (1) ηλ := 2 (α+3)(3 α+5)(2 α+3)2 (α+1) 2 (α+2) 3 (3 α+4)α 2 Representation Theory and Combinatorics p.18/46
30 Second main theorem Theorem. If gε λ k η 0 then (α + k)b (k) ηλ + (c λ(j p ) c λ (j l ))b ηλ, gε λ if k = j k η = p L, (c λ (j p ) c λ (j l ))b ηλ, if j p < k < j p+1, αb ηλ, if k < j 1, where c λ (i) := c λ (i, λ i ) = λ i α l λ(i) is the content of the rightmost box on row i of λ. Representation Theory and Combinatorics p.19/46
31 Example Using the aforementioned values of b ηλ and b (1) ηλ for η = (01312) and λ = (13211), we find that and thus c λ (1) = α 2, c λ (5) = α 4, g λ 1η = (α+1)b (1) ηλ +((α 2) (α 4))b ηλ = 2(α+1) 2 (α+3) 2 (3α+5)(2α+3) 2 (α+2) 2 (3α+4)α 3 Representation Theory and Combinatorics p.20/46
32 Example For η = (045), λ = (451) and k = 2, we find that g (451) 2,(045) = 24(α + 2)(2α + 1) 3 (3α + 1) 2 (α + 1) 2 (5α + 3)(3α + 2) (4α + 1)(5α + 2)(α 1)α 5. Thus it is not always possible to define a global sign for each coefficient. Representation Theory and Combinatorics p.21/46
33 Idea of the proof There are some recursions for the g λ ε k η. There is an exact, non-combinatorial formula for x i F η by Marshall. First guess which λ will occur and guess the value of g λ ε k η. Then use either recursion or closed formula to show the guess is correct. End of part 1 Representation Theory and Combinatorics p.22/46
34 Part 2 New recursions for characters and multiplicities Representation Theory and Combinatorics p.23/46
35 Preliminaries - 1 g - simple Lie algebra of rank n Representation Theory and Combinatorics p.24/46
36 Preliminaries - 1 g - simple Lie algebra of rank n h g - Cartan subalgebra Representation Theory and Combinatorics p.24/46
37 Preliminaries - 1 g - simple Lie algebra of rank n h g - Cartan subalgebra ω 1,..., ω n h - fundamental weights Representation Theory and Combinatorics p.24/46
38 Preliminaries - 1 g - simple Lie algebra of rank n h g - Cartan subalgebra ω 1,..., ω n h - fundamental weights P = Z ω 1,..., ω n - weight lattice Representation Theory and Combinatorics p.24/46
39 Preliminaries - 1 g - simple Lie algebra of rank n h g - Cartan subalgebra ω 1,..., ω n h - fundamental weights P = Z ω 1,..., ω n - weight lattice P + = Z + ω 1,..., ω n - the dominant weights Representation Theory and Combinatorics p.24/46
40 Preliminaries - 1 g - simple Lie algebra of rank n h g - Cartan subalgebra ω 1,..., ω n h - fundamental weights P = Z ω 1,..., ω n - weight lattice P + = Z + ω 1,..., ω n - the dominant weights = {α 1,..., α n } P - simple roots Representation Theory and Combinatorics p.24/46
41 Preliminaries - 1 g - simple Lie algebra of rank n h g - Cartan subalgebra ω 1,..., ω n h - fundamental weights P = Z ω 1,..., ω n - weight lattice P + = Z + ω 1,..., ω n - the dominant weights = {α 1,..., α n } P - simple roots Q = Z α 1,..., α n - root lattice Representation Theory and Combinatorics p.24/46
42 Preliminaries - 1 g - simple Lie algebra of rank n h g - Cartan subalgebra ω 1,..., ω n h - fundamental weights P = Z ω 1,..., ω n - weight lattice P + = Z + ω 1,..., ω n - the dominant weights = {α 1,..., α n } P - simple roots Q = Z α 1,..., α n - root lattice E = R α 1,..., α n with Killing form, Representation Theory and Combinatorics p.24/46
43 Preliminaries - 2 α i = 2α i α i,α i - the coroots Representation Theory and Combinatorics p.25/46
44 Preliminaries - 2 α i = 2α i α i,α i - the coroots µ is regular whenever µ, α > 0 for all α. Representation Theory and Combinatorics p.25/46
45 Preliminaries - 2 α i = 2α i α i,α i - the coroots µ is regular whenever µ, α > 0 for all α. W - the Weyl group w/ generators s i := s αi Representation Theory and Combinatorics p.25/46
46 Preliminaries - 2 α i = 2α i α i,α i - the coroots µ is regular whenever µ, α > 0 for all α. W - the Weyl group w/ generators s i := s αi R = W {α 1,..., α n } - the root system Representation Theory and Combinatorics p.25/46
47 Preliminaries - 2 α i = 2α i α i,α i - the coroots µ is regular whenever µ, α > 0 for all α. W - the Weyl group w/ generators s i := s αi R = W {α 1,..., α n } - the root system R + - positive roots Representation Theory and Combinatorics p.25/46
48 Preliminaries - 2 α i = 2α i α i,α i - the coroots µ is regular whenever µ, α > 0 for all α. W - the Weyl group w/ generators s i := s αi R = W {α 1,..., α n } - the root system R + - positive roots V λ - Irreducible f.d. g-module of highest weight λ Representation Theory and Combinatorics p.25/46
49 Preliminaries - 2 α i = 2α i α i,α i - the coroots µ is regular whenever µ, α > 0 for all α. W - the Weyl group w/ generators s i := s αi R = W {α 1,..., α n } - the root system R + - positive roots V λ - Irreducible f.d. g-module of highest weight λ P λ - corresponding weight system Representation Theory and Combinatorics p.25/46
50 Preliminaries - 2 α i = 2α i α i,α i - the coroots µ is regular whenever µ, α > 0 for all α. W - the Weyl group w/ generators s i := s αi R = W {α 1,..., α n } - the root system R + - positive roots V λ - Irreducible f.d. g-module of highest weight λ P λ - corresponding weight system ρ = ω ω n = 1 2 α R α. + Representation Theory and Combinatorics p.25/46
51 The character The (formal) character of V λ is χ λ = µ P λ dim(v λ (µ))e µ, where V λ (µ) = {v V λ h v = µ(h)v, h h} is the weight space of V λ of weight µ relative to h. This makes sense since h is abelian and consists of semisimple elements. Representation Theory and Combinatorics p.26/46
52 The WCF The Weyl Character Formula (WCF) states that δχ λ = w W ε(w)e w(λ+ρ) where ε(w) = ( 1) l(w) and δ is the Weyl denominator δ = ε(w)e wρ = (e α/2 e α/2 ). w W α R + Representation Theory and Combinatorics p.27/46
53 The girdle Is defined as θ λ = µ P λ e µ. Looks like the character, except the coefficients are all 1 s. Representation Theory and Combinatorics p.28/46
54 A partition function Let R + = R + \ be the positive non-simple roots. For any φ R +, let φ = β R + β Then we can write where α R +(1 e α ) = 1 + φ c φ e φ, c β = #{ φ = β #φ is even} #{ φ = β #φ is odd}. Representation Theory and Combinatorics p.29/46
55 Signed characters Above we defined χ λ when λ is dominant. Representation Theory and Combinatorics p.30/46
56 Signed characters Above we defined χ λ when λ is dominant. For any µ P, let w µ W be minimal s.t. w µ (µ + ρ) is dominant. Representation Theory and Combinatorics p.30/46
57 Signed characters Above we defined χ λ when λ is dominant. For any µ P, let w µ W be minimal s.t. w µ (µ + ρ) is dominant. Set µ = w µ (µ + ρ) ρ. Note µ is dominant when µ + ρ is regular. Representation Theory and Combinatorics p.30/46
58 Signed characters Above we defined χ λ when λ is dominant. For any µ P, let w µ W be minimal s.t. w µ (µ + ρ) is dominant. Set µ = w µ (µ + ρ) ρ. Note µ is dominant when µ + ρ is regular. Let ε µ = ( 1) l(w µ), if µ + ρ is regular, and zero otherwise. Representation Theory and Combinatorics p.30/46
59 Signed characters Above we defined χ λ when λ is dominant. For any µ P, let w µ W be minimal s.t. w µ (µ + ρ) is dominant. Set µ = w µ (µ + ρ) ρ. Note µ is dominant when µ + ρ is regular. Let ε µ = ( 1) l(w µ), if µ + ρ is regular, and zero otherwise. Define the signed characters by: χ µ := ε µ χ µ Representation Theory and Combinatorics p.30/46
60 Main Theorem Theorem. For a dominant λ, Θ λ = χ λ + φ c φ χ λ φ is a recursion for χ λ. Representation Theory and Combinatorics p.31/46
61 Idea of the proof We show that both sides of Θ λ = χ λ + φ c φ χ λ φ are equal to w W ε(w) e wλ α R +(1 e wα ). Representation Theory and Combinatorics p.32/46
62 LHS Proposition. Θ λ = w W ε(w) e wλ α R +(1 e wα ). We give an elementary proof, but this also follows from the work of Brion. Representation Theory and Combinatorics p.33/46
63 RHS Proposition. w W ε(w) e wλ α R +(1 e wα ) = χ λ + φ c φ χ λ φ. The proof is: just expand and use the WCF. Representation Theory and Combinatorics p.34/46
64 Example For g of type A 2, χ λ = Θ λ + χ λ ρ. For g of type B 2, χ λ = Θ λ + χ λ α1 α 2 + χ λ α1 2α 2 χ λ 2α1 3α 2 Representation Theory and Combinatorics p.35/46
65 Consequences Corollary. m λ (µ) = 1 φ c φ m λ φ (µ), where m λ (µ) = ε λ dim V λ (µ). Representation Theory and Combinatorics p.36/46
66 Consequences Corollary. m λ (µ) = 1 φ c φ m λ φ (µ), where m λ (µ) = ε λ dim V λ (µ). Corollary. P λ = dim V λ + φ ε λ φ c φ dim V λ φ. Representation Theory and Combinatorics p.36/46
67 Consequences Corollary. P λ = w W 1 n i=1 ρ, wα i n j=0 ρ, wλ j j! T n j ( wα 1,..., wα n ), where T i is the i-th Todd polynomial defined by i 1 tx i 1 e tx i = i=0 T (x 1, x 2,...)t i. Representation Theory and Combinatorics p.37/46
68 Example For g of type A 2, and λ = (a, b), we get ( ) a + b + 2 P λ = + ab. 2 Representation Theory and Combinatorics p.38/46
69 Example For g of type B 2, m (i,j) (0,0) = 0 unless j is even. So when λ = (i, 2j) for i, j Z + we have the recursion m λ (0,0)=1+m λ α1 α 2 (0,0)+m λ α1 2α 2 (0,0) m λ 2α1 3α 2 (0,0). This can be solved exactly: m (i,2j) (0,0) = 1 + ( 1)i 4 + End of Part 2 (i + 1)(2j + 1) 2. Representation Theory and Combinatorics p.39/46
70 Part 3 The complexity of character formulas Representation Theory and Combinatorics p.40/46
71 Two character formulas We studied two character formulas: One classic: Freudenthal s formula expressing the multiplicity of a weight in terms of multiplicity for higher weights. One new: Sahi s formula is a recursion for non-symmetric analogs P λ of characters χ λ. Representation Theory and Combinatorics p.41/46
72 Statement of the Problem Given a dominant weight λ of length m, we want to compute the character table T m, containing the characters for all dominant weights µ whose length is m. Representation Theory and Combinatorics p.42/46
73 The size of the Problem The size of χ λ is precisely P λ and this is about O(m n ). Thus the size of T m is about O(m 2n ). Representation Theory and Combinatorics p.43/46
74 Computational model We adopted straight-line program model with uniform cost function, so that the time complexity depends only on the total number of arithmetic operations. Hence, an optimal method for computing T m, takes O(m 2n ) time. Representation Theory and Combinatorics p.44/46
75 Main Theorem Theorem. Let λ be a weight of length m. Then Freudenthal computes T m in O(m 2n+1 ) time while Sahi computes it in O(m 2n ) time, therefore Sahi is of optimal performance. Representation Theory and Combinatorics p.45/46
76 Computational experience Representation Theory and Combinatorics p.46/46
77 End of Part 3 Representation Theory and Combinatorics p.47/46
Representations of semisimple Lie algebras
Chapter 14 Representations of semisimple Lie algebras In this chapter we study a special type of representations of semisimple Lie algberas: the so called highest weight representations. In particular
More informationA Recursion and a Combinatorial Formula for Jack Polynomials
A Recursion and a Combinatorial Formula for Jack Polynomials Friedrich Knop & Siddhartha Sahi* Department of Mathematics, Rutgers University, New Brunswick NJ 08903, USA 1. Introduction The Jack polynomials
More informationLECTURE 3: TENSORING WITH FINITE DIMENSIONAL MODULES IN CATEGORY O
LECTURE 3: TENSORING WITH FINITE DIMENSIONAL MODULES IN CATEGORY O CHRISTOPHER RYBA Abstract. These are notes for a seminar talk given at the MIT-Northeastern Category O and Soergel Bimodule seminar (Autumn
More informationWeyl s Character Formula for Representations of Semisimple Lie Algebras
Weyl s Character Formula for Representations of Semisimple Lie Algebras Ben Reason University of Toronto December 22, 2005 1 Introduction Weyl s character formula is a useful tool in understanding the
More informationShifted symmetric functions I: the vanishing property, skew Young diagrams and symmetric group characters
I: the vanishing property, skew Young diagrams and symmetric group characters Valentin Féray Institut für Mathematik, Universität Zürich Séminaire Lotharingien de Combinatoire Bertinoro, Italy, Sept. 11th-12th-13th
More informationLie Superalgebras and Sage
1/19 Lie Superalgebras and Sage Daniel Bump July 26, 2018 With the connivance of Brubaker, Schilling and Scrimshaw. 2/19 Lie Methods in Sage Lie methods in WeylCharacter class: Compute characters of representations
More informationAd-nilpotent ideals of Borel subalgebras: combinatorics and representation theory
Ad-nilpotent ideals of Borel subalgebras: combinatorics and representation theory Paolo Papi Sapienza Università di Roma Preliminary version Winter School: Geometry, Algebra and Combinatorics of Moduli
More informationUnique decomposition of tensor products of irreducible representations of simple algebraic groups
Annals of Mathematics, 160 (2004), 683 704 Unique decomposition of tensor products of irreducible representations of simple algebraic groups By C. S. Rajan Abstract We show that a tensor product of irreducible,
More informationLecture Notes Introduction to Cluster Algebra
Lecture Notes Introduction to Cluster Algebra Ivan C.H. Ip Update: May 16, 2017 5 Review of Root Systems In this section, let us have a brief introduction to root system and finite Lie type classification
More informationQuotients of Poincaré Polynomials Evaluated at 1
Journal of Algebraic Combinatorics 13 (2001), 29 40 c 2001 Kluwer Academic Publishers. Manufactured in The Netherlands. Quotients of Poincaré Polynomials Evaluated at 1 OLIVER D. ENG Epic Systems Corporation,
More informationCombinatorics for algebraic geometers
Combinatorics for algebraic geometers Calculations in enumerative geometry Maria Monks March 17, 214 Motivation Enumerative geometry In the late 18 s, Hermann Schubert investigated problems in what is
More informationKostka multiplicity one for multipartitions
Kostka multiplicity one for multipartitions James Janopaul-Naylor and C. Ryan Vinroot Abstract If [λ(j)] is a multipartition of the positive integer n (a sequence of partitions with total size n), and
More informationL(C G (x) 0 ) c g (x). Proof. Recall C G (x) = {g G xgx 1 = g} and c g (x) = {X g Ad xx = X}. In general, it is obvious that
ALGEBRAIC GROUPS 61 5. Root systems and semisimple Lie algebras 5.1. Characteristic 0 theory. Assume in this subsection that chark = 0. Let me recall a couple of definitions made earlier: G is called reductive
More informationON KRONECKER PRODUCTS OF CHARACTERS OF THE SYMMETRIC GROUPS WITH FEW COMPONENTS
ON KRONECKER PRODUCTS OF CHARACTERS OF THE SYMMETRIC GROUPS WITH FEW COMPONENTS C. BESSENRODT AND S. VAN WILLIGENBURG Abstract. Confirming a conjecture made by Bessenrodt and Kleshchev in 1999, we classify
More informationQUANTUM MECHANIC S. Symmetries
Walter Greiner Berndt Müller QUANTUM MECHANIC S Symmetries 1. Symmetries in Quantum Mechanics 1 1.1 Symmetries in Classical Physics 1 1.2 Spatial Translations in Quantum Mechanics 1 9 1.3 The Unitary
More informationBackground on Chevalley Groups Constructed from a Root System
Background on Chevalley Groups Constructed from a Root System Paul Tokorcheck Department of Mathematics University of California, Santa Cruz 10 October 2011 Abstract In 1955, Claude Chevalley described
More informationEigenvalue problem for Hermitian matrices and its generalization to arbitrary reductive groups
Eigenvalue problem for Hermitian matrices and its generalization to arbitrary reductive groups Shrawan Kumar Talk given at AMS Sectional meeting held at Davidson College, March 2007 1 Hermitian eigenvalue
More informationMultiplicity-Free Products of Schur Functions
Annals of Combinatorics 5 (2001) 113-121 0218-0006/01/020113-9$1.50+0.20/0 c Birkhäuser Verlag, Basel, 2001 Annals of Combinatorics Multiplicity-Free Products of Schur Functions John R. Stembridge Department
More information(Permutations Arising from) Hook Coefficients of Chromatic Symmetric Functions
(Permutations Arising from) Hook Coefficients of Chromatic Symmetric Functions Ryan Kaliszewski Drexel University rlk72@drexel.edu July 17, 2014 Ryan Kaliszewski (Drexel University) Hook Coefficients July
More informationMath 210C. The representation ring
Math 210C. The representation ring 1. Introduction Let G be a nontrivial connected compact Lie group that is semisimple and simply connected (e.g., SU(n) for n 2, Sp(n) for n 1, or Spin(n) for n 3). Let
More informationLittlewood Richardson polynomials
Littlewood Richardson polynomials Alexander Molev University of Sydney A diagram (or partition) is a sequence λ = (λ 1,..., λ n ) of integers λ i such that λ 1 λ n 0, depicted as an array of unit boxes.
More informationThe Littlewood-Richardson Rule
REPRESENTATIONS OF THE SYMMETRIC GROUP The Littlewood-Richardson Rule Aman Barot B.Sc.(Hons.) Mathematics and Computer Science, III Year April 20, 2014 Abstract We motivate and prove the Littlewood-Richardson
More informationClassification of root systems
Classification of root systems September 8, 2017 1 Introduction These notes are an approximate outline of some of the material to be covered on Thursday, April 9; Tuesday, April 14; and Thursday, April
More informationDenominator identities and Lie superalgebras
Denominator identities and Lie superalgebras Paolo Papi Sapienza Università di Roma We find an analogue of the Weyl denominator identity for a basic classical Lie superalgebra. joint work with Victor Kac
More informationMultiplicity Free Expansions of Schur P-Functions
Annals of Combinatorics 11 (2007) 69-77 0218-0006/07/010069-9 DOI 10.1007/s00026-007-0306-1 c Birkhäuser Verlag, Basel, 2007 Annals of Combinatorics Multiplicity Free Expansions of Schur P-Functions Kristin
More informationA Pieri rule for key polynomials
Séminaire Lotharingien de Combinatoire 80B (2018) Article #78, 12 pp. Proceedings of the 30 th Conference on Formal Power Series and Algebraic Combinatorics (Hanover) A Pieri rule for key polynomials Sami
More informationSpecialized Macdonald polynomials, quantum K-theory, and Kirillov-Reshetikhin crystals
Specialized Macdonald polynomials, quantum K-theory, and Kirillov-Reshetikhin crystals Cristian Lenart Max-Planck-Institut für Mathematik, Bonn State University of New York at Albany Geometry Seminar,
More informationLecture 6 : Kronecker Product of Schur Functions Part I
CS38600-1 Complexity Theory A Spring 2003 Lecture 6 : Kronecker Product of Schur Functions Part I Lecturer & Scribe: Murali Krishnan Ganapathy Abstract The irreducible representations of S n, i.e. the
More informationClassification of semisimple Lie algebras
Chapter 6 Classification of semisimple Lie algebras When we studied sl 2 (C), we discovered that it is spanned by elements e, f and h fulfilling the relations: [e, h] = 2e, [ f, h] = 2 f and [e, f ] =
More informationMath 128: Lecture 20. May 12, 2014
Math 128: Lecture 20 May 12, 2014 Weigh space multiplicities: We re trying to calculate m λ µ, the dimension of L(λ) µ in L(λ), with λ P + = Z 0 {ω 1,..., ω r }. 1. First solution: Freudenthal s multiplicity
More informationKOSTKA FOULKES POLYNOMIALS FOR SYMMETRIZABLE KAC MOODY ALGEBRAS
Séminaire Lotharingien de Combinatoire 58 (2008), Article B58f KOSTKA FOULKES POLYNOMIALS FOR SYMMETRIZABLE KAC MOODY ALGEBRAS SANKARAN VISWANATH Abstract. We introduce a generalization of the classical
More informationDUAL IMMACULATE QUASISYMMETRIC FUNCTIONS EXPAND POSITIVELY INTO YOUNG QUASISYMMETRIC SCHUR FUNCTIONS
DUAL IMMACULATE QUASISYMMETRIC FUNCTIONS EXPAND POSITIVELY INTO YOUNG QUASISYMMETRIC SCHUR FUNCTIONS EDWARD E. ALLEN, JOSHUA HALLAM, AND SARAH K. MASON Abstract. We describe a combinatorial formula for
More informationA Murnaghan-Nakayama Rule for k-schur Functions
A Murnaghan-Nakayama Rule for k-schur Functions Anne Schilling (joint work with Jason Bandlow, Mike Zabrocki) University of California, Davis October 31, 2012 Outline History The Murnaghan-Nakayama rule
More informationA PROOF OF BOREL-WEIL-BOTT THEOREM
A PROOF OF BOREL-WEIL-BOTT THEOREM MAN SHUN JOHN MA 1. Introduction In this short note, we prove the Borel-Weil-Bott theorem. Let g be a complex semisimple Lie algebra. One basic question in representation
More informationREPRESENTATIONS OF S n AND GL(n, C)
REPRESENTATIONS OF S n AND GL(n, C) SEAN MCAFEE 1 outline For a given finite group G, we have that the number of irreducible representations of G is equal to the number of conjugacy classes of G Although
More informationSPECTRAL CHARACTERS OF FINITE DIMENSIONAL REPRESENTATIONS OF AFFINE ALGEBRAS
SPECTRAL CHARACTERS OF FINITE DIMENSIONAL REPRESENTATIONS OF AFFINE ALGEBRAS VYJAYANTHI CHARI AND ADRIANO A. MOURA Introduction In this paper we study the category C of finite dimensional representations
More informationNOTES ABOUT SATURATED CHAINS IN THE DYCK PATH POSET. 1. Basic Definitions
NOTES ABOUT SATURATED CHAINS IN THE DYCK PATH POSET JENNIFER WOODCOCK 1. Basic Definitions Dyck paths are one of the many combinatorial objects enumerated by the Catalan numbers, sequence A000108 in [2]:
More informationPOLYNOMIAL BEHAVIOUR OF KOSTKA NUMBERS
POLYNOMIAL BEHAVIOUR OF KOSTKA NUMBERS DINUSHI MUNASINGHE Abstract. Given two standard partitions λ + = (λ + 1 λ+ s ) and λ = (λ 1 λ r ) we write λ = (λ +, λ ) and set s λ (x 1,..., x t ) := s λt (x 1,...,
More informationYoung s Natural Representations of S 4
Young s Natural Representations of S Quinton Westrich arxiv:111.0687v1 [math.rt] Dec 011 December 008 Abstract We calculate all inequivalent irreducible representations of S by specifying the matrices
More informationAbout polynomiality of the Poisson semicentre for parabolic subalgebras
About polynomiality of the Poisson semicentre for parabolic subalgebras University of Saint-Etienne, ICJ, LYON - France The Canicular Days - Haifa - July 2017 - Celebrating A. Joseph s 75th birthday Aim.
More informationA generalization of the alcove model and its applications
FPSAC 0, Nagoya, Japan DMTCS proc. AR, 0, 885 896 A generalization of the alcove model and its applications Cristian Lenart and Arthur Lubovsky Department of Mathematics and Statistics, State University
More informationSPECTRAL FUNCTIONS OF INVARIANT OPERATORS ON SKEW MULTIPLICITY FREE SPACES
SPECTRAL FUNCTIONS OF INVARIANT OPERATORS ON SKEW MULTIPLICITY FREE SPACES BY MICHAEL WEINGART A dissertation submitted to the Graduate School New Brunswick Rutgers, The State University of New Jersey
More informationRoot system chip-firing
Root system chip-firing PhD Thesis Defense Sam Hopkins Massachusetts Institute of Technology April 27th, 2018 Includes joint work with Pavel Galashin, Thomas McConville, Alexander Postnikov, and James
More informationEquivariant Algebraic K-Theory
Equivariant Algebraic K-Theory Ryan Mickler E-mail: mickler.r@husky.neu.edu Abstract: Notes from lectures given during the MIT/NEU Graduate Seminar on Nakajima Quiver Varieties, Spring 2015 Contents 1
More informationKostka multiplicity one for multipartitions
Kostka multiplicity one for multipartitions James Janopaul-Naylor and C. Ryan Vinroot Abstract If [λ(j)] is a multipartition of the positive integer n (a sequence of partitions with total size n), and
More informationThe (q, t)-catalan Numbers and the Space of Diagonal Harmonics. James Haglund. University of Pennsylvania
The (q, t)-catalan Numbers and the Space of Diagonal Harmonics James Haglund University of Pennsylvania Outline Intro to q-analogues inv and maj q-catalan Numbers MacMahon s q-analogue The Carlitz-Riordan
More informationA Note on Skew Characters of Symmetric Groups Jay Taylor
A Note on Skew Characters of Symmetric Groups Jay Taylor Abstract. In previous work Regev used part of the representation theory of Lie superalgebras to compute the values of a character of the symmetric
More informationThe Cartan Decomposition of a Complex Semisimple Lie Algebra
The Cartan Decomposition of a Complex Semisimple Lie Algebra Shawn Baland University of Colorado, Boulder November 29, 2007 Definition Let k be a field. A k-algebra is a k-vector space A equipped with
More informationKraśkiewicz-Pragacz modules and some positivity properties of Schubert polynomials
Kraśkiewicz-Pragacz modules and some positivity properties of Schubert polynomials Masaki Watanabe Graduate School of Mathematical Sciences, the University of Tokyo December 9, 2015 Masaki Watanabe KP
More informationA method for construction of Lie group invariants
arxiv:1206.4395v1 [math.rt] 20 Jun 2012 A method for construction of Lie group invariants Yu. Palii Laboratory of Information Technologies, Joint Institute for Nuclear Research, Dubna, Russia and Institute
More informationENUMERATION OF TREES AND ONE AMAZING REPRESENTATION OF THE SYMMETRIC GROUP. Igor Pak Harvard University
ENUMERATION OF TREES AND ONE AMAZING REPRESENTATION OF THE SYMMETRIC GROUP Igor Pak Harvard University E-mail: pak@math.harvard.edu Alexander Postnikov Massachusetts Institute of Technology E-mail: apost@math.mit.edu
More informationOutline. The Distance Spectra of Cayley Graphs of Coxeter Groups. Finite Reflection Group. Root Systems. Reflection/Coxeter Groups.
The Distance Spectra of of Coxeter Groups Paul Renteln 1 Department of Physics California State University San Bernardino 2 Department of Mathematics California Institute of Technology ECNU, Shanghai June
More informationTHE ALCOVE PATH MODEL AND TABLEAUX. 1. Introduction
THE ALCOVE PATH MODEL AND TABLEAUX WILLIAM ADAMCZAK AND CRISTIAN LENART Abstract. The second author and Postnikov have recently constructed a simple combinatorial model for the characters of the irreducible
More informationHighest-weight Theory: Verma Modules
Highest-weight Theory: Verma Modules Math G4344, Spring 2012 We will now turn to the problem of classifying and constructing all finitedimensional representations of a complex semi-simple Lie algebra (or,
More informationOn Multiplicity-free Products of Schur P -functions. 1 Introduction
On Multiplicity-free Products of Schur P -functions Christine Bessenrodt Fakultät für Mathematik und Physik, Leibniz Universität Hannover, Welfengarten 3067 Hannover, Germany; bessen@math.uni-hannover.de
More informationRadon Transforms and the Finite General Linear Groups
Claremont Colleges Scholarship @ Claremont All HMC Faculty Publications and Research HMC Faculty Scholarship 1-1-2004 Radon Transforms and the Finite General Linear Groups Michael E. Orrison Harvey Mudd
More informationA NOTE ON TENSOR CATEGORIES OF LIE TYPE E 9
A NOTE ON TENSOR CATEGORIES OF LIE TYPE E 9 ERIC C. ROWELL Abstract. We consider the problem of decomposing tensor powers of the fundamental level 1 highest weight representation V of the affine Kac-Moody
More informationA relative version of Kostant s theorem
A relative version of Kostant s theorem 1 University of Vienna Faculty of Mathematics Srni, January 2015 1 supported by project P27072 N25 of the Austrian Science Fund (FWF) This talk reports on joint
More informationON CHARACTERS AND DIMENSION FORMULAS FOR REPRESENTATIONS OF THE LIE SUPERALGEBRA
ON CHARACTERS AND DIMENSION FORMULAS FOR REPRESENTATIONS OF THE LIE SUPERALGEBRA gl(m N E.M. MOENS Department of Applied Mathematics, Ghent University, Krijgslaan 281-S9, B-9000 Gent, Belgium. e-mail:
More informationGoals of this document This document tries to explain a few algorithms from Lie theory that would be useful to implement. I tried to include explanati
Representation Theory Issues For Sage Days 7 Goals of this document This document tries to explain a few algorithms from Lie theory that would be useful to implement. I tried to include explanations of
More informationq-alg/ Mar 96
Integrality of Two Variable Kostka Functions Friedrich Knop* Department of Mathematics, Rutgers University, New Brunswick NJ 08903, USA knop@math.rutgers.edu 1. Introduction q-alg/9603027 29 Mar 96 Macdonald
More informationA Cartan subalgebra of g is a maximal abelian subalgebra h Ă g consisting of semisimple (diagonalizeable) elements. (Analogous to Jucys-Murphy
A Cartan subalgebra of g is a maximal abelian subalgebra h Ă g consisting of semisimple (diagonalizeable) elements. (Analogous to Jucys-Murphy elements!!) A Cartan subalgebra of g is a maximal abelian
More informationThe Murnaghan-Nakayama Rule
The Murnaghan-Nakayama Rule Chandranandan Gangopadhyay April 21, 2014 The Murnaghan-Nakayama rule gives us a combinatorial way of computing the character table of any symmetric group S n Before illustrating
More informationQUASISYMMETRIC SCHUR FUNCTIONS
QUASISYMMETRIC SCHUR FUNCTIONS J. HAGLUND, K. LUOTO, S. MASON, AND S. VAN WILLIGENBURG Abstract. We introduce a new basis for quasisymmetric functions, which arise from a specialization of nonsymmetric
More informationGEOMETRIC STRUCTURES OF SEMISIMPLE LIE ALGEBRAS
GEOMETRIC STRUCTURES OF SEMISIMPLE LIE ALGEBRAS ANA BALIBANU DISCUSSED WITH PROFESSOR VICTOR GINZBURG 1. Introduction The aim of this paper is to explore the geometry of a Lie algebra g through the action
More informationTopics in Representation Theory: Roots and Weights
Topics in Representation Theory: Roots and Weights 1 The Representation Ring Last time we defined the maximal torus T and Weyl group W (G, T ) for a compact, connected Lie group G and explained that our
More information116 XIV. Reducing Product Representations
116 XIV. Reducing Product Representations XIV. Reducing Product Representations In Chapter X we began the consideration of nding the irreducible components of a product representation. The procedure for
More informationRepresentation theory
Representation theory Dr. Stuart Martin 2. Chapter 2: The Okounkov-Vershik approach These guys are Andrei Okounkov and Anatoly Vershik. The two papers appeared in 96 and 05. Here are the main steps: branching
More informationWreath Product Symmetric Functions
International Journal of Algebra, Vol. 3, 2009, no. 1, 1-19 Wreath Product Symmetric Functions Frank Ingram Mathematics Department, Winston-Salem State University Winston-Salem, NC 27110, USA ingramfr@wssu.edu
More informationOperators on k-tableaux and the k-littlewood Richardson rule for a special case. Sarah Elizabeth Iveson
Operators on k-tableaux and the k-littlewood Richardson rule for a special case by Sarah Elizabeth Iveson A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of
More informationTHE THEOREM OF THE HIGHEST WEIGHT
THE THEOREM OF THE HIGHEST WEIGHT ANKE D. POHL Abstract. Incomplete notes of the talk in the IRTG Student Seminar 07.06.06. This is a draft version and thought for internal use only. The Theorem of the
More information4. Killing form, root space inner product, and commutation relations * version 1.5 *
4. Killing form, root space inner product, and commutation relations * version 1.5 * Matthew Foster September 12, 2016 Contents 4.1 Weights in the Cartan-Weyl basis; rank-r bases for H and H 1 4.2 The
More informationRow-strict quasisymmetric Schur functions
Row-strict quasisymmetric Schur functions Sarah Mason and Jeffrey Remmel Mathematics Subject Classification (010). 05E05. Keywords. quasisymmetric functions, Schur functions, omega transform. Abstract.
More informationLECTURE 25-26: CARTAN S THEOREM OF MAXIMAL TORI. 1. Maximal Tori
LECTURE 25-26: CARTAN S THEOREM OF MAXIMAL TORI 1. Maximal Tori By a torus we mean a compact connected abelian Lie group, so a torus is a Lie group that is isomorphic to T n = R n /Z n. Definition 1.1.
More informationOn the Grothendieck Ring of a Hopf Algebra
On the Grothendieck Ring of a Hopf Algebra H is a fin. dim l Hopf algebra over an alg. closed field k of char p 0, with augmentation ε, antipode S,.... (1) Grothendieck ring and character algebra The Grothendieck
More informationThe Lusztig-Vogan Bijection in the Case of the Trivial Representation
The Lusztig-Vogan Bijection in the Case of the Trivial Representation Alan Peng under the direction of Guangyi Yue Department of Mathematics Massachusetts Institute of Technology Research Science Institute
More informationGROUP THEORY PRIMER. New terms: tensor, rank k tensor, Young tableau, Young diagram, hook, hook length, factors over hooks rule
GROUP THEORY PRIMER New terms: tensor, rank k tensor, Young tableau, Young diagram, hook, hook length, factors over hooks rule 1. Tensor methods for su(n) To study some aspects of representations of a
More informationRoot systems. S. Viswanath
Root systems S. Viswanath 1. (05/07/011) 1.1. Root systems. Let V be a finite dimensional R-vector space. A reflection is a linear map s α,h on V satisfying s α,h (x) = x for all x H and s α,h (α) = α,
More informationReflection groups. Arun Ram Department of Mathematics University of Wisconsin Madison, WI s f(α),λ = fs α,λ f 1.
Reflection groups Arun Ram Department of Mathematics University of Wisconsin Madison, WI 576 ram@mathwiscedu Definition of a reflection group Let V be a finite dimensional complex vector space of dimension
More informationPIERI S FORMULA FOR GENERALIZED SCHUR POLYNOMIALS
Title Pieri's formula for generalized Schur polynomials Author(s)Numata, Yasuhide CitationJournal of Algebraic Combinatorics, 26(1): 27-45 Issue Date 2007-08 Doc RL http://hdl.handle.net/2115/33803 Rights
More informationh r t r 1 (1 x i=1 (1 + x i t). e r t r = i=1 ( 1) i e i h r i = 0 r 1.
. Four definitions of Schur functions.. Lecture : Jacobi s definition (ca 850). Fix λ = (λ λ n and X = {x,...,x n }. () a α = det ( ) x α i j for α = (α,...,α n ) N n (2) Jacobi s def: s λ = a λ+δ /a δ
More informationAN UPPER BOUND FOR SIGNATURES OF IRREDUCIBLE, SELF-DUAL gl(n, C)-REPRESENTATIONS
AN UPPER BOUND FOR SIGNATURES OF IRREDUCIBLE, SELF-DUAL gl(n, C)-REPRESENTATIONS CHRISTOPHER XU UROP+ Summer 2018 Mentor: Daniil Kalinov Project suggested by David Vogan Abstract. For every irreducible,
More informationYOUNG-JUCYS-MURPHY ELEMENTS
YOUNG-JUCYS-MURPHY ELEMENTS MICAH GAY Abstract. In this lecture, we will be considering the branching multigraph of irreducible representations of the S n, although the morals of the arguments are applicable
More informationSPHERICAL UNITARY REPRESENTATIONS FOR REDUCTIVE GROUPS
SPHERICAL UNITARY REPRESENTATIONS FOR REDUCTIVE GROUPS DAN CIUBOTARU 1. Classical motivation: spherical functions 1.1. Spherical harmonics. Let S n 1 R n be the (n 1)-dimensional sphere, C (S n 1 ) the
More information5 Quiver Representations
5 Quiver Representations 5. Problems Problem 5.. Field embeddings. Recall that k(y,..., y m ) denotes the field of rational functions of y,..., y m over a field k. Let f : k[x,..., x n ] k(y,..., y m )
More informationTHE SEMISIMPLE SUBALGEBRAS OF EXCEPTIONAL LIE ALGEBRAS
Trudy Moskov. Matem. Obw. Trans. Moscow Math. Soc. Tom 67 (2006) 2006, Pages 225 259 S 0077-1554(06)00156-7 Article electronically published on December 27, 2006 THE SEMISIMPLE SUBALGEBRAS OF EXCEPTIONAL
More informationYOUNG TABLEAUX AND THE REPRESENTATIONS OF THE SYMMETRIC GROUP
YOUNG TABLEAUX AND THE REPRESENTATIONS OF THE SYMMETRIC GROUP YUFEI ZHAO ABSTRACT We explore an intimate connection between Young tableaux and representations of the symmetric group We describe the construction
More informationOn the singular elements of a semisimple Lie algebra and the generalized Amitsur-Levitski Theorem
On the singular elements of a semisimple Lie algebra and the generalized Amitsur-Levitski Theorem Bertram Kostant, MIT Conference on Representations of Reductive Groups Salt Lake City, Utah July 10, 2013
More informationCombinatorial bases for representations. of the Lie superalgebra gl m n
Combinatorial bases for representations of the Lie superalgebra gl m n Alexander Molev University of Sydney Gelfand Tsetlin bases for gln Gelfand Tsetlin bases for gl n Finite-dimensional irreducible representations
More informationA Pieri-type formula and a factorization formula for K-k-Schur February functions 22, / 37
A Pieri-type formula and a factorization formula for K-k-Schur functions Motoki TAKIGIKU The University of Tokyo February 22, 2018 A Pieri-type formula and a factorization formula for K-k-Schur February
More informationCombinatorial Structures
Combinatorial Structures Contents 1 Permutations 1 Partitions.1 Ferrers diagrams....................................... Skew diagrams........................................ Dominance order......................................
More informationNotes on Lie Algebras
NEW MEXICO TECH (October 23, 2010) DRAFT Notes on Lie Algebras Ivan G. Avramidi Department of Mathematics New Mexico Institute of Mining and Technology Socorro, NM 87801, USA E-mail: iavramid@nmt.edu 1
More informationClassical Lie algebras and Yangians
Classical Lie algebras and Yangians Alexander Molev University of Sydney Advanced Summer School Integrable Systems and Quantum Symmetries Prague 2007 Lecture 1. Casimir elements for classical Lie algebras
More informationA Littlewood-Richardson rule for symmetrizable Kac-Moody algebras
Introduction. A Littlewood-Richardson rule for symmetrizable Kac-Moody algebras Peter Littelmann * Mathematisches Institut der Universität Basel Rheinsprung 21 CH 4051 Basel 14. September 1992 Let G be
More informationMULTI-ORDERED POSETS. Lisa Bishop Department of Mathematics, Occidental College, Los Angeles, CA 90041, United States.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A06 MULTI-ORDERED POSETS Lisa Bishop Department of Mathematics, Occidental College, Los Angeles, CA 90041, United States lbishop@oxy.edu
More informationREPRESENTATION THEORY WEEK 5. B : V V k
REPRESENTATION THEORY WEEK 5 1. Invariant forms Recall that a bilinear form on a vector space V is a map satisfying B : V V k B (cv, dw) = cdb (v, w), B (v 1 + v, w) = B (v 1, w)+b (v, w), B (v, w 1 +
More informationCHAPTER 6. Representations of compact groups
CHAPTER 6 Representations of compact groups Throughout this chapter, denotes a compact group. 6.1. Examples of compact groups A standard theorem in elementary analysis says that a subset of C m (m a positive
More informationREPRESENTATION THEORY OF S n
REPRESENTATION THEORY OF S n EVAN JENKINS Abstract. These are notes from three lectures given in MATH 26700, Introduction to Representation Theory of Finite Groups, at the University of Chicago in November
More informationON THE COMBINATORICS OF CRYSTAL GRAPHS, II. THE CRYSTAL COMMUTOR. 1. Introduction
ON THE COMBINATORICS OF CRYSTAL GRAPHS, II. THE CRYSTAL COMMUTOR CRISTIAN LENART Abstract. We present an explicit combinatorial realization of the commutor in the category of crystals which was first studied
More informationThe Matrix-Tree Theorem
The Matrix-Tree Theorem Christopher Eur March 22, 2015 Abstract: We give a brief introduction to graph theory in light of linear algebra. Our results culminates in the proof of Matrix-Tree Theorem. 1 Preliminaries
More information