Application of the Representation Theory of Symmetric Groups for the Computation of Chromatic Polynomials of Graphs
|
|
- Madeleine Cooper
- 5 years ago
- Views:
Transcription
1 Application of the Representation Theory of Symmetric Groups for the Computation of Chromatic Polynomials of Graphs Mikhail Klin Christian Pech 1 Department of Mathematics Ben Gurion University of the Negev Beer Sheva, Israel supported by the Skirball postodctoral fellowship of the Center of Advanced Studies in Mathematics at the Mathematics Department of Ben Gurion University. Klin,Pech Chromatic polynomials via Representation Theory / 27
2 Outline Representations of V(Sym(x),Ω x ) Klin,Pech Chromatic polynomials via Representation Theory / 27
3 Brief History of the Project Oberwolfach, 1994: a general idea suggested to Klin by P. de la Harpe and R. Bacher : first outline by Klin : use of representations of association schemes a la Zieschang by Klin-Pech Grenoble, 1998, Workshop in memory of F. Jaeger: discussion of a new version with de la Harpe and Bacher : Use of representations of symmetric groups by Pech July 2001: Exchange of ideas between N. Biggs and Klin Fall 2001: Joint paper in memory of J.J. Seidel submitted by Biggs, Klin and P. Reinfeld Fall 2007: Preparation of the final version Klin,Pech Chromatic polynomials via Representation Theory / 27
4 Graphs Definition A graph Γ is a pair (V, E) where V is a finite set, E ( V 2) = {{v, w} v, w V, v w}, V = n is the order of Γ, we assume V = n = {0, 1,..., n 1}. Example Klin,Pech Chromatic polynomials via Representation Theory / 27
5 Vertex colorings Given a graph Γ = (V, E). Definition Coloring of Γ with s colors: φ : V s = {0, 1,..., s 1}. proper coloring: v, w V : {v, w} E φ(v) φ(w). Example Klin,Pech Chromatic polynomials via Representation Theory / 27
6 Color-partitions of Γ = (V, E) V V equivalence relation such that (v, w) {v, w} / E if φ is a proper coloring of Γ with s colors then φ = ker φ = {(v, w) V 2 φ(v) = φ(w)} is a color-partition of Γ with r s classes. for each color-partition with r classes there are s(s 1) (s r + 1) proper colorings φ of Γ with s r colors and with ker φ =. Klin,Pech Chromatic polynomials via Representation Theory / 27
7 Chromatic polynomial of Γ = (V, E) where Clear: C(Γ; x) = s m r u (r) (x) r=1 m r : # of color-partitions of Γ with r classes, u (r) (x) = x(x 1) (x r + 1) C(Γ; s) is equal to the number of proper colorings of Γ with s colors. Klin,Pech Chromatic polynomials via Representation Theory / 27
8 Deletion & Contraction Method Γ = (V, E), e = {v, w} E Γ (e) deletion of e: e v Γ (e) contraction of e: w v w v e w v=w C(Γ; x) = C(Γ (e) ; x) C(Γ (e) ; x) Klin,Pech Chromatic polynomials via Representation Theory / 27
9 Computing C(Γ; x) by deletion and contraction Advantages: general and simple, easily implemented Disadvantage: in worst case 2 E steps are required in order to find C(Γ; x). Complexity: Deciding whether C(Γ, x) = 0 is NP-complete for all natural numbers x > 2. Hence in general, computing the chromatic polynomial is hard. Polynomial algorithms for special classes of graphs are possible (and wanted). Klin,Pech Chromatic polynomials via Representation Theory / 27
10 Generalized ladder graphs Given a basic graph Γ 0 = (V 0, E 0 ). Definition Γ = (V, E) is called generalized ladder for Γ 0 if V = V 0 V 1 V n 1, i : Γ Vi = Γ0, {v, w} E i : {v, w} V i (v V i w V i+1(mod n) ) We identify V with n V 0 and assume i n : {(i, v),(i, w)} E {v, w} E 0 Klin,Pech Chromatic polynomials via Representation Theory / 27
11 (0,0) (5,0) (0,2) (0,1) (1,0) (5,2) (5,1) (1,2) (1,1) (4,0) (2,0) (4,2) (4,1) (3,0) (2,2) (2,1) (3,2) (3,1) Klin,Pech Chromatic polynomials via Representation Theory / 27
12 Coloring generalized ladders φ be a proper coloring of Γ 0. Then φ i : (i, v) φ(v) is a proper coloring of Γ Vi. Ω x be the set of all proper colorings of Γ 0 with x colors. A proper coloring of Γ corresponds to a tuple (φ 0,...,φ n 1 ) Ω n x Any (φ 0,...,φ n 1 ) Ω n x induces a coloring of Γ: φ : (i, v) φ i (v) However, φ might be improper! Klin,Pech Chromatic polynomials via Representation Theory / 27
13 Coloring generalized ladders φ be a proper coloring of Γ 0. Then φ i : (i, v) φ(v) is a proper coloring of Γ Vi. Ω x be the set of all proper colorings of Γ 0 with x colors. A proper coloring of Γ corresponds to a tuple (φ 0,...,φ n 1 ) Ω n x Any (φ 0,...,φ n 1 ) Ω n x induces a coloring of Γ: φ : (i, v) φ i (v) However, φ might be improper! Klin,Pech Chromatic polynomials via Representation Theory / 27
14 Coloring generalized ladders φ be a proper coloring of Γ 0. Then φ i : (i, v) φ(v) is a proper coloring of Γ Vi. Ω x be the set of all proper colorings of Γ 0 with x colors. A proper coloring of Γ corresponds to a tuple (φ 0,...,φ n 1 ) Ω n x Any (φ 0,...,φ n 1 ) Ω n x induces a coloring of Γ: φ : (i, v) φ i (v) However, φ might be improper! Klin,Pech Chromatic polynomials via Representation Theory / 27
15 Coloring generalized ladders φ be a proper coloring of Γ 0. Then φ i : (i, v) φ(v) is a proper coloring of Γ Vi. Ω x be the set of all proper colorings of Γ 0 with x colors. A proper coloring of Γ corresponds to a tuple (φ 0,...,φ n 1 ) Ω n x Any (φ 0,...,φ n 1 ) Ω n x induces a coloring of Γ: φ : (i, v) φ i (v) However, φ might be improper! Klin,Pech Chromatic polynomials via Representation Theory / 27
16 Coloring generalized ladders φ be a proper coloring of Γ 0. Then φ i : (i, v) φ(v) is a proper coloring of Γ Vi. Ω x be the set of all proper colorings of Γ 0 with x colors. A proper coloring of Γ corresponds to a tuple (φ 0,...,φ n 1 ) Ω n x Any (φ 0,...,φ n 1 ) Ω n x induces a coloring of Γ: φ : (i, v) φ i (v) However, φ might be improper! Klin,Pech Chromatic polynomials via Representation Theory / 27
17 Question: Which elements of Ω n x correspond to proper colorings of Γ? For i n define R (i) x Ω 2 x : R (i) x = {(φ,ψ) v V i, w V i+1(mod n) : Proposition {v, w} E φ(v) ψ(w)} (φ 0,...,φ n 1 ) corresponds to a proper coloring of Γ iff i n : (φ i,φ i+1(mod n) ) R (i) x The R (i) x are called compatibility-relations. Klin,Pech Chromatic polynomials via Representation Theory / 27
18 Theorem Let B (i) x = A(R (i) x ) be the adjacency matrix of R (i) x (i n). Then C(Γ; x) = trace(b (0) x B (1) x B (n 1) x ) Main tool for the proof: Lemma Let Ω = {0, 1,...,n 1} and let R, S Ω 2. Let A = A(R), B = A(S), C = AB = (c i,j ) then c i,j = {k (i, k) R, (k, j) S} Klin,Pech Chromatic polynomials via Representation Theory / 27
19 Problem: How to find trace(b (0) x B (1) x B (n 1) x ) efficiently (without multiplying huge matrices)? Idea: take some semisimple matrix-algebra A x over C that contains all B (i) x (i n), use ordinary representation theory in order to find the trace. Klin,Pech Chromatic polynomials via Representation Theory / 27
20 Analysis of the colorings of the basic graph Γ 0 = (V 0, E 0 ) Assume V 0 = m = {0, 1,..., m 1}. Ω x the set of all proper vertex colorings of Γ 0 with x colors. Each coloring φ x V 0 = x m. Ω x is an m-ary relation of x = {0, 1,...,x 1}, the R (i) x are binary relations over Ω x. Proposition Ω x is an invariant relation of Sym(x) the symmetric group. Proposition Let (φ,ψ) R (i) x. Then π Sym(x) : (φ π,ψ π ) R (i) x. That is R (i) x is a binary invariant relation of (Sym(x),Ω x ). Klin,Pech Chromatic polynomials via Representation Theory / 27
21 An algebra for the B (i) x Remark R 1,...,R r be the minimal binary invariant relations (2-orbits in the sense of H. Wielandt) of (Sym(x),Ω x ), their adjacency matrices A 1,..., A r form the standard basis of a coherent algebra (in the sense of D.G. Higman), It is denoted: clearly B (i) x = A(R (i) x ) A x V(Sym(x),Ω x ) =: A x V(Sym(x),Ω x ) consists of all matrices that commute with all permutation matrices of (Sym(x),Ω x ). It is called centralizer algebra of (Sym(x),Ω x ). Klin,Pech Chromatic polynomials via Representation Theory / 27
22 Interesting properties of A x = V(Sym(x), Ω x ) General Properties A x is semisimple, the degrees and the number of the irreducible representations are independent of x, the multiplicities are polynomials in x, the matrices of the irreducible representations can be given as polynomial matrices. The irreducible representations of A x are closely related to those of (Sym(x),Ω x ) The bases of the representation modules may be described by embedding Specht-generators into C(Ω x ) Klin,Pech Chromatic polynomials via Representation Theory / 27
23 Interesting properties of A x = V(Sym(x), Ω x ) General Properties A x is semisimple, the degrees and the number of the irreducible representations are independent of x, the multiplicities are polynomials in x, the matrices of the irreducible representations can be given as polynomial matrices. The irreducible representations of A x are closely related to those of (Sym(x),Ω x ) The bases of the representation modules may be described by embedding Specht-generators into C(Ω x ) Klin,Pech Chromatic polynomials via Representation Theory / 27
24 Consequences for computing chromatic polynomials we saw that C(Γ; x) = trace(b x (0) B x (1) B x (n 1) ) for certain matrices B (i) x A x = V(Sym(x),Ω x ) Let C(Ω x ) = U 1 U 2 U m be a decomposition into irreducible A x -modules. Let σ j (B (i) x ) be the corresponding representation matrix of B (i) x on U j. Theorem C(Γ; x) = m trace(σ j (B (0) x )σ j (B (1) x ) σ j (B (n 1) x )). j=1 Polynomial Complexity Computing C(Γ; x) is reduced to the computation of traces of certain products of polynomial matrices whose order is independent of x. Klin,Pech Chromatic polynomials via Representation Theory / 27
25 (0,0) (5,0) (0,2) (0,1) (1,0) (5,2) (5,1) (1,2) (1,1) (4,0) (2,0) (4,2) (4,1) (3,0) (2,2) (2,1) (3,2) (3,1) Klin,Pech Chromatic polynomials via Representation Theory / 27
26 Proper colorings of the basis graph Ω x = {(a, b, c) {a, b, c} = 3, {a, b, c} {0, 1,..., x 1}} The compatibility-relations R (i) x R (0) x = {((a 0, a 1, a 2 ),(b 0, b 1, b 2 )) a 1 b 0 }, R x (1) = {((a 0, a 1, a 2 ),(b 0, b 1, b 2 )) a 1 b 1 and a 2 b 2 }, R (2) x = {((a 0, a 1, a 2 ),(b 0, b 1, b 2 )) a i b i (i = 0, 1, 2)}, R (3) x = R (0) x, R x (4) = R x (1), R (5) x = R (2) x. Klin,Pech Chromatic polynomials via Representation Theory / 27
27 The irreducible representations of B (0) x, B (1) x,and B (2) x i σi(b (0) x ) σi(b (1) x ) σi(b (2) x ) µi 0 (x 1) 2 (x 2) (x 2 3x + 3)(x 2) x 3 6x x (x 2)(x 1) x 2 x x 3 (x 2) 2 (x 2) x 3 x 2 (x 2) 2 x 2 + 5x 7 x 3 x 3 x 3 x 2 + 5x 7 x 3 x-1 x 3 x 3 x 2 + 5x x-2 x x x(x 3) 1 1 x x 2 6x x-2 x x (x 2)(x 1) 1 1 x 3 5 ( 0 ) 0 ( 0 ) 0 ( 1 ) (x 4)(x 2)x (x 3)(x 2)(x 1) Klin,Pech Chromatic polynomials via Representation Theory / 27
28 (0,0) (5,0) (0,2) (0,1) (1,0) (5,2) (5,1) (1,2) (1,1) (4,0) (2,0) (4,2) (4,1) (3,0) (2,2) (2,1) (3,2) (3,1) C(Γ, x) = (x 14 25x x x x x x x x x x x x x )(x 2) 2 (x 1)x. Klin,Pech Chromatic polynomials via Representation Theory / 27
29 Decomposition of C(Ω x ) Decomposition into constituents C(Sym(x),Ω x ) and V(Sym(x),Ω x ) share the primitive (mutually orthogonal) idempotents. The images of the primitive idempotents on C(Ω x ) are the constituents. To each partition of x there corresponds a constituent. Each partition is given by a Young-diagram. Irreducible representations of (Sym(x),Ω x ) Each constituent splits (uniquely) into an orthogonal sum of mutually isomorphic irreducible submodules. Each such irreducible submodule is isomorphic to the Specht-module defined by the corresponding partition. Klin,Pech Chromatic polynomials via Representation Theory / 27
30 Irreducible representations of V(Sym(x), Ω x ) Given a fixed partition π of x (e.g. in terms of a Young-diagram), S the Specht module for this partition, V = S S S the corresponding constituent, e i : S V the corresponding embeddings (i = 1,...,m). S is generated by the Specht-generators: S = s 1, s 2,..., s d. where d equals to the number of standard Young-tableaus for π Proposition Define U i := e 1 (s i ), e 2 (s i ),..., e m (s i ). Then 1 the U i are mutually isomorphic irreducible representation-modules of V(Sym(x),Ω x ), and 2 V = U 1 U 2 U d is a complete decomposition of V into irreducible submodules. Klin,Pech Chromatic polynomials via Representation Theory / 27
31 We defined the class of generalized ladder graphs. We counted proper colorings of generalized ladder graphs as trace of a product of certain compatibility-matrices. We identified the compatibility-matrices as elements of the centralizer algebra of the symmetric group acting on proper colorings of the base graph. We demonstrated how using the representation theory of the symmetric groups the compatibility matrices can be block-diagonalized where the order of each block is independent of the number of colors. From this we derived an efficient method for computing chromatic polynomials of generalized ladder graphs. Our approach inspired further developments by Biggs. There is potential to extend out method to graphs of bounded tree-width. Klin,Pech Chromatic polynomials via Representation Theory / 27
32 References N. L. BIGGS, R. M. DAMERELL, AND D. A. SANDS, Recursive families of graphs. J. Combinatorial Theory Ser. B 12, (1972), N. L. BIGGS, Algebraic Graph Theory. 2nd Edition, Cambridge Univesity Press, N. L. BIGGS, M. H. KLIN, AND P. REINFELD, Algebraic methods for chromatic polynomials. Research Report LSE-CDAM , Centre for Discrete and Applicable Mathematics, Sep N. BIGGS, Chromatic polynomials and representations of the symmetric group. Linear Algebra and its Applications 356, (2002), N. BIGGS, Specht modules and chromatic polynomials. J. Combinatorial Theory (B) 92, (2004), N. BIGGS, M. KLIN, AND P. REINFELD, Algebraic methods for chromatic polynomials. Europ. J. Combinatorics 25, (2004), Klin,Pech Chromatic polynomials via Representation Theory / 27
Tutte Polynomials of Bracelets. Norman Biggs
Tutte Polynomials of Bracelets Norman Biggs Department of Mathematics London School of Economics Houghton Street London WC2A 2AE U.K. n.l.biggs@lse.ac.uk January 2009 CDAM Research Reports Series LSE-CDAM
More informationModular representations of symmetric groups: An Overview
Modular representations of symmetric groups: An Overview Bhama Srinivasan University of Illinois at Chicago Regina, May 2012 Bhama Srinivasan (University of Illinois at Chicago) Modular Representations
More informationOn algebras arising from semiregular group actions
On algebras arising from semiregular group actions István Kovács Department of Mathematics and Computer Science University of Primorska, Slovenia kovacs@pef.upr.si . Schur rings For a permutation group
More informationThe cycle polynomial of a permutation group
The cycle polynomial of a permutation group Peter J. Cameron School of Mathematics and Statistics University of St Andrews North Haugh St Andrews, Fife, U.K. pjc0@st-andrews.ac.uk Jason Semeraro Department
More informationScaffolds. A graph-based system for computations in Bose-Mesner algebras. William J. Martin
A graph-based system for computations in Bose-esner algebras Department of athematical Sciences and Department of Computer Science Worcester Polytechnic Institute Algebraic Combinatorics Seminar Shanghai
More informationButson-Hadamard matrices in association schemes of class 6 on Galois rings of characteristic 4
Butson-Hadamard matrices in association schemes of class 6 on Galois rings of characteristic 4 Akihiro Munemasa Tohoku University (joint work with Takuya Ikuta) November 17, 2017 Combinatorics Seminar
More informationButson-Hadamard matrices in association schemes of class 6 on Galois rings of characteristic 4
Butson-Hadamard matrices in association schemes of class 6 on Galois rings of characteristic 4 Akihiro Munemasa Tohoku University (joint work with Takuya Ikuta) November 17, 2017 Combinatorics Seminar
More informationTutte polynomials of bracelets
J Algebr Comb (2010) 32: 389 398 DOI 10.1007/s10801-010-0220-1 Tutte polynomials of bracelets Norman Biggs Received: 15 May 2009 / Accepted: 15 February 2010 / Published online: 2 March 2010 Springer Science+Business
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 informationCharacter Polynomials
Character Polynomials Problem From Stanley s Positivity Problems in Algebraic Combinatorics Problem : Give a combinatorial interpretation of the row sums of the character table for S n (combinatorial proof
More informationSAMPLE TEX FILE ZAJJ DAUGHERTY
SAMPLE TEX FILE ZAJJ DAUGHERTY Contents. What is the partition algebra?.. Graphs and equivalence relations.. Diagrams and their compositions.. The partition algebra. Combinatorial representation theory:
More informationTractable Approximations of Graph Isomorphism.
Tractable Approximations of Graph Isomorphism. Anuj Dawar University of Cambridge Computer Laboratory visiting RWTH Aachen joint work with Bjarki Holm Darmstadt, 5 February 2014 Graph Isomorphism Graph
More informationCitation Osaka Journal of Mathematics. 43(2)
TitleIrreducible representations of the Author(s) Kosuda, Masashi Citation Osaka Journal of Mathematics. 43(2) Issue 2006-06 Date Text Version publisher URL http://hdl.handle.net/094/0396 DOI Rights Osaka
More informationCoherent Configurations and Association Schemes. Part I. Definitions, examples, simple facts
Coherent Configurations and Association Schemes Part I Definitions, examples, simple facts Mikhail Klin Department of Mathematics Ben Gurion University of the Negev Beer Sheva, Israel Special Semester
More informationOn some incidence structures constructed from groups and related codes
On some incidence structures constructed from groups and related codes Dean Crnković Department of Mathematics University of Rijeka Croatia Algebraic Combinatorics and Applications The first annual Kliakhandler
More informationAdjoint Representations of the Symmetric Group
Adjoint Representations of the Symmetric Group Mahir Bilen Can 1 and Miles Jones 2 1 mahirbilencan@gmail.com 2 mej016@ucsd.edu Abstract We study the restriction to the symmetric group, S n of the adjoint
More informationIrreducible Representations of symmetric group S n
Irreducible Representations of symmetric group S n Yin Su 045 Good references: ulton Young tableaux with applications to representation theory and geometry ulton Harris Representation thoery a first course
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 informationNon-Recursively Constructible Recursive Families of Graphs
Non-Recursively Constructible Recursive Families of Graphs Colleen Bouey Department of Mathematics Loyola Marymount College Los Angeles, CA 90045, USA cbouey@lion.lmu.edu Aaron Ostrander Dept of Math and
More informationOn Weak Chromatic Polynomials of Mixed Graphs
On Weak Chromatic Polynomials of Mixed Graphs Daniel Blado California Institute of Technology Joseph Crawford Morehouse College July 27, 2012 Taïna Jean-Louis Amherst College Abstract Modeling of metabolic
More informationMarkov chains, graph spectra, and some static/dynamic scaling limits
Markov chains, graph spectra, and some static/dynamic scaling limits Akihito Hora Hokkaido University I will talk about how I began to get interested in spectra of graphs and then was led to beautiful
More informationON WEAK CHROMATIC POLYNOMIALS OF MIXED GRAPHS
ON WEAK CHROMATIC POLYNOMIALS OF MIXED GRAPHS MATTHIAS BECK, DANIEL BLADO, JOSEPH CRAWFORD, TAÏNA JEAN-LOUIS, AND MICHAEL YOUNG Abstract. A mixed graph is a graph with directed edges, called arcs, and
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 informationSelected Topics in AGT Lecture 4 Introduction to Schur Rings
Selected Topics in AGT Lecture 4 Introduction to Schur Rings Mikhail Klin (BGU and UMB) September 14 18, 2015 M. Klin Selected topics in AGT September 2015 1 / 75 1 Schur rings as a particular case of
More informationtriangles Mikhail Klin Department of Mathematics Ben-Gurion University of the Negev Beer Sheva, Israel Strongly regular graphs with no triangles
Mikhail Klin Department of Mathematics Ben-Gurion University of the Negev Beer Sheva, Israel via SRG series via 1 2 via 3 SRG series via 4 5 6 7 8 9 via SRG series via 10 1 2 via 3 SRG series via 4 5 6
More informationVector fields and phase flows in the plane. Geometric and algebraic properties of linear systems. Existence, uniqueness, and continuity
Math Courses Approved for MSME (2015/16) Mth 511 - Introduction to Real Analysis I (3) elements of functional analysis. This is the first course in a sequence of three: Mth 511, Mth 512 and Mth 513 which
More informationA Design and a Code Invariant
JOURNAL OF COMBINATORIAL THEORY, Series A 62, 225-233 (1993) A Design and a Code Invariant under the Simple Group Co3 WILLEM H. HAEMERS Department of Economics, Tilburg University, P.O. Box 90153, 5000
More informationBounded Treewidth Graphs A Survey German Russian Winter School St. Petersburg, Russia
Bounded Treewidth Graphs A Survey German Russian Winter School St. Petersburg, Russia Andreas Krause krausea@cs.tum.edu Technical University of Munich February 12, 2003 This survey gives an introduction
More informationJOHNSON SCHEMES AND CERTAIN MATRICES WITH INTEGRAL EIGENVALUES
JOHNSON SCHEMES AND CERTAIN MATRICES WITH INTEGRAL EIGENVALUES AMANDA BURCROFF The University of Michigan Wednesday 6 th September, 2017 Abstract. We are interested in the spectrum of matrices in the adjacency
More informationCombinatorial Commutative Algebra, Graph Colorability, and Algorithms
I G,k = g 1,...,g n Combinatorial Commutative Algebra, Graph Colorability, and Algorithms Chris Hillar (University of California, Berkeley) Joint with Troels Windfeldt! (University of Copenhagen)! Outline
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 informationPermutation groups/1. 1 Automorphism groups, permutation groups, abstract
Permutation groups Whatever you have to do with a structure-endowed entity Σ try to determine its group of automorphisms... You can expect to gain a deep insight into the constitution of Σ in this way.
More informationThe Terwilliger Algebras of Group Association Schemes
The Terwilliger Algebras of Group Association Schemes Eiichi Bannai Akihiro Munemasa The Terwilliger algebra of an association scheme was introduced by Paul Terwilliger [7] in order to study P-and Q-polynomial
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 modular absolute bound condition for primitive association schemes
J Algebr Comb (2009) 29: 447 456 DOI 10.1007/s10801-008-0145-0 A modular absolute bound condition for primitive association schemes Akihide Hanaki Ilia Ponomarenko Received: 29 September 2007 / Accepted:
More informationRING ELEMENTS AS SUMS OF UNITS
1 RING ELEMENTS AS SUMS OF UNITS CHARLES LANSKI AND ATTILA MARÓTI Abstract. In an Artinian ring R every element of R can be expressed as the sum of two units if and only if R/J(R) does not contain a summand
More informationNonnegative Matrices I
Nonnegative Matrices I Daisuke Oyama Topics in Economic Theory September 26, 2017 References J. L. Stuart, Digraphs and Matrices, in Handbook of Linear Algebra, Chapter 29, 2006. R. A. Brualdi and H. J.
More informationApproaches to bounding the exponent of matrix multiplication
Approaches to bounding the exponent of matrix multiplication Chris Umans Caltech Based on joint work with Noga Alon, Henry Cohn, Bobby Kleinberg, Amir Shpilka, Balazs Szegedy Simons Institute Sept. 7,
More informationREPRESENTATION THEORY FOR FINITE GROUPS
REPRESENTATION THEORY FOR FINITE GROUPS SHAUN TAN Abstract. We cover some of the foundational results of representation theory including Maschke s Theorem, Schur s Lemma, and the Schur Orthogonality Relations.
More informationComplex Hadamard matrices and 3-class association schemes
Complex Hadamard matrices and 3-class association schemes Akihiro Munemasa 1 1 Graduate School of Information Sciences Tohoku University (joint work with Takuya Ikuta) June 26, 2013 The 30th Algebraic
More informationGroup theoretic aspects of the theory of association schemes
Group theoretic aspects of the theory of association schemes Akihiro Munemasa Graduate School of Information Sciences Tohoku University October 29, 2016 International Workshop on Algebraic Combinatorics
More informationALGEBRA EXERCISES, PhD EXAMINATION LEVEL
ALGEBRA EXERCISES, PhD EXAMINATION LEVEL 1. Suppose that G is a finite group. (a) Prove that if G is nilpotent, and H is any proper subgroup, then H is a proper subgroup of its normalizer. (b) Use (a)
More informationCommutative Association Schemes Whose Symmetrizations Have Two Classes*
Journal of Algebraic Combinatorics 5 (1996), 47-55 1996 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Commutative Association Schemes Whose Symmetrizations Have Two Classes* SUNG
More informationApplications of semidefinite programming in Algebraic Combinatorics
Applications of semidefinite programming in Algebraic Combinatorics Tohoku University The 23rd RAMP Symposium October 24, 2011 We often want to 1 Bound the value of a numerical parameter of certain combinatorial
More informationThe Algorithmic Aspects of the Regularity Lemma
The Algorithmic Aspects of the Regularity Lemma N. Alon R. A. Duke H. Lefmann V. Rödl R. Yuster Abstract The Regularity Lemma of Szemerédi is a result that asserts that every graph can be partitioned in
More informationCHARACTERS AS CENTRAL IDEMPOTENTS
CHARACTERS AS CENTRAL IDEMPOTENTS CİHAN BAHRAN I have recently noticed (while thinking about the skewed orthogonality business Theo has mentioned) that the irreducible characters of a finite group G are
More informationNotes on the Vershik-Okounkov approach to the representation theory of the symmetric groups
Notes on the Vershik-Okounkov approach to the representation theory of the symmetric groups 1 Introduction These notes 1 contain an expository account of the beautiful new approach to the complex finite
More information33 Idempotents and Characters
33 Idempotents and Characters On this day I was supposed to talk about characters but I spent most of the hour talking about idempotents so I changed the title. An idempotent is defined to be an element
More informationLecture 22: Counting
CS 710: Complexity Theory 4/8/2010 Lecture 22: Counting Instructor: Dieter van Melkebeek Scribe: Phil Rydzewski & Chi Man Liu Last time we introduced extractors and discussed two methods to construct them.
More informationThe Chromatic Symmetric Function: Hypergraphs and Beyond
The : Hypergraphs and Beyond arxiv:6.0969 Department of Mathematics Michigan State University Graduate Student Combinatorics Conference, April 07 Outline Introducing the chromatic symmetric function Definition
More informationDiscriminants of Brauer Algebra
Discriminants of Brauer Algebra Dr.Jeyabharthi, Associate Professor Department of Mathematics, Thiagarajar Engineering College, Madurai. J.Evangeline Jeba, Assistant Professor Department of Mathematics,
More informationChromatic bases for symmetric functions
Chromatic bases for symmetric functions Soojin Cho Department of Mathematics Ajou University Suwon 443-749, Korea chosj@ajou.ac.kr Stephanie van Willigenburg Department of Mathematics University of British
More informationElementary Equivalence in Finite Structures
Elementary Equivalence in Finite Structures Anuj Dawar University of Cambridge Computer Laboratory YuriFest, Berlin, 11 September 2015 When I First Met Yuri When I was a graduate student, I sent Yuri a
More informationData Analysis and Manifold Learning Lecture 9: Diffusion on Manifolds and on Graphs
Data Analysis and Manifold Learning Lecture 9: Diffusion on Manifolds and on Graphs Radu Horaud INRIA Grenoble Rhone-Alpes, France Radu.Horaud@inrialpes.fr http://perception.inrialpes.fr/ Outline of Lecture
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 informationPhysical Mapping. Restriction Mapping. Lecture 12. A physical map of a DNA tells the location of precisely defined sequences along the molecule.
Computat onal iology Lecture 12 Physical Mapping physical map of a DN tells the location of precisely defined sequences along the molecule. Restriction mapping: mapping of restriction sites of a cutting
More informationLinear and Bilinear Algebra (2WF04) Jan Draisma
Linear and Bilinear Algebra (2WF04) Jan Draisma CHAPTER 3 The minimal polynomial and nilpotent maps 3.1. Minimal polynomial Throughout this chapter, V is a finite-dimensional vector space of dimension
More informationA tree-decomposed transfer matrix for computing exact partition functions for arbitrary graphs
A tree-decomposed transfer matrix for computing exact partition functions for arbitrary graphs Andrea Bedini 1 Jesper L. Jacobsen 2 1 MASCOS, The University of Melbourne, Melbourne 2 LPTENS, École Normale
More informationAdvanced Combinatorial Optimization Feb 13 and 25, Lectures 4 and 6
18.438 Advanced Combinatorial Optimization Feb 13 and 25, 2014 Lectures 4 and 6 Lecturer: Michel X. Goemans Scribe: Zhenyu Liao and Michel X. Goemans Today, we will use an algebraic approach to solve the
More informationFUSION PROCEDURE FOR THE BRAUER ALGEBRA
FUSION PROCEDURE FOR THE BRAUER ALGEBRA A. P. ISAEV AND A. I. MOLEV Abstract. We show that all primitive idempotents for the Brauer algebra B n ω can be found by evaluating a rational function in several
More informationThe Hierarchical Product of Graphs
The Hierarchical Product of Graphs Lali Barrière Francesc Comellas Cristina Dalfó Miquel Àngel Fiol Universitat Politècnica de Catalunya - DMA4 April 8, 2008 Outline 1 Introduction 2 Graphs and matrices
More informationPermutation groups and transformation semigroups
Permutation groups and transformation semigroups Peter J. Cameron Novi Sad Algebraic Conference, June 2013 Groups and semigroups How can group theory help the study of semigroups? If a semigroup has a
More informationThe Terwilliger algebra of a Q-polynomial distance-regular graph with respect to a set of vertices
The Terwilliger algebra of a Q-polynomial distance-regular graph with respect to a set of vertices Hajime Tanaka (joint work with Rie Tanaka and Yuta Watanabe) Research Center for Pure and Applied Mathematics
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 informationThe Combinatorics of Symmetric Functions: (3 + 1)-free Posets and the Poset Chain Conjecture
The Combinatorics of Symmetric Functions: ( + 1)-free Posets and the Poset Chain Conjecture Mary Bushman, Alex Evangelides, Nathan King, Sam Tucker Department of Mathematics Carleton College Northfield,
More informationALGEBRA QUALIFYING EXAM, FALL 2017: SOLUTIONS
ALGEBRA QUALIFYING EXAM, FALL 2017: SOLUTIONS Your Name: Conventions: all rings and algebras are assumed to be unital. Part I. True or false? If true provide a brief explanation, if false provide a counterexample
More informationACO Comprehensive Exam March 20 and 21, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms Part a: You are given a graph G = (V,E) with edge weights w(e) > 0 for e E. You are also given a minimum cost spanning tree (MST) T. For one particular edge
More informationKRONECKER POWERS CHARACTER POLYNOMIALS. A. Goupil, with C. Chauve and A. Garsia,
KRONECKER POWERS AND CHARACTER POLYNOMIALS A. Goupil, with C. Chauve and A. Garsia, Menu Introduction : Kronecker products Tensor powers Character Polynomials Perspective : Duality with product of conjugacy
More informationPermutation Groups. John Bamberg, Michael Giudici and Cheryl Praeger. Centre for the Mathematics of Symmetry and Computation
Notation Basics of permutation group theory Arc-transitive graphs Primitivity Normal subgroups of primitive groups Permutation Groups John Bamberg, Michael Giudici and Cheryl Praeger Centre for the Mathematics
More informationA Course in Combinatorics
A Course in Combinatorics J. H. van Lint Technical Universüy of Eindhoven and R. M. Wilson California Institute of Technology H CAMBRIDGE UNIVERSITY PRESS CONTENTS Preface xi 1. Graphs 1 Terminology of
More informationThe Gelfand-Tsetlin Basis (Too Many Direct Sums, and Also a Graph)
The Gelfand-Tsetlin Basis (Too Many Direct Sums, and Also a Graph) David Grabovsky June 13, 2018 Abstract The symmetric groups S n, consisting of all permutations on a set of n elements, naturally contain
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 informationCentral Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J
Central Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J Frank Curtis, John Drew, Chi-Kwong Li, and Daniel Pragel September 25, 2003 Abstract We study central groupoids, central
More informationON COHERENCE OF GRAPH PRODUCTS AND COXETER GROUPS
ON COHERENCE OF GRAPH PRODUCTS AND COXETER GROUPS OLGA VARGHESE Abstract. Graph products and Coxeter groups are defined via vertex-edge-labeled graphs. We show that if the graph has a special shape, then
More informationA study of permutation groups and coherent configurations. John Herbert Batchelor. A Creative Component submitted to the graduate faculty
A study of permutation groups and coherent configurations by John Herbert Batchelor A Creative Component submitted to the graduate faculty in partial fulfillment of the requirements for the degree of MASTER
More informationCOURSE SUMMARY FOR MATH 504, FALL QUARTER : MODERN ALGEBRA
COURSE SUMMARY FOR MATH 504, FALL QUARTER 2017-8: MODERN ALGEBRA JAROD ALPER Week 1, Sept 27, 29: Introduction to Groups Lecture 1: Introduction to groups. Defined a group and discussed basic properties
More informationA PROOF OF BURNSIDE S p a q b THEOREM
A PROOF OF BURNSIDE S p a q b THEOREM OBOB Abstract. We prove that if p and q are prime, then any group of order p a q b is solvable. Throughout this note, denote by A the set of algebraic numbers. We
More informationNick Gill. 13th July Joint with Hunt (USW) and Spiga (Milano Bicocca).
13th July 2016 Joint with Hunt and Spiga (Milano Bicocca). Overview Beautiful sets From here on, G is a group acting on a set Ω, and Λ is a subset of Ω. Write G Λ for the set-wise stabilizer of Λ. Write
More informationA classification of sharp tridiagonal pairs. Tatsuro Ito, Kazumasa Nomura, Paul Terwilliger
Tatsuro Ito Kazumasa Nomura Paul Terwilliger Overview This talk concerns a linear algebraic object called a tridiagonal pair. We will describe its features such as the eigenvalues, dual eigenvalues, shape,
More informationThe Multiplicities of a Dual-thin Q-polynomial Association Scheme
The Multiplicities of a Dual-thin Q-polynomial Association Scheme Bruce E. Sagan Department of Mathematics Michigan State University East Lansing, MI 44824-1027 sagan@math.msu.edu and John S. Caughman,
More informationEKT of Some Wonderful Compactifications
EKT of Some Wonderful Compactifications and recent results on Complete Quadrics. (Based on joint works with Soumya Banerjee and Michael Joyce) Mahir Bilen Can April 16, 2016 Mahir Bilen Can EKT of Some
More informationCounting bases of representable matroids
Counting bases of representable matroids Michael Snook School of Mathematics, Statistics and Operations Research Victoria University of Wellington Wellington, New Zealand michael.snook@msor.vuw.ac.nz Submitted:
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 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 informationLeavitt Path Algebras
Leavitt Path Algebras At the crossroads of Algebra and Functional Analysis Mark Tomforde University of Houston USA In its beginnings, the study of Operator Algebras received a great deal of motivation
More informationSpectral Continuity Properties of Graph Laplacians
Spectral Continuity Properties of Graph Laplacians David Jekel May 24, 2017 Overview Spectral invariants of the graph Laplacian depend continuously on the graph. We consider triples (G, x, T ), where G
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 informationOn the centre of the generic algebra of M 1,1
On the centre of the generic algebra of M 1,1 Thiago Castilho de Mello University of Campinas PhD grant from CNPq, Brazil F is a field of characteristic zero; F X = F x 1, x 2,... is the free associative
More informationCharacter values and decomposition matrices of symmetric groups
Character values and decomposition matrices of symmetric groups Mark Wildon Abstract The relationships between the values taken by ordinary characters of symmetric groups are exploited to prove two theorems
More informationRepresentation Theory
Representation Theory Representations Let G be a group and V a vector space over a field k. A representation of G on V is a group homomorphism ρ : G Aut(V ). The degree (or dimension) of ρ is just dim
More informationSiegel s theorem, edge coloring, and a holant dichotomy
Siegel s theorem, edge coloring, and a holant dichotomy Tyson Williams (University of Wisconsin-Madison) Joint with: Jin-Yi Cai and Heng Guo (University of Wisconsin-Madison) Appeared at FOCS 2014 1 /
More informationPrimitivity. Peter J. Cameron. Combinatorics, Algebra and More 8 July 2013
Primitivity Peter J. Cameron Combinatorics, Algebra and More 8 July 2013 Before I begin, I d like to say sincere thanks to I my colleagues and students at Queen Mary, past and present, who have made this
More informationTactical Decompositions of Steiner Systems and Orbits of Projective Groups
Journal of Algebraic Combinatorics 12 (2000), 123 130 c 2000 Kluwer Academic Publishers. Manufactured in The Netherlands. Tactical Decompositions of Steiner Systems and Orbits of Projective Groups KELDON
More informationThe maximum size of a partial spread in H(4n + 1,q 2 ) is q 2n+1 + 1
The maximum size of a partial spread in H(4n +, 2 ) is 2n+ + Frédéric Vanhove Dept. of Pure Mathematics and Computer Algebra, Ghent University Krijgslaan 28 S22 B-9000 Ghent, Belgium fvanhove@cage.ugent.be
More informationSPLIT GROTHENDIECK RINGS OF ROOTED TREES AND SKEW SHAPES VIA MONOID REPRESENTATIONS.
SPLIT GROTHENDIECK RINGS OF ROOTED TREES AND SKEW SHAPES VIA MONOID REPRESENTATIONS. DAVID BEERS AND MATT SZCZESNY ABSTRACT. We study commutative ring structures on the integral span of rooted trees and
More informationFundamental theorem of modules over a PID and applications
Fundamental theorem of modules over a PID and applications Travis Schedler, WOMP 2007 September 11, 2007 01 The fundamental theorem of modules over PIDs A PID (Principal Ideal Domain) is an integral domain
More informationCOMBINATORIAL LAPLACIAN OF THE MATCHING COMPLEX
COMBINATORIAL LAPLACIAN OF THE MATCHING COMPLEX XUN DONG AND MICHELLE L. WACHS Abstract. A striking result of Bouc gives the decomposition of the representation of the symmetric group on the homology of
More informationSOME DESIGNS AND CODES FROM L 2 (q) Communicated by Alireza Abdollahi
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 1 (2014), pp. 15-28. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir SOME DESIGNS AND CODES FROM
More informationSpectrally arbitrary star sign patterns
Linear Algebra and its Applications 400 (2005) 99 119 wwwelseviercom/locate/laa Spectrally arbitrary star sign patterns G MacGillivray, RM Tifenbach, P van den Driessche Department of Mathematics and Statistics,
More informationThe Singapore Copyright Act applies to the use of this document.
Title On graphs whose low polynomials have real roots only Author(s) Fengming Dong Source Electronic Journal of Combinatorics, 25(3): P3.26 Published by Electronic Journal of Combinatorics This document
More information