Scaffolds. A graph-based system for computations in Bose-Mesner algebras. William J. Martin
|
|
- Margaret Lambert
- 5 years ago
- Views:
Transcription
1 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 Jiao Tong University, Shanghai October 18, 2016
2 Introduction Exercises The Simplest All matrices here are square. Rows and columns are indexed by some finite set X. denotes the diagonal of matrix equals the trace of atrix N, as a second-order tensor, is represented as N The sum of all entries of N is N The ordinary matrix product of and N is encoded as a series reduction N Entrywise multiplication is a parallel reduction N.
3 Introduction Exercises Example X {1, 2, 3}, , N 0 1/3 1/3 1/3 0 1/3 0 1/3 0
4 Introduction Exercises Example X {1, 2, 3}, , N 0 1/3 1/3 1/3 0 1/3 0 1/3 0
5 Introduction Exercises Example X {1, 2, 3}, , N 0 1/3 1/3 1/3 0 1/3 0 1/3 0
6 Introduction Exercises Example X {1, 2, 3}, , N 0 1/3 1/3 1/3 0 1/3 0 1/3 0
7 Introduction Exercises Example X {1, 2, 3}, , N 0 1/3 1/3 1/3 0 1/3 0 1/3 0 N
8 Introduction Exercises Example X {1, 2, 3}, N /3 1/3 1/3 0 1/3 0 1/3 0, N 0 1/3 1/3 1/3 0 1/3 0 1/3 0
9 Introduction Exercises Example X {1, 2, 3}, N while /3 1/3 1/3 0 1/3 0 1/3 0 N, N 0 1/3 1/3 1/3 0 1/3 0 1/3 0
10 Introduction Exercises Example X {1, 2, 3}, N while /3 1/3 1/3 0 1/3 0 1/3 0 N 5/3, N 0 1/3 1/3 1/3 0 1/3 0 1/3 0
11 Introduction Exercises Example X {1, 2, 3}, N while N /3 1/3 1/3 0 1/3 0 1/3 0 N 5/3 But [ 1/3 2/3 2/3 ], N 0 1/3 1/3 1/3 0 1/3 0 1/3 0
12 Introduction Exercises Example, continued X {1, 2, 3}, , N 0 1/3 1/3 1/3 0 1/3 0 1/3 0 Products: N
13 Introduction Exercises Example, continued X {1, 2, 3}, , N 0 1/3 1/3 1/3 0 1/3 0 1/3 0 Products: N 1 1/3 1/3 /3 2 1/3 1 1/3 2 while N
14 Introduction Exercises Example, continued X {1, 2, 3}, , N 0 1/3 1/3 1/3 0 1/3 0 1/3 0 Products: N 1 1/3 1/3 /3 2 1/3 1 1/3 2 while N
15 Definition Association Schemes The Drumstick and the Wing Definition Let X be a finite set and let A be a subalgebra of at X (C). Suppose we are given A (di)graph G (V (G), E(G)) A subset R V (G) of red nodes, and a map from edges of G to matrices in A: w : E(G) A (edge weights) The scaffold S(G; R, w) is defined as the quantity S(G; R, w) ϕ:v (G) X e E(G) e(a,b) w(e) ϕ(a),ϕ(b) ϕ(r). This is an element of V R, so we say S(G; R, w) is a scaffold of order m R. r R
16 Definition Association Schemes The Drumstick and the Wing A New Piece of Terminology Why do I call them scaffolds? Others have referred to these as star-triangle diagrams. Terwilliger credits Arnold Neumaier for their introduction.
17 Definition Association Schemes The Drumstick and the Wing Definition, a bit more general... A at X (C) A (di)graph G (V (G), E(G)) A subset R V (G) of red nodes, and a map from edges of G to matrices in A: w : E(G) A (edge weights) a subset F V (G) of fixed nodes and a fixed function ψ : F X The scaffold S(G; R, w; F, ψ) is defined as the quantity S(G; R, w; F, ψ) ϕ:v (G) X ( a F )(ϕ(a)ψ(a)) e E(G) e(a,b) w(e) ϕ(a),ϕ(b) r R ϕ(r).
18 Definition Association Schemes The Drumstick and the Wing Basic Operations Deletion: J Contraction: I
19 Definition Association Schemes The Drumstick and the Wing Count Homomorphisms Example: If A is the adjacency matrix of a simple graph H, A A, and we take R and w(e) A for all e E(G), then S(G;, w) Hom(G, H) is the number of graph homomorphisms from G into H. For example, S(K 3 ;, A) A A A counts labelled triangles in H.
20 Definition Association Schemes The Drumstick and the Wing Partition Functions statistical mechanics graph theory E.g., Tutte polynomial is partition function of the Potts model Vaughan Jones: spin models (here X is a set of spins ) yield link invariants (w(e) W ± ) Triply Regular Association Scheme: A s T r,s,t i,j,k A i A r A k A t T r,s,t i,j,k A i A k A j A j
21 Definition Association Schemes The Drumstick and the Wing Algebra, Combinatorics and Knot Theory Donald Higman, Tatsuro Ito, and François Jaeger
22 Definition Association Schemes The Drumstick and the Wing Henceforth: A is a (Commutative) Bose-esner Algebra may be useful for other contexts, but for the rest of this talk, A is a Bose-esner algebra. Algebraically, a (commutative) association scheme is a vector space of matrices closed under ordinary multiplication, entrywise multiplication, and conjugate-transpose, and containing the identities, I and J, for both multiplications.
23 Definition Association Schemes The Drumstick and the Wing Commutative Association Schemes Combinatorially, an association scheme is an ordered pair (X, R) where X is a finite set and R {R 0,..., R d } is a partition of X into binary relations satisfying R contains the identity relation: R 0 {(a, a) a X } for each i, there is an i {0,..., d} such that R i R i {(b, a) (a, b) R i } there exist constants p k ij such that, whenever (a, b) R k, {c X (a, c) R i, (c, b) R j } p k ij p k ij pk ji
24 Definition Association Schemes The Drumstick and the Wing The Association Scheme of Symmetric Group S 3 X { (1), (12), (13), (23), (123), (132) } (1) (12) (1) (12) (123) (13) (123) (13) (132) (23) (132) (23) One Cayley graph for each conjugacy class C 0 {(1)}, C 1 {(12), (13), (23)}, C 2 {(123), (132)}
25 Definition Association Schemes The Drumstick and the Wing The Association Scheme of S 3 A , A , A
26 Definition Association Schemes The Drumstick and the Wing Two Bases for Bose-esner Algebra Schur idempotents {A 0, A 1,..., A d } (adjacency matrices) A i A j δ i,j A i d A i A j pij k A k k0 matrix idempotents {E 0, E 1,..., E d } (projections onto eigenspaces) E i E j δ i,j E i E i E j 1 d qij k E k X k0 where the structure constants q k ij are called Krein parameters and we know q k ij 0.
27 Definition Association Schemes The Drumstick and the Wing Definition, Specialized to Association Schemes Let (X, R) be an association scheme. Suppose we are given A (di)graph G (V (G), E(G)) A subset R V (G) of red nodes, and a map from edges of G to matrices in our Bose-esner algebra: w : E(G) A (edge weights) The scaffold S(G; R, w) is defined as the quantity S(G; R, w) ϕ:v (G) X e E(G) e(a,b) w(e) ϕ(a),ϕ(b) ϕ(r). r R
28 Definition Association Schemes The Drumstick and the Wing Fundamental Identities for Association Schemes 1) pij k 0 if and only if 0 A k A j A i 2) q k ij 0 if and only if E j 0 E i E k
29 Definition Association Schemes The Drumstick and the Wing The Drumstick Since E i E j 1 X d h0 qh ij E h we have (E i E j ) E k qk ij X E k. So E i E j E k E i E j E k qk E ij k X And this is zero whenever qij k 0. Our notation here implies that no edges of G are incident to the center node in the left diagram besides the three edges shown.
30 Definition Association Schemes The Drumstick and the Wing The Wing Dual to this is the following identity for intersection numbers: since ( d ) (A j A k ) A i pjk e A e A i pjk i A i, we have e0 A j A k A i A i p i jk
31 Isthmuses Dickie s Theorem: a j 0 implies a 1 0 Isthmus Lemma (Suzuki) Lemma Let (X, R) be a commutative association scheme. (I) If qjk e qe lm 0 for all e h, then E k El E m qh lm X E k E h E j E j (II) If qjk e qe lm 0 for all e h, then E k E l E k E h E l E j E m E j E m
32 Isthmuses Dickie s Theorem: a j 0 implies a 1 0 Suzuki Isthmus Lemma, Proof of (II): E k E l E k I E l E j E m E j E m d e0 E k E e E l E j E m E k E h E l E j E m
33 Isthmuses Dickie s Theorem: a j 0 implies a 1 0 Dual Isthmus Lemma Lemma Assume (X, R) is a commutative association scheme. (I) If p e hi pe jk 0 for all e l, then A i A k A i p l jk A l A h A j A h (II) If p e hi pe jk 0 for all e l, then A i A k A i A k A l A h A j A h A j
34 Isthmuses Dickie s Theorem: a j 0 implies a 1 0 P- and Q-Polynomial Schemes A (symmetric) association scheme (X, R) with relations {R i } is P-polynomial (or metric ) with respect to the ordering A 0,..., A d of its Schur idempotents if, with respect to this ordering, k > i + j p k ij 0 and k i + j p k ij 0
35 Isthmuses Dickie s Theorem: a j 0 implies a 1 0 P- and Q-Polynomial Schemes A (symmetric) association scheme (X, R) with relations {R i } is P-polynomial (or metric ) with respect to the ordering A 0,..., A d of its Schur idempotents if, with respect to this ordering, k > i + j p k ij 0 and k i + j p k ij 0 A (symmetric) association scheme (X, R) with primitive idempotents {E j } is Q-polynomial (or cometric ) with respect to the ordering E 0,..., E d if, with respect to this ordering, k > i + j q k ij 0 and k i + j q k ij 0
36 Isthmuses Dickie s Theorem: a j 0 implies a 1 0 Dickie s Theorem (1995, generalized by Suzuki 1998) Theorem (Dickie, Thm ) Suppose (X, R) is a cometric association scheme with Q-polynomial ordering E 0, E 1,..., E d. Write a j q j 1j. If 0 < j < d and a j 0, then a 1 0. Proof: 0 Ej Ej 0 X b j Ej since ( Ej+1)Ej qj 1,j+1 Ej X Ej Ej+1 Ej 0 X bj Ej+1 since q e j,1 q e 1,j+1 0 for any e j + 1 Ej Ej+1
37 Isthmuses Dickie s Theorem: a j 0 implies a 1 0 Proof, continued Ej So 0 Ej 1 Ej+1 since this is just a linear combination of zero terms. Ej+1 Ej This is the inner product of our tensor (which is zero) with E j 1 E 1, another tensor, order 3. E 1, Next, 0 Ej 1 Ej+1 Ej+1 since q e 1,j 1 q e 1,j+1 0 for any e j Ej
38 Isthmuses Dickie s Theorem: a j 0 implies a 1 0 Proof, continued Likewise, 0 Ej 1 Ej+1 since q e 1,j 1 q e 1,j+1 0 for any e j Ej+1 0 Ej 1 Ej+1 Ej+1 Using the entrywise product,. Now we expand E 1 E j 1 b j X E j + a j 1 X E j 1 + c j X E j and observe q1,j+1 e 0 for e < j. Since c j 0, we have 0 Ej Ej+1 Ej+1
39 Isthmuses Dickie s Theorem: a j 0 implies a 1 0 End of Sample Proof Ej 0 Ej+1 since q e 1,j q e 1,j+1 0 for any e j + 1 Ej Now we have a drumstick! Ej+1 and we know (E j E j+1 )E 1 q1 j,j+1 E 1 X with qj,j by the cometric property. So we have 0 So SU(E 1 E 1 E 1 ) 0 which tells us that q , or a 1 0.
40 Isthmuses Dickie s Theorem: a j 0 implies a 1 0 The End Thank You. Special thanks to Professor Eiichi Bannai, Professor Yaokun Wu, and to Yan Zhu.
Group fusion power of association schemes
Group fusion power of association schemes Shanghai Jiao Tong University jasonzd@sjtu.edu.cn Aug 7th, 2018, G2R2 @ Novosibirsk There is a written proof of every mathematical theorem, in Russian. I couldn
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 informationNur Hamid and Manabu Oura
Math. J. Okayama Univ. 61 (2019), 199 204 TERWILLIGER ALGEBRAS OF SOME GROUP ASSOCIATION SCHEMES Nur Hamid and Manabu Oura Abstract. The Terwilliger algebra plays an important role in the theory of association
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 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 informationTridiagonal pairs in algebraic graph theory
University of Wisconsin-Madison Contents Part I: The subconstituent algebra of a graph The adjacency algebra The dual adjacency algebra The subconstituent algebra The notion of a dual adjacency matrix
More informationApplication of the Representation Theory of Symmetric Groups for the Computation of Chromatic Polynomials of Graphs
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
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 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 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 informationTriply Regular Graphs
Triply Regular Graphs by Krystal J. Guo Simon Fraser University Burnaby, British Columbia, Canada, 2011 c Krystal J. Guo 2011 Abstract This project studies a regularity condition on graphs. A graph X
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 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 informationIr O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )
Section 3.2 Theorem 3.6. Let A be an m n matrix of rank r. Then r m, r n, and, by means of a finite number of elementary row and column operations, A can be transformed into the matrix ( ) Ir O D = 1 O
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 information1.10 Matrix Representation of Graphs
42 Basic Concepts of Graphs 1.10 Matrix Representation of Graphs Definitions: In this section, we introduce two kinds of matrix representations of a graph, that is, the adjacency matrix and incidence matrix
More informationThis section is an introduction to the basic themes of the course.
Chapter 1 Matrices and Graphs 1.1 The Adjacency Matrix This section is an introduction to the basic themes of the course. Definition 1.1.1. A simple undirected graph G = (V, E) consists of a non-empty
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 informationCharacterizations of Strongly Regular Graphs: Part II: Bose-Mesner algebras of graphs. Sung Y. Song Iowa State University
Characterizations of Strongly Regular Graphs: Part II: Bose-Mesner algebras of graphs Sung Y. Song Iowa State University sysong@iastate.edu Notation K: one of the fields R or C X: a nonempty finite set
More informationAUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS
AUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS MAX GOLDBERG Abstract. We explore ways to concisely describe circulant graphs, highly symmetric graphs with properties that are easier to generalize
More informationComplex Hadamard matrices and 3-class association schemes
Complex Hadamard matrices and 3-class association schemes Akihiro Munemasa 1 (joint work with Takuya Ikuta) 1 Graduate School of Information Sciences Tohoku University June 27, 2014 Algebraic Combinatorics:
More information3-Class Association Schemes and Hadamard Matrices of a Certain Block Form
Europ J Combinatorics (1998) 19, 943 951 Article No ej980251 3-Class Association Schemes and Hadamard Matrices of a Certain Block Form R W GOLDBACH AND H L CLAASEN We describe 3-class association schemes
More informationThe Hamming Codes and Delsarte s Linear Programming Bound
The Hamming Codes and Delsarte s Linear Programming Bound by Sky McKinley Under the Astute Tutelage of Professor John S. Caughman, IV A thesis submitted in partial fulfillment of the requirements for the
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 informationALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA
ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND
More informationSpectral Graph Theory and You: Matrix Tree Theorem and Centrality Metrics
Spectral Graph Theory and You: and Centrality Metrics Jonathan Gootenberg March 11, 2013 1 / 19 Outline of Topics 1 Motivation Basics of Spectral Graph Theory Understanding the characteristic polynomial
More informationCombinatorics of p-ary Bent Functions
Combinatorics of p-ary Bent Functions MIDN 1/C Steven Walsh United States Naval Academy 25 April 2014 Objectives Introduction/Motivation Definitions Important Theorems Main Results: Connecting Bent Functions
More informationLINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS
LINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F has characteristic zero. The following are facts (in
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 informationRepresentation Theory. Ricky Roy Math 434 University of Puget Sound
Representation Theory Ricky Roy Math 434 University of Puget Sound May 2, 2010 Introduction In our study of group theory, we set out to classify all distinct groups of a given order up to isomorphism.
More informationLinear algebra and applications to graphs Part 1
Linear algebra and applications to graphs Part 1 Written up by Mikhail Belkin and Moon Duchin Instructor: Laszlo Babai June 17, 2001 1 Basic Linear Algebra Exercise 1.1 Let V and W be linear subspaces
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 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 informationTheorems of Erdős-Ko-Rado type in polar spaces
Theorems of Erdős-Ko-Rado type in polar spaces Valentina Pepe, Leo Storme, Frédéric Vanhove Department of Mathematics, Ghent University, Krijgslaan 28-S22, 9000 Ghent, Belgium Abstract We consider Erdős-Ko-Rado
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 informationSection 3 Isomorphic Binary Structures
Section 3 Isomorphic Binary Structures Instructor: Yifan Yang Fall 2006 Outline Isomorphic binary structure An illustrative example Definition Examples Structural properties Definition and examples Identity
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 informationDeterminants. Copyright c 2012 Dan Nettleton (Iowa State University) Statistics / 25
Determinants opyright c 2012 Dan Nettleton (Iowa State University) Statistics 611 1 / 25 Notation The determinant of a square matrix n n A is denoted det(a) or A. opyright c 2012 Dan Nettleton (Iowa State
More informationThe rank of connection matrices and the dimension of graph algebras
The rank of connection matrices and the dimension of graph algebras László Lovász Microsoft Research One Microsoft Way Redmond, WA 98052 August 2004 Microsoft Research Technical Report TR-2004-82 Contents
More informationTHIS paper is an extended version of the paper [1],
INTERNATIONAL JOURNAL OF MATHEMATICAL MODELS AND METHODS IN APPLIED SCIENCES Volume 8 04 Alternating Schur Series and Necessary Conditions for the Existence of Strongly Regular Graphs Vasco Moço Mano and
More informationLatin squares: Equivalents and equivalence
Latin squares: Equivalents and equivalence 1 Introduction This essay describes some mathematical structures equivalent to Latin squares and some notions of equivalence of such structures. According to
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 informationProblems in Linear Algebra and Representation Theory
Problems in Linear Algebra and Representation Theory (Most of these were provided by Victor Ginzburg) The problems appearing below have varying level of difficulty. They are not listed in any specific
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 informationStrongly Regular Decompositions of the Complete Graph
Journal of Algebraic Combinatorics, 17, 181 201, 2003 c 2003 Kluwer Academic Publishers. Manufactured in The Netherlands. Strongly Regular Decompositions of the Complete Graph EDWIN R. VAN DAM Edwin.vanDam@uvt.nl
More informationLeonard triples of q-racah type
University of Wisconsin-Madison Overview This talk concerns a Leonard triple A, B, C of q-racah type. We will describe this triple, using three invertible linear maps called W, W, W. As we will see, 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 informationThe spectra of super line multigraphs
The spectra of super line multigraphs Jay Bagga Department of Computer Science Ball State University Muncie, IN jbagga@bsuedu Robert B Ellis Department of Applied Mathematics Illinois Institute of Technology
More informationON COST MATRICES WITH TWO AND THREE DISTINCT VALUES OF HAMILTONIAN PATHS AND CYCLES
ON COST MATRICES WITH TWO AND THREE DISTINCT VALUES OF HAMILTONIAN PATHS AND CYCLES SANTOSH N. KABADI AND ABRAHAM P. PUNNEN Abstract. Polynomially testable characterization of cost matrices associated
More informationOn the ideal of the shortest vectors in the Leech lattice and other lattices
On the ideal of the shortest vectors in the Leech lattice and other lattices William J. Martin Corre L. Steele Department of Mathematical Sciences Worcester Polytechnic Institute Worcester, Massachusetts
More informationNotes. Relations. Introduction. Notes. Relations. Notes. Definition. Example. Slides by Christopher M. Bourke Instructor: Berthe Y.
Relations Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 7.1, 7.3 7.5 of Rosen cse235@cse.unl.edu
More informationTechnische Universität München, Zentrum Mathematik Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik. Combinatorial Optimization (MA 4502)
Technische Universität München, Zentrum Mathematik Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik Combinatorial Optimization (MA 4502) Dr. Michael Ritter Problem Sheet 1 Homework Problems Exercise
More informationAlgorithmic Approach to Non-symmetric 3-class Association Schemes
Algorithmic Approach to Non-symmetric 3-class Association Schemes Leif K. Jørgensen Dept. of Mathematical Sciences, Aalborg University Fr. Bajers Vej 7, 9220 Aalborg, Denmark. leif@math.aau.dk Summary.
More informationAlgebra I Fall 2007
MIT OpenCourseWare http://ocw.mit.edu 18.701 Algebra I Fall 007 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.701 007 Geometry of the Special Unitary
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 informationStrongly regular graphs and Borsuk s conjecture
Seminar talk Department of Mathematics, Shanghai Jiao Tong University Strongly regular graphs and Borsuk s conjecture Andriy Bondarenko Norwegian University of Science and Technology and National Taras
More information22m:033 Notes: 7.1 Diagonalization of Symmetric Matrices
m:33 Notes: 7. Diagonalization of Symmetric Matrices Dennis Roseman University of Iowa Iowa City, IA http://www.math.uiowa.edu/ roseman May 3, Symmetric matrices Definition. A symmetric matrix is a matrix
More informationNOTES ON DIFFERENTIAL FORMS. PART 3: TENSORS
NOTES ON DIFFERENTIAL FORMS. PART 3: TENSORS 1. What is a tensor? Let V be a finite-dimensional vector space. 1 It could be R n, it could be the tangent space to a manifold at a point, or it could just
More informationDISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS
DISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS M. N. ELLINGHAM AND JUSTIN Z. SCHROEDER In memory of Mike Albertson. Abstract. A distinguishing partition for an action of a group Γ on a set
More informationContents. Preface for the Instructor. Preface for the Student. xvii. Acknowledgments. 1 Vector Spaces 1 1.A R n and C n 2
Contents Preface for the Instructor xi Preface for the Student xv Acknowledgments xvii 1 Vector Spaces 1 1.A R n and C n 2 Complex Numbers 2 Lists 5 F n 6 Digression on Fields 10 Exercises 1.A 11 1.B Definition
More informationRelations Graphical View
Introduction Relations Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Recall that a relation between elements of two sets is a subset of their Cartesian
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 informationIntriguing sets of vertices of regular graphs
Intriguing sets of vertices of regular graphs Bart De Bruyn and Hiroshi Suzuki February 18, 2010 Abstract Intriguing and tight sets of vertices of point-line geometries have recently been studied in the
More information7 Matrix Operations. 7.0 Matrix Multiplication + 3 = 3 = 4
7 Matrix Operations Copyright 017, Gregory G. Smith 9 October 017 The product of two matrices is a sophisticated operations with a wide range of applications. In this chapter, we defined this binary operation,
More informationContractors and connectors of graph algebras
Contractors and connectors of graph algebras László Lovász and Balázs Szegedy Microsoft Research One Microsoft Way April 2005; revised August 2005 Abstract We study generalizations of the contraction-deletion
More information(Ref: Schensted Part II) If we have an arbitrary tensor with k indices W i 1,,i k. we can act on it 1 2 k with a permutation P = = w ia,i b,,i l
Chapter S k and Tensor Representations Ref: Schensted art II) If we have an arbitrary tensor with k indices W i,,i k ) we can act on it k with a permutation = so a b l w) i,i,,i k = w ia,i b,,i l. Consider
More informationAn Introduction to Algebraic Graph Theory
An Introduction to Algebraic Graph Theory Rob Beezer beezer@ups.edu Department of Mathematics and Computer Science University of Puget Sound Mathematics Department Seminar Pacific University October 9,
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 informationStrongly regular graphs and the Higman-Sims group. Padraig Ó Catháin National University of Ireland, Galway. June 14, 2012
Strongly regular graphs and the Higman-Sims group Padraig Ó Catháin National University of Ireland, Galway. June 14, 2012 We introduce some well known results about permutation groups, strongly regular
More informationMATRIX LIE GROUPS AND LIE GROUPS
MATRIX LIE GROUPS AND LIE GROUPS Steven Sy December 7, 2005 I MATRIX LIE GROUPS Definition: A matrix Lie group is a closed subgroup of Thus if is any sequence of matrices in, and for some, then either
More informationDifference sets and Hadamard matrices
Difference sets and Hadamard matrices Padraig Ó Catháin National University of Ireland, Galway 14 March 2012 Outline 1 (Finite) Projective planes 2 Symmetric Designs 3 Difference sets 4 Doubly transitive
More informationDetailed Proof of The PerronFrobenius Theorem
Detailed Proof of The PerronFrobenius Theorem Arseny M Shur Ural Federal University October 30, 2016 1 Introduction This famous theorem has numerous applications, but to apply it you should understand
More informationDesign theory from the viewpoint of algebraic combinatorics
Design theory from the viewpoint of algebraic combinatorics Eiichi Bannai Shanghai Jiao Tong University May 27, 2017, at 9SHCC This talk is based on the paper: Eiichi Bannai, Etsuko Bannai, Hajime Tanaka,
More informationMath 42, Discrete Mathematics
c Fall 2018 last updated 12/05/2018 at 15:47:21 For use by students in this class only; all rights reserved. Note: some prose & some tables are taken directly from Kenneth R. Rosen, and Its Applications,
More informationNotes on the Matrix-Tree theorem and Cayley s tree enumerator
Notes on the Matrix-Tree theorem and Cayley s tree enumerator 1 Cayley s tree enumerator Recall that the degree of a vertex in a tree (or in any graph) is the number of edges emanating from it We will
More informationDelsarte s linear programming bound
15-859 Coding Theory, Fall 14 December 5, 2014 Introduction For all n, q, and d, Delsarte s linear program establishes a series of linear constraints that every code in F n q with distance d must satisfy.
More informationSubconstituent algebras of Latin squares
University of South Florida Scholar Commons Graduate Theses and Dissertations Graduate School 2008 Subconstituent algebras of Latin squares Ibtisam Daqqa University of South Florida Follow this and additional
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 informationRepresentations of algebraic groups and their Lie algebras Jens Carsten Jantzen Lecture III
Representations of algebraic groups and their Lie algebras Jens Carsten Jantzen Lecture III Lie algebras. Let K be again an algebraically closed field. For the moment let G be an arbitrary algebraic group
More informationFORBIDDEN MINORS FOR THE CLASS OF GRAPHS G WITH ξ(g) 2. July 25, 2006
FORBIDDEN MINORS FOR THE CLASS OF GRAPHS G WITH ξ(g) 2 LESLIE HOGBEN AND HEIN VAN DER HOLST July 25, 2006 Abstract. For a given simple graph G, S(G) is defined to be the set of real symmetric matrices
More informationQuivers of Period 2. Mariya Sardarli Max Wimberley Heyi Zhu. November 26, 2014
Quivers of Period 2 Mariya Sardarli Max Wimberley Heyi Zhu ovember 26, 2014 Abstract A quiver with vertices labeled from 1,..., n is said to have period 2 if the quiver obtained by mutating at 1 and then
More informationLinear Algebra. Workbook
Linear Algebra Workbook Paul Yiu Department of Mathematics Florida Atlantic University Last Update: November 21 Student: Fall 2011 Checklist Name: A B C D E F F G H I J 1 2 3 4 5 6 7 8 9 10 xxx xxx xxx
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 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 informationKnots and Physics. Lifang Xia. Dec 12, 2012
Knots and Physics Lifang Xia Dec 12, 2012 Knot A knot is an embedding of the circle (S 1 ) into three-dimensional Euclidean space (R 3 ). Reidemeister Moves Equivalent relation of knots with an ambient
More informationIntrinsic products and factorizations of matrices
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 5 3 www.elsevier.com/locate/laa Intrinsic products and factorizations of matrices Miroslav Fiedler Academy of Sciences
More informationA diagrammatic representation of the Temperley Lieb algebra. Dana C. Ernst
A diagrammatic representation of the Temperley Lieb algebra Dana C. Ernst Plymouth State University Department of Mathematics http://oz.plymouth.edu/~dcernst HRUMC 2010 April 17, 2010 D.C. Ernst Counting
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 informationReal symmetric matrices/1. 1 Eigenvalues and eigenvectors
Real symmetric matrices 1 Eigenvalues and eigenvectors We use the convention that vectors are row vectors and matrices act on the right. Let A be a square matrix with entries in a field F; suppose that
More informationCOMMUTATIVE ASSOCIATION SCHEMES
COMMUTATIVE ASSOCIATION SCHEMES WILLIAM J. MARTIN AND HAJIME TANAKA Abstract. Association schemes were originally introduced by Bose and his co-workers in the design of statistical experiments. Since that
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 informationArrangements, matroids and codes
Arrangements, matroids and codes first lecture Ruud Pellikaan joint work with Relinde Jurrius ACAGM summer school Leuven Belgium, 18 July 2011 References 2/43 1. Codes, arrangements and matroids by Relinde
More informationDirected Strongly Regular Graphs. Leif K. Jørgensen Aalborg University Denmark
Directed Strongly Regular Graphs Leif K. Jørgensen Aalborg University Denmark A. Duval 1988: A directed strongly regular graph with parameters v, k, t, λ, µ is a directed graph with the following properties:
More informationarxiv: v2 [math.co] 18 Dec 2007
TUTTE CHROMATIC IDENTITIES FROM THE TEMPERLEY-LIEB ALGEBRA arxiv:0711.0016v2 [math.co] 18 Dec 2007 PAUL FENDLEY 1 AND VYACHESLAV KRUSHKAL 2 Abstract. One remarkable feature of the chromatic polynomial
More informationQuantum Computing Lecture 2. Review of Linear Algebra
Quantum Computing Lecture 2 Review of Linear Algebra Maris Ozols Linear algebra States of a quantum system form a vector space and their transformations are described by linear operators Vector spaces
More informationAn Introduction to Transversal Matroids
An Introduction to Transversal Matroids Joseph E Bonin The George Washington University These slides and an accompanying expository paper (in essence, notes for this talk, and more) are available at http://homegwuedu/
More informationx y = x + y. For example, the tropical sum 4 9 = 4, and the tropical product 4 9 = 13.
Comment: Version 0.1 1 Introduction Tropical geometry is a relatively new area in mathematics. Loosely described, it is a piece-wise linear version of algebraic geometry, over a particular structure known
More informationINTRODUCTION TO REPRESENTATION THEORY AND CHARACTERS
INTRODUCTION TO REPRESENTATION THEORY AND CHARACTERS HANMING ZHANG Abstract. In this paper, we will first build up a background for representation theory. We will then discuss some interesting topics in
More informationCHARACTERISTIC CLASSES
1 CHARACTERISTIC CLASSES Andrew Ranicki Index theory seminar 14th February, 2011 2 The Index Theorem identifies Introduction analytic index = topological index for a differential operator on a compact
More information