Group theoretic aspects of the theory of association schemes
|
|
- Oswin Whitehead
- 5 years ago
- Views:
Transcription
1 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 Anhui University A. Munemasa (Tohoku University) association schemes Hefei / 18
2 Association schemes Bannai and Ito, Algebraic Combinatorics I (1984). P- and Q-polynomial schemes A. Munemasa (Tohoku University) association schemes Hefei / 18
3 Association schemes Bannai and Ito, Algebraic Combinatorics I (1984). P- and Q-polynomial schemes designs and codes (Delsarte theory) A. Munemasa (Tohoku University) association schemes Hefei / 18
4 Association schemes Bannai and Ito, Algebraic Combinatorics I (1984). P- and Q-polynomial schemes designs and codes (Delsarte theory) spherical designs A. Munemasa (Tohoku University) association schemes Hefei / 18
5 Association schemes Bannai and Ito, Algebraic Combinatorics I (1984). P- and Q-polynomial schemes Terwilliger algebras designs and codes (Delsarte theory) spherical designs A. Munemasa (Tohoku University) association schemes Hefei / 18
6 Association schemes Bannai and Ito, Algebraic Combinatorics I (1984). P- and Q-polynomial schemes Terwilliger algebras designs and codes (Delsarte theory) SDP spherical designs A. Munemasa (Tohoku University) association schemes Hefei / 18
7 Association schemes Bannai and Ito, Algebraic Combinatorics I (1984). P- and Q-polynomial schemes Terwilliger algebras designs and codes (Delsarte theory) SDP spherical designs Euclidean designs A. Munemasa (Tohoku University) association schemes Hefei / 18
8 Permutation representations association scheme multiplicity-free permutation representation ordinary representation theory A. Munemasa (Tohoku University) association schemes Hefei / 18
9 Permutation representations association scheme multiplicity-free permutation representation ordinary representation theory inequivalent permutation representations which are equivalent as representations A. Munemasa (Tohoku University) association schemes Hefei / 18
10 Permutation representations association scheme multiplicity-free permutation representation ordinary representation theory inequivalent permutation representations which are equivalent as representations (like cospectral graphs) A. Munemasa (Tohoku University) association schemes Hefei / 18
11 Permutation representations association scheme multiplicity-free permutation representation ordinary representation theory inequivalent permutation representations which are equivalent as representations (like cospectral graphs) ordinary representation centralizer = algebra permutation representation combinatorial object A. Munemasa (Tohoku University) association schemes Hefei / 18
12 Centralizer Multiplicity-free permutation representation of a finite group G acting on a set X centralizer algebra has a basis consisting of (0, 1)-matrices A 0 = I, A 1,..., A d with d A i = J. i=0 These matrices represent orbitals: X X = d i=0 R i (G-orbits). A. Munemasa (Tohoku University) association schemes Hefei / 18
13 Association scheme Since it is a basis of an algebra, A i A j = d pija k k. (1) k=0 {A 0 = I, A 1,..., A d } = {A 0 = I, A 1,..., A d }. (2) This allows one to forget the group G to define an association scheme: (X, {R i } d i=0 ); where we require the matrices representing the partition {R i } d i=0 of X X satisfy (1) and (2). A. Munemasa (Tohoku University) association schemes Hefei / 18
14 Association scheme Since it is a basis of an algebra, A i A j = d pija k k. (1) k=0 {A 0 = I, A 1,..., A d } = {A 0 = I, A 1,..., A d }. (2) This allows one to forget the group G to define an association scheme: (X, {R i } d i=0 ); where we require the matrices representing the partition {R i } d i=0 of X X satisfy (1) and (2). multiplicity-free = commutative. A. Munemasa (Tohoku University) association schemes Hefei / 18
15 Krein parameters q k ij 0 Multiplicity-free permutation representation of a finite group G acting on a set X has centralizer algebra A = A 0 = I, A 1,..., A d V = C X = L(X ) decomposes as C[G]-module: V = V 0 V 1 V d V 0 =constant. The orthogonal projections E i : V V i form another basis of A, so E i E j = 1 X d qij k E k. i=0 A. Munemasa (Tohoku University) association schemes Hefei / 18
16 Scott s theorem V = V 0 V 1 V d, θ = χ 0 + χ χ d permutation character E i : V V i : the orthogonal projection, E i E j = 1 X Theorem (Scott (1977)) q k ij 0 = (χ i χ j, χ k ) 0. d qij k E k. i=0 A. Munemasa (Tohoku University) association schemes Hefei / 18
17 q k ij 0 = (χ i χ j, χ k ) 0 Problem (Bannai and Ito, p.130) To what extent is the converse of Scott s theorem true? A counterexample: Ind S 2n S n S n (Johnson scheme J(2n, n)). A. Munemasa (Tohoku University) association schemes Hefei / 18
18 q k ij 0 = (χ i χ j, χ k ) 0 Problem (Bannai and Ito, p.130) To what extent is the converse of Scott s theorem true? A counterexample: Ind S 2n S n S n (Johnson scheme J(2n, n)). But this is imprimitive: S n S n S n S 2 S 2n. A. Munemasa (Tohoku University) association schemes Hefei / 18
19 q k ij 0 = (χ i χ j, χ k ) 0 Problem (Bannai and Ito, p.130) To what extent is the converse of Scott s theorem true? A counterexample: Ind S 2n S n S n (Johnson scheme J(2n, n)). But this is imprimitive: S n S n S n S 2 S 2n. Is there a primitive counterexample? A. Munemasa (Tohoku University) association schemes Hefei / 18
20 q k ij = 0 but (χ i χ j, χ k ) 0? The primitive counterexample of the smallest degree is of degree 66. G = PGL(2, 11) acting on PGL(2, 11)/D 20 A. Munemasa (Tohoku University) association schemes Hefei / 18
21 Eigenvalues of association schemes Multiplicity-free permutation representation of a finite group G acting on a set X = G/H has centralizer algebra A = A 0 = I, A 1,..., A d V = C X = L(X ) decomposes as C[G]-module: V = V 0 V 1 V d V 0 =constant. A i acts on V j as a scalar: 1 H g Ha i H χ j (g). A. Munemasa (Tohoku University) association schemes Hefei / 18
22 Eigenvalues of association schemes Multiplicity-free permutation representation of a finite group G acting on a set X = G/H has centralizer algebra A = A 0 = I, A 1,..., A d Eigenvalues of A i are { 1 H g Ha i H χ j (g) 0 j d} Q(exp 2π 1 e(g) ). where e(g) is the exponent of G. A. Munemasa (Tohoku University) association schemes Hefei / 18
23 Splitting fields of association schemes Question (Bannai and Ito, p.123) Are there any association schemes in which eigenvalues of A i s are not all in a cyclotomic number field? By the Kronecker Weber theorem, this is equivalent to ask whether the Galois group of the splitting field of the characteristic polynomial of A i is abelian. Theorem (M. (1991), Coste Gannon (1994)) If q k ij Q, then eigenvalues of A i s are in a cyclotomic number field. A. Munemasa (Tohoku University) association schemes Hefei / 18
24 Unlike the converse to Scott s theorem, the question: Question (Bannai and Ito, p.123) Are there any association schemes in which eigenvalues of A i s are not all in a cyclotomic number field? makes sense for non-commutative association schemes as well. A. Munemasa (Tohoku University) association schemes Hefei / 18
25 Splitting fields of association schemes Let A = A 0 = I, A 1,..., A d be an algebra spanned by disjoint (0, 1)-matrices. 1 A is the centralizer of a multiplicity-free permutation representation, then the formula for spherical functions implies that eigenvalues of A i s are cyclotomic. 2 Bannai Ito asks: the same holds if A is commutative (without group action)? 3 A is the centralizer of a non-multiplicity-free permutation representation, then this is not true. A. Munemasa (Tohoku University) association schemes Hefei / 18
26 Non-multiplicity-free permutation group A. Ryba and S. Smith: of degree 165. G = PGL(2, 11) acting on PGL(2, 11)/D 8 A. Munemasa (Tohoku University) association schemes Hefei / 18
27 Non-multiplicity-free permutation group A. Ryba and S. Smith: G = PGL(2, 11) acting on PGL(2, 11)/D 8 of degree 165 imprimitive. qij k = 0 but (χ i χ j, χ k ) 0? The primitive example of the smallest degree is G = PGL(2, 11) acting on PGL(2, 11)/D 20 of degree 66. A. Munemasa (Tohoku University) association schemes Hefei / 18
28 Non-cyclotomic numbers 3 = e π 1/6 + e π 1/6 A. Munemasa (Tohoku University) association schemes Hefei / 18
29 Non-cyclotomic numbers 3 = e π 1/6 + e π 1/6 4 3 / cyclotomic field A. Munemasa (Tohoku University) association schemes Hefei / 18
30 Non-cyclotomic numbers 3 = e π 1/6 + e π 1/6 If 4 3 / cyclotomic field has an irrational eigenvalue, then A is likely to have a non-cyclotomic eigenvalue. A 2 A. Munemasa (Tohoku University) association schemes Hefei / 18
31 Non-cyclotomic numbers 3 = e π 1/6 + e π 1/6 If A 2 ci 4 3 / cyclotomic field (distance-2 graph) has an irrational eigenvalue, then A is likely to have a non-cyclotomic eigenvalue. A. Munemasa (Tohoku University) association schemes Hefei / 18
32 Non-multiplicity-free permutation group A. Ryba and S. Smith: G = PGL(2, 11) acting on PGL(2, 11)/D 24 has as an eigenvalue, which is a bipartite half of a bipartite 3-regular graph (flag-transitive incidence structure) on vertices. A. Munemasa (Tohoku University) association schemes Hefei / 18
33 Non-multiplicity-free permutation group A. Ryba and S. Smith: G = PGL(2, 11) acting on PGL(2, 11)/D 24 has as an eigenvalue, which is a bipartite half of a bipartite 3-regular graph (flag-transitive incidence structure) on vertices. = is an eigenvalue of A 2 A. Munemasa (Tohoku University) association schemes Hefei / 18
34 Non-multiplicity-free permutation group A. Ryba and S. Smith: G = PGL(2, 11) acting on PGL(2, 11)/D 24 has as an eigenvalue, which is a bipartite half of a bipartite 3-regular graph (flag-transitive incidence structure) on vertices. = is an eigenvalue of A 2 = is an eigenvalue of A A. Munemasa (Tohoku University) association schemes Hefei / 18
35 Non-multiplicity-free permutation group A. Ryba and S. Smith: G = PGL(2, 11) acting on PGL(2, 11)/D 24 has as an eigenvalue, which is a bipartite half of a bipartite 3-regular graph (flag-transitive incidence structure) on vertices. = is an eigenvalue of A 2 = is an eigenvalue of A = is an eigenvalue of the line graph (G acts transitively, imprimitively). A. Munemasa (Tohoku University) association schemes Hefei / 18
36 Primitive counterexample 1 The smallest primitive group with non-cyclotomic eigenvalue is PSL(2, 19)/D The smallest (imprimitive) transitive group with non-cyclotomic eigenvalue is of degree 32 (due to classification of association schemes by Hanaki). 3 Hanaki and Uno (2006). Even for a prime number of points, the question is unsettled. Thank you for your attention! A. Munemasa (Tohoku University) association schemes Hefei / 18
Butson-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 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 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 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 informationBinary codes of t-designs and Hadamard matrices
Binary codes of t-designs and Hadamard matrices Akihiro Munemasa 1 1 Graduate School of Information Sciences Tohoku University November 8, 2013 JSPS-DST Asian Academic Seminar 2013 Discrete Mathematics
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 informationOriented covers of the triangular graphs
Oriented covers of the triangular graphs Akihiro Munemasa Tohoku University (joint work with Keiji Ito) March 30, 2018 Beijing Normal University A. Munemasa Triangular graphs March 30, 2018 1 / 23 Contents
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 informationAlgebra Exam Topics. Updated August 2017
Algebra Exam Topics Updated August 2017 Starting Fall 2017, the Masters Algebra Exam will have 14 questions. Of these students will answer the first 8 questions from Topics 1, 2, and 3. They then have
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 informationALGEBRAIC COMBINATORICS. c1993 C. D. Godsil
ALGEBRAIC COMBINATORICS c1993 C. D. Godsil To Gillian Preface There are people who feel that a combinatorial result should be given a \purely combinatorial" proof, but I am not one of them. For me the
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 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 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 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 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 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 informationSpherical designs and some generalizations : An overview
Spherical designs and some generalizations : An overview Eiichi Bannai Shanghai Jiao Tong University 2015 April 21 Workshop on spherical designs and numerical analysis Shanghai, China Spherical t-designs
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 informationDepartment of Mathematics, University of California, Berkeley
ALGORITHMIC GALOIS THEORY Hendrik W. Lenstra jr. Mathematisch Instituut, Universiteit Leiden Department of Mathematics, University of California, Berkeley K = field of characteristic zero, Ω = algebraically
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 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 informationLinear, Quadratic, and Cubic Forms over the Binary Field
Linear, Quadratic, and Cubic Forms over the Binary Field Akihiro Munemasa 1 1 Graduate School of Information Sciences Tohoku University October 28, 2009 POSTECH Linear, Quadratic, and Cubic Forms over
More informationVertex subsets with minimal width and dual width
Vertex subsets with minimal width and dual width in Q-polynomial distance-regular graphs University of Wisconsin & Tohoku University February 2, 2011 Every face (or facet) of a hypercube is a hypercube...
More informationAn algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings
Also available at http://amc-journal.eu ISSN 855-3966 (printed edn.), ISSN 855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 2 (207) 205 27 An algebraic proof of the Erdős-Ko-Rado theorem for intersecting
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 informationApplicable Analysis and Discrete Mathematics available online at GRAPHS WITH TWO MAIN AND TWO PLAIN EIGENVALUES
Applicable Analysis and Discrete Mathematics available online at http://pefmath.etf.rs Appl. Anal. Discrete Math. 11 (2017), 244 257. https://doi.org/10.2298/aadm1702244h GRAPHS WITH TWO MAIN AND TWO PLAIN
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 informationOn non-bipartite distance-regular graphs with valency k and smallest eigenvalue not larger than k/2
On non-bipartite distance-regular graphs with valency k and smallest eigenvalue not larger than k/2 J. Koolen School of Mathematical Sciences USTC (Based on joint work with Zhi Qiao) CoCoA, July, 2015
More informationCURRICULUM VITAE Tatsuro Ito
CURRICULUM VITAE Tatsuro Ito Personal Details Date of Birth: 25 October 1948 Nationality: Japanese Office: School of Mathematical Sciences, Anhui University, 111 Jiulong Road, Hefei 230601, China tel:
More informationIntro to harmonic analysis on groups Risi Kondor
Risi Kondor Any (sufficiently smooth) function f on the unit circle (equivalently, any 2π periodic f ) can be decomposed into a sum of sinusoidal waves f(x) = k= c n e ikx c n = 1 2π f(x) e ikx dx 2π 0
More informationGalois Theory TCU Graduate Student Seminar George Gilbert October 2015
Galois Theory TCU Graduate Student Seminar George Gilbert October 201 The coefficients of a polynomial are symmetric functions of the roots {α i }: fx) = x n s 1 x n 1 + s 2 x n 2 + + 1) n s n, where s
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 informationOhio s Learning Standards-Extended. Mathematics. The Real Number System Complexity a Complexity b Complexity c
Ohio s Learning Standards-Extended Mathematics The Real Number System Complexity a Complexity b Complexity c Extend the properties of exponents to rational exponents N.RN.1 Explain how the definition of
More informationSome parametric inequalities on strongly regular graphs spectra
INTERNATIONAL JOURNAL OF PURE MATHEMATICS Volume 3, 06 Some parametric inequalities on strongly regular graphs spectra Vasco Moço Mano and Luís de Almeida Vieira Email: vascomocomano@gmailcom Faculty of
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 informationList of topics for the preliminary exam in algebra
List of topics for the preliminary exam in algebra 1 Basic concepts 1. Binary relations. Reflexive, symmetric/antisymmetryc, and transitive relations. Order and equivalence relations. Equivalence classes.
More informationGroup 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 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 informationRank 3 permutation groups
Rank 3 permutation groups Michael Giudici joint work with Alice Devillers, Cai Heng Li, Geoffrey Pearce and Cheryl Praeger Centre for the Mathematics of Symmetry and Computation Twenty-Ninth Annual Victorian
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 informationFamily Feud Review. Linear Algebra. October 22, 2013
Review Linear Algebra October 22, 2013 Question 1 Let A and B be matrices. If AB is a 4 7 matrix, then determine the dimensions of A and B if A has 19 columns. Answer 1 Answer A is a 4 19 matrix, while
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 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 informationECS130 Scientific Computing. Lecture 1: Introduction. Monday, January 7, 10:00 10:50 am
ECS130 Scientific Computing Lecture 1: Introduction Monday, January 7, 10:00 10:50 am About Course: ECS130 Scientific Computing Professor: Zhaojun Bai Webpage: http://web.cs.ucdavis.edu/~bai/ecs130/ Today
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 informationHAMILTONICITY OF VERTEX-TRANSITIVE GRAPHS
HAMILTONICITY OF VERTEX-TRANSITIVE GRAPHS University of Primorska & University of Ljubljana June, 2011 Announcing two opening positions at UP Famnit / Pint in 2011/12 Young Research position = PhD Grant
More informationOpen Questions in Coding Theory
Open Questions in Coding Theory Steven T. Dougherty July 4, 2013 Open Questions The following questions were posed by: S.T. Dougherty J.L. Kim P. Solé J. Wood Hilbert Style Problems Hilbert Style Problems
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 informationJanuary 2016 Qualifying Examination
January 2016 Qualifying Examination If you have any difficulty with the wording of the following problems please contact the supervisor immediately. All persons responsible for these problems, in principle,
More informationExercises on chapter 4
Exercises on chapter 4 Always R-algebra means associative, unital R-algebra. (There are other sorts of R-algebra but we won t meet them in this course.) 1. Let A and B be algebras over a field F. (i) Explain
More informationAlgebra Questions. May 13, Groups 1. 2 Classification of Finite Groups 4. 3 Fields and Galois Theory 5. 4 Normal Forms 9
Algebra Questions May 13, 2013 Contents 1 Groups 1 2 Classification of Finite Groups 4 3 Fields and Galois Theory 5 4 Normal Forms 9 5 Matrices and Linear Algebra 10 6 Rings 11 7 Modules 13 8 Representation
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 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 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 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 informationQuantum wires, orthogonal polynomials and Diophantine approximation
Quantum wires, orthogonal polynomials and Diophantine approximation Introduction Quantum Mechanics (QM) is a linear theory Main idea behind Quantum Information (QI): use the superposition principle of
More informationAbstract Algebra Study Sheet
Abstract Algebra Study Sheet This study sheet should serve as a guide to which sections of Artin will be most relevant to the final exam. When you study, you may find it productive to prioritize the definitions,
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 informationarxiv: v1 [math.co] 2 Aug 2013
The Erdős-Ko-Rado property for some 2-transitive groups arxiv:1308.0621v1 [math.co] 2 Aug 2013 Abstract Bahman Ahmadi, Karen Meagher 1, Department of Mathematics and Statistics, University of Regina, 3737
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 informationFIELD THEORY. Contents
FIELD THEORY MATH 552 Contents 1. Algebraic Extensions 1 1.1. Finite and Algebraic Extensions 1 1.2. Algebraic Closure 5 1.3. Splitting Fields 7 1.4. Separable Extensions 8 1.5. Inseparable Extensions
More informationZero-Sum Flows in Regular Graphs
Zero-Sum Flows in Regular Graphs S. Akbari,5, A. Daemi 2, O. Hatami, A. Javanmard 3, A. Mehrabian 4 Department of Mathematical Sciences Sharif University of Technology Tehran, Iran 2 Department of Mathematics
More informationA Block Negacyclic Bush-Type Hadamard Matrix and Two Strongly Regular Graphs
Journal of Combinatorial Theory, Series A 98, 118 126 (2002) doi:10.1006/jcta.2001.3231, available online at http://www.idealibrary.com on A Block Negacyclic Bush-Type Hadamard Matrix and Two Strongly
More informationSolutions for Problem Set 6
Solutions for Problem Set 6 A: Find all subfields of Q(ζ 8 ). SOLUTION. All subfields of K must automatically contain Q. Thus, this problem concerns the intermediate fields for the extension K/Q. In a
More informationSome Extremal Self-Dual Codes and Unimodular Lattices in Dimension 40
Some Extremal Self-Dual Codes and Unimodular Lattices in Dimension 40 Stefka Bouyuklieva, Iliya Bouyukliev and Masaaki Harada October 17, 2012 Abstract In this paper, binary extremal singly even self-dual
More informationSolutions to Example Sheet 1
Solutions to Example Sheet 1 1 The symmetric group S 3 acts on R 2, by permuting the vertices of an equilateral triangle centered at 0 Choose a basis of R 2, and for each g S 3, write the matrix of g in
More informationQuasi-cyclic codes. Jay A. Wood. Algebra for Secure and Reliable Communications Modeling Morelia, Michoacán, Mexico October 12, 2012
Quasi-cyclic codes Jay A. Wood Department of Mathematics Western Michigan University http://homepages.wmich.edu/ jwood/ Algebra for Secure and Reliable Communications Modeling Morelia, Michoacán, Mexico
More informationOn some combinatorial aspects of Representation Theory
On some combinatorial aspects of Representation Theory Doctoral Defense Waldeck Schützer schutzer@math.rutgers.edu Rutgers University March 24, 2004 Representation Theory and Combinatorics p.1/46 Overview
More informationQuasi-reducible Polynomials
Quasi-reducible Polynomials Jacques Willekens 06-Dec-2008 Abstract In this article, we investigate polynomials that are irreducible over Q, but are reducible modulo any prime number. 1 Introduction Let
More informationFrames of the Leech lattice and their applications
Frames of the Leech lattice and their applications Akihiro Munemasa 1 1 Graduate School of Information Sciences Tohoku University August 6, 2009 The Leech lattice A Z-submodule L of rank 24 in R 24 with
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 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 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 informationSince G is a compact Lie group, we can apply Schur orthogonality to see that G χ π (g) 2 dg =
Problem 1 Show that if π is an irreducible representation of a compact lie group G then π is also irreducible. Give an example of a G and π such that π = π, and another for which π π. Is this true for
More informationBinary codes related to the moonshine vertex operator algebra
Binary codes related to the moonshine vertex operator algebra Akihiro Munemasa 1 1 Graduate School of Information Sciences Tohoku University (in collaboration with K. Betsumiya, R. A. L. Betty, M. Harada
More informationCharacter tables for some small groups
Character tables for some small groups P R Hewitt U of Toledo 12 Feb 07 References: 1. P Neumann, On a lemma which is not Burnside s, Mathematical Scientist 4 (1979), 133-141. 2. JH Conway et al., Atlas
More informationOn the eigenvalues of Euclidean distance matrices
Volume 27, N. 3, pp. 237 250, 2008 Copyright 2008 SBMAC ISSN 00-8205 www.scielo.br/cam On the eigenvalues of Euclidean distance matrices A.Y. ALFAKIH Department of Mathematics and Statistics University
More informationAlgebraic aspects of Hadamard matrices
Algebraic aspects of Hadamard matrices Padraig Ó Catháin University of Queensland 22 February 2013 Overview Difference set Relative difference set Symmetric Design Hadamard matrix Overview 1 Hadamard matrices
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 informationThe Third Workshop on Spectral Graph Theory and Related Topics 1
The Third Workshop on Spectral Graph Theory and Related Topics 1 Date : March 13 (Fri) 15 (Sun), 2015 Venue : Hiroshima Institute of Technology, Hiroshima Campus Room 201 (Mar. 13, 14), Room 301 (Mar.
More informationIowa State University and American Institute of Mathematics
Matrix and Matrix and Iowa State University and American Institute of Mathematics ICART 2008 May 28, 2008 Inverse Eigenvalue Problem for a Graph () Problem for a Graph of minimum rank Specific matrices
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 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 informationEXERCISES IN MODULAR FORMS I (MATH 726) (2) Prove that a lattice L is integral if and only if its Gram matrix has integer coefficients.
EXERCISES IN MODULAR FORMS I (MATH 726) EYAL GOREN, MCGILL UNIVERSITY, FALL 2007 (1) We define a (full) lattice L in R n to be a discrete subgroup of R n that contains a basis for R n. Prove that L is
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 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 informationTransitive groups, derangements and related problems
Transitive groups, derangements and related problems Tim Burness University of Bristol Algebraic Combinatorics and Group Actions Herstmonceux Castle July 11th 2016 Introduction Let G be a group acting
More informationCSIR - Algebra Problems
CSIR - Algebra Problems N. Annamalai DST - INSPIRE Fellow (SRF) Department of Mathematics Bharathidasan University Tiruchirappalli -620024 E-mail: algebra.annamalai@gmail.com Website: https://annamalaimaths.wordpress.com
More informationSpectra of Semidirect Products of Cyclic Groups
Spectra of Semidirect Products of Cyclic Groups Nathan Fox 1 University of Minnesota-Twin Cities Abstract The spectrum of a graph is the set of eigenvalues of its adjacency matrix A group, together with
More informationGeneralised quadrangles with a group of automorphisms acting primitively on points and lines
Generalised quadrangles with a group of automorphisms acting primitively on points and lines John Bamberg a, Michael Giudici a, Joy Morris b, Gordon F. Royle a, Pablo Spiga a a The Centre for the Mathematics
More informationYoung s Natural Representations of S 4
Young s Natural Representations of S Quinton Westrich arxiv:111.0687v1 [math.rt] Dec 011 December 008 Abstract We calculate all inequivalent irreducible representations of S by specifying the matrices
More information`-modular Representations of Finite Reductive Groups
`-modular Representations of Finite Reductive Groups Bhama Srinivasan University of Illinois at Chicago AIM, June 2007 Bhama Srinivasan (University of Illinois at Chicago) Modular Representations AIM,
More informationOn pseudocyclic association schemes
Also available at http://amc.imfm.si ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 5 (2012) 1 25 On pseudocyclic association schemes Mikhail Muzychuk Netanya
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 informationarxiv: v1 [math.co] 1 Jan 2019
ARC-TRANSITIVE GRAPHS OF VALENCY TWICE A PRIME ADMIT A SEMIREGULAR AUTOMORPHISM MICHAEL GIUDICI AND GABRIEL VERRET arxiv:1901.00084v1 [math.co] 1 Jan 2019 Abstract. We prove that every finite arc-transitive
More informationExistence of Taylor-Wiles Primes
Existence of Taylor-Wiles Primes Michael Lipnowski Introduction Let F be a totally real number field, ρ = ρ f : G F GL 2 (k) be ( an odd residually ) modular representation (odd meaning that complex conjugation
More informationMATHEMATICS COMPREHENSIVE EXAM: IN-CLASS COMPONENT
MATHEMATICS COMPREHENSIVE EXAM: IN-CLASS COMPONENT The following is the list of questions for the oral exam. At the same time, these questions represent all topics for the written exam. The procedure for
More informationFURTHER PROBLEMS CONCERNING FINITE GEOMETRIES AND FINITE GROUPS WILLIAM M. KANTOR
Proceedings of Symposia in Pure Mathematics Volume 37, 1980 FURTHER PROBLEMS CONCERNING FINITE GEOMETRIES AND FINITE GROUPS WILLIAM M. KANTOR This note is intended as a very long footnote to the other
More information