ADMISSIBLE W -GRAPHS. John R. Stembridge
|
|
- Emery Bradley
- 5 years ago
- Views:
Transcription
1 ADMISSIBLE W -GRAPHS John R. Stemridge jrs@umich.edu Contents. General W -Graphs. Admissile W -Graphs 3. The Agenda 4. The Admissile Cells in Rank 5. Cominatorial Characterization
2 . General W -Graphs Let (W, S) e a Coxeter system, S = {s,..., s n }. Primarily, W = a finite Weyl group. Let H = H(W, S) = the associated Iwahori-Hecke algera over Z[q ±/ ]. = T,..., T n (T i q)(t i + ) = 0, raid relations. Definition. An S-laeled graph is a triple Γ = (V, m, τ), where V is a (finite) vertex set, m : V V Z[q ±/ ] (i.e., a matrix of edge-weights), τ : V S = [n]. Notation. Write m(u v) for the (u, v)-entry of m. Let M(Γ) = free Z[q ±/ ]-module with asis V. Introduce operators T i on M(Γ): { T i (v) = qv v+q / u:i/ τ(u) m(v u)u if i / τ(v), if i τ(v). Definition (K-L). Γ is a W -graph if this yields an H-module. Note: (T i q)(t i + ) = 0 (always), so W -graph raid relations.
3 Remarks. { T i (v) = Kazhdan-Lusztig use T t i, not T i. qv if i / τ(v), v+q / u:i/ τ(u) m(v u)u if i τ(v). () Restriction: for J S, Γ J := (V, m, τ J ) is a W J -graph. At q =, we get a W -representation. However, raid relations at q = W -graph: If τ(v) τ(u), then () does not depend on m(v u). Convention. m(v u) := 0 whenever τ(v) τ(u). Definition. A W -cell is a strongly connected W -graph. For every W -graph Γ, M(Γ) has a filtration whose suquotients are cells. Typically, cells are not irreducile as H-reps or W -reps. However (Gyoja, 984): if W is finite every irrep may e realized as a W -cell.
4 . Admissile W -graphs H has a distinguished asis {C w : w W } (the Kazhdan-Lusztig asis). The action of T i on C w is encoded y a W -graph Γ W = (W, m, τ), where τ(v) = {s S : l(sv) < l(v)} (left descent set), m is determined y the Kazhdan-Lusztig polynomials: m(u v) = { µ(u, v)+µ(v, u) if τ(u) τ(v), 0 if τ(u) τ(v), where µ(u, v) = coeff. of q (l(v) l(u) )/ in P u,v (q) (= 0 unless u v). Remarks. This graph is generally very sparse, and has edge weights in Z. The cells of Γ W decompose the regular representation of H. These cells are often not irreducile as H-reps or W -reps. For all W of interest (finite or crystallographic), we know that P u,v (q) has nonnegative coefficients. These W -graphs are edge-symmetric; i.e., m(u v) = m(v u) if τ(u) τ(v) and τ(v) τ(u). () If µ(u, v) 0, then l(u) l(v) mod, so these graphs are ipartite. (Vogan) Similar W -graphs, cells, and K-L polynomials exist for Harish-Chandra modules ( real Lie group reps).
5 03: 0:8 0:35 00:96 98:96 99:60 97:60 96:560 95:560 93:560 94:567 9:00 90:39 88:375 9:00 89:65 87:405 77:00 86:340 83:340 84:340 76:340 75:340 8:340 8: : :340 85:55 80:89 78:3640 7:89 79: : :5040 6:400 6:7560 7: : : : : :835 64: : :4536 5:400 57:400 59:400 55: :8800 5: : :778 54:00 50:400 4:400 46:400 44: : :6075 4: : :835 45: :400 34:3500 3: : : : :3500 8:7560 3:5040 7:3640 6:89 30:89 4:340 5:3640 3:3640 9:340 6:340 :340 0:340 9:340 :340 33:55 8:65 5:405 7:00 :39 4:375 :567 0:00 3:00 6:560 8:560 9:560 7:60 4:60 5:96 3:96 :35 :8 0:
6 Definition. An S-laeled graph Γ = (V, m, τ) is admissile if it is edge-symmetric; i.e., m(u v) = m(v u) if τ(u) τ(v) and τ(v) τ(u), all edge weights m(u v) are nonnegative integers, and it is ipartite. Main Contention. These axioms capture the W -graphs that we care aout, and are sufficiently rigid that there should e few synthetic cells. Sufficient understanding of admissile W -cells could yield constructions of K-L cells without having to compute K-L polynomials. Example. The admissile A 4 -cells: All of these are K-L cells; none are synthetic.
7 The admissile D 4 -cells (three are synthetic):
8 3. The Agenda Prolem (W finite). Are there finitely many admissile W -cells? Confirmed for A,..., A 9, B, B 3, D 4, D 5, D 6, E 6, and rank. What aout W W -cells? Prolem. Classify/generate all admissile W -cells. Are the only admissile A n -cells the K-L cells? Caution (McLarnan-Warrington): Interesting things happen in A 5. Prolem 3. Understand cominatorial rigidity for cells. Rigidity means M(Γ ) = M(Γ ) (as W -reps) Γ = Γ. Example: Are K-L cells rigid? True for A n. Admissile W -cells are not rigid in general. Prolem 4. Understand compressiility of cells. A given W -cell or W -graph should e reconstructile from a small amount of data. (One possile approach: ranching rules).
9 4. The Admissile Cells in Rank Consider W = I (m), m <. (When m =, anything goes.) Given an I (m)-graph, partition the vertices according to τ: φ Focus on non-trivial cells: τ(v) = {} or {} for all v V. Encode edge weights {} {} (resp., {} {}) y a matrix A (resp. B). The conditions on A and B are as follows: m = : A = 0, B = 0. m = 3: AB =, BA =. m = 4: ABA = A, BAB = B. m = 5: ABAB 3AB + = 0, BABA 3BA + = 0. Remarks.. If we assume only Z-weights, no classification is possile (cf. m = 3). Edge symmetry A = B t. When m = 3, edge weights Z 0 edge symmetry, ut not in general.
10 Theorem. A -colored graph is an admissile I (m)-cell iff it is a properly -colored A-D-E Dynkin diagram whose Coxeter numer divides m. Example. The Dynkin diagrams with Coxeter numer dividing 6 are A, A, D 4, and A 5. Therefore, the (nontrivial) admissile G -cells are Note: The nontrival K-L cells for I (m) are paths of length m. Proof Sketch. Let Γ e any properly -colored graph. [ ] 0 B Let M = encode the edge weights of Γ. A 0 Let φ m (t) e the Cheyshev polynomial such that φ m ( cos θ) = Then Γ is an I (m)-cell φ m (M) = 0 sin mθ sin θ. M is diagonalizale with eigenvalues { cos(πj/m) : j < m}. Now assume Γ is admissile (M = M t, Z 0 -entries). If Γ is an I (m)-cell, then M is positive definite. Hence, M is a (symmetric) Cartan matrix of finite type. Conversely, let A e any Cartan matrix of finite type (symmetric or not). Then the eigenvalues of A are cos(πe j /h), where e, e,... are the exponents and h is the Coxeter numer.
11 5. Cominatorial Characterization For simplicity, we assume W is raid-finite: s i s j has finite order for all i, j. Theorem. If (W, S) is raid-finite, then an admissile S-laeled graph is a W -graph if and only if it satisfies the Compatiility Rule, the Simplicity Rule, the Bonding Rule, and the Polygon Rule. The Compatiility Rule (applies to all W -graphs for all W ): If m(u v) 0, then every i τ(u) τ(v) is onded to every j τ(v) τ(u). Necessity follows from analyzing commuting raid relations. Reformulation: Define the compatiility graph Comp(W, S): vertex set S = [n], edges I J when I J and every i I J is onded to every j J I. Compatiility means that τ : Γ Comp(W, S) is a graph morphism.
12 Compatiility graphs for A 3, A 4, and D 4 : 3 a 3 a 3 a 3 a 3 c 4 34 a 34 c a 3 c a a c 3 4 a 3 c 4 a 4 c 34 a 3 c a 3 c 3 c 0 a a ac c a a c c 3 3 c ac a 0 a c 3 ac
13 The Simplicity Rule (applies only in the raid-finite case): All edges are either simple or are inclusion arcs. That is, m(u v) 0 implies m(u v) = m(v u) = or τ(u) τ(v). Necessity follows from Theorem. The Bonding Rule: If s i s j has order p ij 3, then the cells of Γ must e {i,j} singletons with τ = or τ = {i, j}, and A-D-E Dynkin diagrams with Coxeter numer dividing p ij. Necessity again follows from Theorem. Example. If p ij = 3, then the nontrivial cells in Γ {i,j} are {i} {j}. Equivalently (for onds with p ij = 3): if i τ(u), j / τ(u) then there is a unique vertex v adjacent to u such that i / τ(v), j τ(v). Remark. The Compatiility, Simplicity, and Bonding Rules suffice to determine all admissile A 3 -cells.
14 The Polygon Rule: [Compare with G. Lusztig, Represent. Theory (997), Prop. A.4.] Define V ij := {v V : i τ(v), j τ(v)}, V i j := {v V : i τ(v), j / τ(v)}, V ij := {v V : i / τ(v), j / τ(v)}. A path u v v r v is alternating of type (i, j) if u V ij, v V i j, v V j i, v 3 V i j, v 4 V j i,..., v V ij. Set Nij r (u, v) := m(u v )m(v v ) m(v r v) (sum over all r-step alternating paths of type (i, j)). Then: Nij(u, r v) = Nji(u, r v) for r p ij. Example. 3-step alternating paths u i,j i/j j/i j/i i/j v
Admissible W-Graphs. John R. Stembridge Department of Mathematics University of Michigan Ann Arbor, Michigan
Admissible W-Graphs John R. Stembridge jrs@umich.edu Department of Mathematics University of Michigan Ann Arbor, Michigan 4809 043 June, 008 minor revisions June 9, 008; August 5, 008 0. Introduction.
More informationLittlewood Richardson coefficients for reflection groups
Littlewood Richardson coefficients for reflection groups Arkady Berenstein and Edward Richmond* University of British Columbia Joint Mathematical Meetings Boston January 7, 2012 Arkady Berenstein and Edward
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 informationThe classification of root systems
The classification of root systems Maris Ozols University of Waterloo Department of C&O November 28, 2007 Definition of the root system Definition Let E = R n be a real vector space. A finite subset R
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 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 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 informationProve proposition 68. It states: Let R be a ring. We have the following
Theorem HW7.1. properties: Prove proposition 68. It states: Let R be a ring. We have the following 1. The ring R only has one additive identity. That is, if 0 R with 0 +b = b+0 = b for every b R, then
More informationKAZHDAN LUSZTIG CELLS IN INFINITE COXETER GROUPS. 1. Introduction
KAZHDAN LUSZTIG CELLS IN INFINITE COXETER GROUPS MIKHAIL V. BELOLIPETSKY AND PAUL E. GUNNELLS 1. Introduction Groups defined by presentations of the form s 1,..., s n s 2 i = 1, (s i s j ) m i,j = 1 (i,
More informationQuivers. Virginia, Lonardo, Tiago and Eloy UNICAMP. 28 July 2006
Quivers Virginia, Lonardo, Tiago and Eloy UNICAMP 28 July 2006 1 Introduction This is our project Throughout this paper, k will indicate an algeraically closed field of characteristic 0 2 Quivers 21 asic
More informationFINITE GROUPS OF LIE TYPE AND THEIR
FINITE GROUPS OF LIE TYPE AND THEIR REPRESENTATIONS LECTURE IV Gerhard Hiss Lehrstuhl D für Mathematik RWTH Aachen University Groups St Andrews 2009 in Bath University of Bath, August 1 15, 2009 CONTENTS
More informationSU(N) representations
Appendix C SU(N) representations The group SU(N) has N 2 1 generators t a which form the asis of a Lie algera defined y the commutator relations in (A.2). The group has rank N 1 so there are N 1 Casimir
More informationU.C. Berkeley Better-than-Worst-Case Analysis Handout 3 Luca Trevisan May 24, 2018
U.C. Berkeley Better-than-Worst-Case Analysis Handout 3 Luca Trevisan May 24, 2018 Lecture 3 In which we show how to find a planted clique in a random graph. 1 Finding a Planted Clique We will analyze
More informationThe Image of Weyl Group Translations in Hecke Algebras
The Image of Weyl Group Translations in Hecke Algebras UROP+ Final Paper, Summer 2015 Arkadiy Frasinich Mentor: Konstantin Tolmachov Project Suggested By Roman Bezrukavnikov September 1, 2015 Abstract
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 informationLecture 5: Admissible Representations in the Atlas Framework
Lecture 5: Admissible Representations in the Atlas Framework B. Binegar Department of Mathematics Oklahoma State University Stillwater, OK 74078, USA Nankai Summer School in Representation Theory and Harmonic
More informationA LECTURE ON FINITE WEYL GROUPOIDS, OBERWOLFACH 2012
A LECTURE ON FINITE WEYL GROUPOIDS, OBERWOLFACH 202 M. CUNTZ Abstract. This is a short introduction to the theory of finite Weyl groupoids, crystallographic arrangements, and their classification. Introduction
More informationExtended groups and representation theory
Extended groups and representation theory Jeffrey Adams David Vogan University of Maryland Massachusetts Institute of Technology CUNY Representation Theory Seminar April 19, 2013 Outline Classification
More informationVertex Operator Algebra Structure of Standard Affine Lie Algebra Modules
Vertex Operator Algebra Structure of Standard Affine Lie Algebra Modules p. 1/4 Vertex Operator Algebra Structure of Standard Affine Lie Algebra Modules Christopher Sadowski Rutgers University Department
More informationLongest element of a finite Coxeter group
Longest element of a finite Coxeter group September 10, 2015 Here we draw together some well-known properties of the (unique) longest element w in a finite Coxeter group W, with reference to theorems 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 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 informationIntroduction to Association Schemes
Introduction to Association Schemes Akihiro Munemasa Tohoku University June 5 6, 24 Algebraic Combinatorics Summer School, Sendai Assumed results (i) Vandermonde determinant: a a m =. a m a m m i
More informationPresenting and Extending Hecke Endomorphism Algebras
Presenting and Extending Hecke Endomorphism Algebras Jie Du University of New South Wales Shanghai Conference on Representation Theory 7-11 December 2015 1 / 27 The Hecke Endomorphism Algebra The (equal
More informationH(G(Q p )//G(Z p )) = C c (SL n (Z p )\ SL n (Q p )/ SL n (Z p )).
92 19. Perverse sheaves on the affine Grassmannian 19.1. Spherical Hecke algebra. The Hecke algebra H(G(Q p )//G(Z p )) resp. H(G(F q ((T ))//G(F q [[T ]])) etc. of locally constant compactly supported
More informationSection Summary. Relations and Functions Properties of Relations. Combining Relations
Chapter 9 Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations Closures of Relations (not currently included
More informationZeta functions of buildings and Shimura varieties
Zeta functions of buildings and Shimura varieties Jerome William Hoffman January 6, 2008 0-0 Outline 1. Modular curves and graphs. 2. An example: X 0 (37). 3. Zeta functions for buildings? 4. Coxeter systems.
More informationTopics in Graph Theory
Topics in Graph Theory September 4, 2018 1 Preliminaries A graph is a system G = (V, E) consisting of a set V of vertices and a set E (disjoint from V ) of edges, together with an incidence function End
More informationEndoscopic character relations for the metaplectic group
Endoscopic character relations for the metaplectic group Wen-Wei Li wwli@math.ac.cn Morningside Center of Mathematics January 17, 2012 EANTC The local case: recollections F : local field, char(f ) 2. ψ
More informationClassification of Root Systems
U.U.D.M. Project Report 2018:30 Classification of Root Systems Filip Koerfer Examensarbete i matematik, 15 hp Handledare: Jakob Zimmermann Examinator: Martin Herschend Juni 2018 Department of Mathematics
More informationDefining equations for some nilpotent varieties
1 Defining equations for some nilpotent varieties Eric Sommers (UMass Amherst) Ben Johnson (Oklahoma State) The Mathematical Legacy of Bertram Kostant MIT June 1, 2018 Kostant s interest in the Buckyball
More informationReducibility of generic unipotent standard modules
Journal of Lie Theory Volume?? (??)???? c?? Heldermann Verlag 1 Version of March 10, 011 Reducibility of generic unipotent standard modules Dan Barbasch and Dan Ciubotaru Abstract. Using Lusztig s geometric
More informationGraph invariants in the spin model
Graph invariants in the spin model Alexander Schrijver 1 Abstract. Given a symmetric n n matrix A, we define, for any graph G, f A (G) := a φ(u),φ(v). φ:v G {1,...,n} uv EG We characterize for which graph
More informationFULLY COMMUTATIVE ELEMENTS AND KAZHDAN LUSZTIG CELLS IN THE FINITE AND AFFINE COXETER GROUPS. Jian-yi Shi
FULLY COMMUTATIVE ELEMENTS AND KAZHDAN LUSZTIG CELLS IN THE FINITE AND AFFINE COXETER GROUPS Jian-yi Shi Abstract. The main goal of the paper is to show that the fully commutative elements in the affine
More informationExamples of Groups
Examples of Groups 8-23-2016 In this section, I ll look at some additional examples of groups. Some of these will be discussed in more detail later on. In many of these examples, I ll assume familiar things
More information1 Positive definiteness and semidefiniteness
Positive definiteness and semidefiniteness Zdeněk Dvořák May 9, 205 For integers a, b, and c, let D(a, b, c) be the diagonal matrix with + for i =,..., a, D i,i = for i = a +,..., a + b,. 0 for i = a +
More informationNEW CLASSES OF SET-THEORETIC COMPLETE INTERSECTION MONOMIAL IDEALS
NEW CLASSES OF SET-THEORETIC COMPLETE INTERSECTION MONOMIAL IDEALS M. R. POURNAKI, S. A. SEYED FAKHARI, AND S. YASSEMI Abstract. Let be a simplicial complex and χ be an s-coloring of. Biermann and Van
More informationThe structure of euclidean Artin groups
The structure of euclidean Artin groups Jon McCammond UC Santa Barbara Cortona Sept 2014 Coxeter groups The spherical and euclidean Coxeter groups are reflection groups that act geometrically on spheres
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 informationSTEP Support Programme. Hints and Partial Solutions for Assignment 2
STEP Support Programme Hints and Partial Solutions for Assignment 2 Warm-up 1 (i) You could either expand the rackets and then factorise, or use the difference of two squares to get [(2x 3) + (x 1)][(2x
More informationON SOME PARTITIONS OF A FLAG MANIFOLD. G. Lusztig
ON SOME PARTITIONS OF A FLAG MANIFOLD G. Lusztig Introduction Let G be a connected reductive group over an algebraically closed field k of characteristic p 0. Let W be the Weyl group of G. Let W be the
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 information1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det
What is the determinant of the following matrix? 3 4 3 4 3 4 4 3 A 0 B 8 C 55 D 0 E 60 If det a a a 3 b b b 3 c c c 3 = 4, then det a a 4a 3 a b b 4b 3 b c c c 3 c = A 8 B 6 C 4 D E 3 Let A be an n n matrix
More informationPart III Symmetries, Fields and Particles
Part III Symmetries, Fields and Particles Theorems Based on lectures by N. Dorey Notes taken by Dexter Chua Michaelmas 2016 These notes are not endorsed by the lecturers, and I have modified them (often
More informationSang Gu Lee and Jeong Mo Yang
Commun. Korean Math. Soc. 20 (2005), No. 1, pp. 51 62 BOUND FOR 2-EXPONENTS OF PRIMITIVE EXTREMAL MINISTRONG DIGRAPHS Sang Gu Lee and Jeong Mo Yang Abstract. We consider 2-colored digraphs of the primitive
More informationIntroduction to Kleene Algebras
Introduction to Kleene Algebras Riccardo Pucella Basic Notions Seminar December 1, 2005 Introduction to Kleene Algebras p.1 Idempotent Semirings An idempotent semiring is a structure S = (S, +,, 1, 0)
More informationBruhat order, rationally smooth Schubert varieties, and hyperplane arrangements
FPSAC 2010, San Francisco, USA DMTCS proc. AN, 2010, 833 840 Bruhat order, rationally smooth Schubert varieties, and hyperplane arrangements Suho Oh 1 and Hwanchul Yoo Department of Mathematics, Massachusetts
More informationConformal embeddings and quantum graphs with self-fusion
São Paulo Journal of Mathematical Sciences 3, 2 (2009), 241 264 Conformal embeddings and quantum graphs with self-fusion R. Coquereaux 1 Centre de Physique Théorique(CPT), Luminy, Marseille Abstract. After
More informationZero controllability in discrete-time structured systems
1 Zero controllability in discrete-time structured systems Jacob van der Woude arxiv:173.8394v1 [math.oc] 24 Mar 217 Abstract In this paper we consider complex dynamical networks modeled by means of state
More informationMath.3336: Discrete Mathematics. Chapter 9 Relations
Math.3336: Discrete Mathematics Chapter 9 Relations Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall 2018
More informationClifford Algebras and Spin Groups
Clifford Algebras and Spin Groups Math G4344, Spring 2012 We ll now turn from the general theory to examine a specific class class of groups: the orthogonal groups. Recall that O(n, R) is the group of
More information10 Lorentz Group and Special Relativity
Physics 129 Lecture 16 Caltech, 02/27/18 Reference: Jones, Groups, Representations, and Physics, Chapter 10. 10 Lorentz Group and Special Relativity Special relativity says, physics laws should look the
More informationDefinition: A binary relation R from a set A to a set B is a subset R A B. Example:
Chapter 9 1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R A B. Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B.
More informationA 2 G 2 A 1 A 1. (3) A double edge pointing from α i to α j if α i, α j are not perpendicular and α i 2 = 2 α j 2
46 MATH 223A NOTES 2011 LIE ALGEBRAS 11. Classification of semisimple Lie algebras I will explain how the Cartan matrix and Dynkin diagrams describe root systems. Then I will go through the classification
More information(1) A frac = b : a, b A, b 0. We can define addition and multiplication of fractions as we normally would. a b + c d
The Algebraic Method 0.1. Integral Domains. Emmy Noether and others quickly realized that the classical algebraic number theory of Dedekind could be abstracted completely. In particular, rings of integers
More informationParticles I, Tutorial notes Sessions I-III: Roots & Weights
Particles I, Tutorial notes Sessions I-III: Roots & Weights Kfir Blum June, 008 Comments/corrections regarding these notes will be appreciated. My Email address is: kf ir.blum@weizmann.ac.il Contents 1
More informationNilpotent Orbits and Weyl Group Representations, I
Nilpotent Orbits and Weyl Group Representations, I O.S.U. Lie Groups Seminar April 12, 2017 1. Introduction Today, G will denote a complex Lie group and g the complexification of its Lie algebra. Moreover,
More informationA SURVEY OF CLUSTER ALGEBRAS
A SURVEY OF CLUSTER ALGEBRAS MELODY CHAN Abstract. This is a concise expository survey of cluster algebras, introduced by S. Fomin and A. Zelevinsky in their four-part series of foundational papers [1],
More informationNew Bounds for Partial Spreads of H(2d 1, q 2 ) and Partial Ovoids of the Ree-Tits Octagon
New Bounds for Partial Spreads of H2d 1, q 2 ) and Partial Ovoids of the Ree-Tits Octagon Ferdinand Ihringer Einstein Institute of Mathematics, The Hebrew University of Jerusalem, Givat Ram, Jerusalem,
More informationProblem 1. Let f n (x, y), n Z, be the sequence of rational functions in two variables x and y given by the initial conditions.
18.217 Problem Set (due Monday, December 03, 2018) Solve as many problems as you want. Turn in your favorite solutions. You can also solve and turn any other claims that were given in class without proofs,
More informationFrom Schur-Weyl duality to quantum symmetric pairs
.. From Schur-Weyl duality to quantum symmetric pairs Chun-Ju Lai Max Planck Institute for Mathematics in Bonn cjlai@mpim-bonn.mpg.de Dec 8, 2016 Outline...1 Schur-Weyl duality.2.3.4.5 Background.. GL
More informationCounting chains in noncrossing partition lattices
Counting chains in noncrossing partition lattices Nathan Reading NC State University NCSU Algebra Seminar, November 16, 2007 1 Counting chains in noncrossing partition lattices Classical noncrossing partitions
More informationReflection Groups and Invariant Theory
Richard Kane Reflection Groups and Invariant Theory Springer Introduction 1 Reflection groups 5 1 Euclidean reflection groups 6 1-1 Reflections and reflection groups 6 1-2 Groups of symmetries in the plane
More informationSubsystems, Nilpotent Orbits, and Weyl Group Representations
Subsystems, Nilpotent Orbits, and Weyl Group Representations OSU Lie Groups Seminar November 18, 2009 1. Introduction Let g be a complex semisimple Lie algebra. (Everything I say will also be true for
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 informationOutline. Some Reflection Group Numerology. Root Systems and Reflection Groups. Example: Symmetries of a triangle. Paul Renteln
Outline 1 California State University San Bernardino and Caltech 2 Queen Mary University of London June 13, 2014 3 Root Systems and Reflection Groups Example: Symmetries of a triangle V an n dimensional
More informationQUIVER GRASSMANNIANS, QUIVER VARIETIES AND THE PREPROJECTIVE ALGEBRA
QUIVER GRASSMANNIANS, QUIVER VARIETIES AND THE PREPROJECTIVE ALGEBRA ALISTAIR SAVAGE AND PETER TINGLEY Abstract. Quivers play an important role in the representation theory of algebras, with a key ingredient
More informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics Po-Shen Loh 27 June 2008 1 Warm-up 1. (A result of Bourbaki on finite geometries, from Răzvan) Let X be a finite set, and let F be a family of distinct proper subsets
More information2.3. VECTOR SPACES 25
2.3. VECTOR SPACES 25 2.3 Vector Spaces MATH 294 FALL 982 PRELIM # 3a 2.3. Let C[, ] denote the space of continuous functions defined on the interval [,] (i.e. f(x) is a member of C[, ] if f(x) is continuous
More informationROOT SYSTEMS AND DYNKIN DIAGRAMS
ROOT SYSTEMS AND DYNKIN DIAGRAMS DAVID MEHRLE In 1969, Murray Gell-Mann won the nobel prize in physics for his contributions and discoveries concerning the classification of elementary particles and their
More informationwithout annihilating, and q is the number of times E α can. This is encoded in the Cartan matrix for the simple roots, A ji = 2 α j α i = q p.
Chapter 8 Dynkin Diagrams We now describe how to use the constraints = q p where p is the number of times E can hit without annihilating, and q is the number of times E can. This is encoded in the Cartan
More informationSolutions I.N. Herstein- Second Edition
Solutions I.N. Herstein- Second Edition Sadiah Zahoor Please email me if any corrections at sadiahzahoor@cantab.net. R is a ring in all problems. Problem 0.1. If a, b, c, d R, evaluate (a + b)(c + d).
More informationarxiv: v2 [math.co] 30 Jun 2013
A polynomial representation and a unique code of a simple undirected graph arxiv:1304.5847v2 [math.co] 30 Jun 2013 Shamik Ghosh, Raibatak Sen Gupta, M. K. Sen Abstract In this note we introduce a representation
More informationTopics in linear algebra
Chapter 6 Topics in linear algebra 6.1 Change of basis I want to remind you of one of the basic ideas in linear algebra: change of basis. Let F be a field, V and W be finite dimensional vector spaces over
More informationNotes on Group Theory Lie Groups, Lie Algebras, and Linear Representations
Contents Notes on Group Theory Lie Groups, Lie Algebras, and Linear Representations Andrew Forrester January 28, 2009 1 Physics 231B 1 2 Questions 1 2.1 Basic Questions...........................................
More informationIn other words, we are interested in what is happening to the y values as we get really large x values and as we get really small x values.
Polynomial functions: End behavior Solutions NAME: In this lab, we are looking at the end behavior of polynomial graphs, i.e. what is happening to the y values at the (left and right) ends of the graph.
More informationRao s degree sequence conjecture
Rao s degree sequence conjecture Maria Chudnovsky 1 Columbia University, New York, NY 10027 Paul Seymour 2 Princeton University, Princeton, NJ 08544 July 31, 2009; revised December 10, 2013 1 Supported
More informationOut-colourings of Digraphs
Out-colourings of Digraphs N. Alon J. Bang-Jensen S. Bessy July 13, 2017 Abstract We study vertex colourings of digraphs so that no out-neighbourhood is monochromatic and call such a colouring an out-colouring.
More informationQUATERNIONS AND ROTATIONS
QUATERNIONS AND ROTATIONS SVANTE JANSON 1. Introduction The purpose of this note is to show some well-known relations between quaternions and the Lie groups SO(3) and SO(4) (rotations in R 3 and R 4 )
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 informationSome notes on Coxeter groups
Some notes on Coxeter groups Brooks Roberts November 28, 2017 CONTENTS 1 Contents 1 Sources 2 2 Reflections 3 3 The orthogonal group 7 4 Finite subgroups in two dimensions 9 5 Finite subgroups in three
More information5. Partitions and Relations Ch.22 of PJE.
5. Partitions and Relations Ch. of PJE. We now generalize the ideas of congruence classes of Z to classes of any set X. The properties of congruence classes that we start with here are that they are disjoint
More informationAnother algorithm for nonnegative matrices
Linear Algebra and its Applications 365 (2003) 3 12 www.elsevier.com/locate/laa Another algorithm for nonnegative matrices Manfred J. Bauch University of Bayreuth, Institute of Mathematics, D-95440 Bayreuth,
More informationENUMERATING m-clusters USING EXCEPTIONAL SEQUENCES
ENUMERATING m-clusters USING EXCEPTIONAL SEQUENCES KIYOSHI IGUSA Abstract. The number of clusters of Dynkin type has been computed case-by-case and is given by a simple product formula which has been extended
More informationClassification of Dieudonné Modules up to Isogeny
McGill University April 2013 The Motivation Why up to Isogeny? Easier problem might shed light on the harder problem. The theory might actually be nicer. Fits in well with a different perspective on Shimura
More informationChordal Coxeter Groups
arxiv:math/0607301v1 [math.gr] 12 Jul 2006 Chordal Coxeter Groups John Ratcliffe and Steven Tschantz Mathematics Department, Vanderbilt University, Nashville TN 37240, USA Abstract: A solution of the isomorphism
More information. Here the flats of H(2d 1, q 2 ) consist of all nonzero totally isotropic
NEW BOUNDS FOR PARTIAL SPREADS OF H(d 1, ) AND PARTIAL OVOIDS OF THE REE-TITS OCTAGON FERDINAND IHRINGER, PETER SIN, QING XIANG ( ) Abstract Our first result is that the size of a partial spread of H(,
More informationNOTE. A Note on Fisher's Inequality
journal of cominatorial theory, Series A 77, 171176 (1997) article no. TA962729 NOTE A Note on Fisher's Inequality Douglas R. Woodall Department of Mathematics, University of Nottingham, Nottingham NG7
More informationEpilogue: Quivers. Gabriel s Theorem
Epilogue: Quivers Gabriel s Theorem A figure consisting of several points connected by edges is called a graph. More precisely, a graph is a purely combinatorial object, which is considered given, if a
More informationModular Categories and Applications I
I Modular Categories and Applications I Texas A&M University U. South Alabama, November 2009 Outline I 1 Topological Quantum Computation 2 Fusion Categories Ribbon and Modular Categories Fusion Rules and
More informationFour-coloring P 6 -free graphs. I. Extending an excellent precoloring
Four-coloring P 6 -free graphs. I. Extending an excellent precoloring Maria Chudnovsky Princeton University, Princeton, NJ 08544 Sophie Spirkl Princeton University, Princeton, NJ 08544 Mingxian Zhong Columbia
More informationUSA Mathematical Talent Search Solutions to Problem 4/4/16
4/4/1. Find, with proof, all integers n such that there is a solution in nonnegative real numbers (x, y, z) to the system of equations 2x 2 + y 2 + z 2 = n and x + 4y + 5z = 2. Credit This problem was
More informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics Po-Shen Loh June 2009 1 Linear independence These problems both appeared in a course of Benny Sudakov at Princeton, but the links to Olympiad problems are due to Yufei
More informationIVAN LOSEV. Lemma 1.1. (λ) O. Proof. (λ) is generated by a single vector, v λ. We have the weight decomposition (λ) =
LECTURE 7: CATEGORY O AND REPRESENTATIONS OF ALGEBRAIC GROUPS IVAN LOSEV Introduction We continue our study of the representation theory of a finite dimensional semisimple Lie algebra g by introducing
More informationQuantizations of cluster algebras
Quantizations of cluster algebras Philipp Lampe Bielefeld University International Conference Mathematics Days in Sofia July 10, 2014, Sofia, Bulgaria Ph. Lampe (Bielefeld) Quantum cluster algebras July
More informationRepresentations of quivers
Representations of quivers Gwyn Bellamy October 13, 215 1 Quivers Let k be a field. Recall that a k-algebra is a k-vector space A with a bilinear map A A A making A into a unital, associative ring. Notice
More informationDownloaded 03/01/17 to Redistribution subject to SIAM license or copyright; see
SIAM J. DISCRETE MATH. Vol. 31, No. 1, pp. 335 382 c 2017 Society for Industrial and Applied Mathematics PARTITION CONSTRAINED COVERING OF A SYMMETRIC CROSSING SUPERMODULAR FUNCTION BY A GRAPH ATTILA BERNÁTH,
More informationApproximation Algorithms
Approximation Algorithms Chapter 26 Semidefinite Programming Zacharias Pitouras 1 Introduction LP place a good lower bound on OPT for NP-hard problems Are there other ways of doing this? Vector programs
More informationReference Material /Formulas for Pre-Calculus CP/ H Summer Packet
Reference Material /Formulas for Pre-Calculus CP/ H Summer Packet Week # 1 Order of Operations Step 1 Evaluate expressions inside grouping symbols. Order of Step 2 Evaluate all powers. Operations Step
More informationLECTURE 11: SOERGEL BIMODULES
LECTURE 11: SOERGEL BIMODULES IVAN LOSEV Introduction In this lecture we continue to study the category O 0 and explain some ideas towards the proof of the Kazhdan-Lusztig conjecture. We start by introducing
More information