Group theoretic aspects of the theory of association schemes

Similar documents
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

The Terwilliger Algebras of Group Association Schemes

Introduction to Association Schemes

The Terwilliger algebra of a Q-polynomial distance-regular graph with respect to a set of vertices

Binary codes of t-designs and Hadamard matrices

Commutative Association Schemes Whose Symmetrizations Have Two Classes*

Oriented covers of the triangular graphs

Strongly Regular Decompositions of the Complete Graph

Algebra Exam Topics. Updated August 2017

Triply Regular Graphs

ALGEBRAIC COMBINATORICS. c1993 C. D. Godsil

On algebras arising from semiregular group actions

Applications of semidefinite programming in Algebraic Combinatorics

Complex Hadamard matrices and 3-class association schemes

The Multiplicities of a Dual-thin Q-polynomial Association Scheme

3-Class Association Schemes and Hadamard Matrices of a Certain Block Form

Nur Hamid and Manabu Oura

Spherical designs and some generalizations : An overview

Scaffolds. A graph-based system for computations in Bose-Mesner algebras. William J. Martin

Department of Mathematics, University of California, Berkeley

A PROOF OF BURNSIDE S p a q b THEOREM

Markov chains, graph spectra, and some static/dynamic scaling limits

Linear, Quadratic, and Cubic Forms over the Binary Field

Vertex subsets with minimal width and dual width

An algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings

Complex Hadamard matrices and 3-class association schemes

Applicable Analysis and Discrete Mathematics available online at GRAPHS WITH TWO MAIN AND TWO PLAIN EIGENVALUES

COMMUTATIVE ASSOCIATION SCHEMES

On non-bipartite distance-regular graphs with valency k and smallest eigenvalue not larger than k/2

CURRICULUM VITAE Tatsuro Ito

Intro to harmonic analysis on groups Risi Kondor

Galois Theory TCU Graduate Student Seminar George Gilbert October 2015

Difference sets and Hadamard matrices

Ohio s Learning Standards-Extended. Mathematics. The Real Number System Complexity a Complexity b Complexity c

Some parametric inequalities on strongly regular graphs spectra

Theorems of Erdős-Ko-Rado type in polar spaces

List of topics for the preliminary exam in algebra

Group fusion power of association schemes

THIS paper is an extended version of the paper [1],

Rank 3 permutation groups

Strongly regular graphs and Borsuk s conjecture

Family Feud Review. Linear Algebra. October 22, 2013

Fundamental theorem of modules over a PID and applications

Tridiagonal pairs in algebraic graph theory

ECS130 Scientific Computing. Lecture 1: Introduction. Monday, January 7, 10:00 10:50 am

Application of the Representation Theory of Symmetric Groups for the Computation of Chromatic Polynomials of Graphs

HAMILTONICITY OF VERTEX-TRANSITIVE GRAPHS

Open Questions in Coding Theory

SAMPLE TEX FILE ZAJJ DAUGHERTY

January 2016 Qualifying Examination

Exercises on chapter 4

Algebra Questions. May 13, Groups 1. 2 Classification of Finite Groups 4. 3 Fields and Galois Theory 5. 4 Normal Forms 9

SOME DESIGNS AND CODES FROM L 2 (q) Communicated by Alireza Abdollahi

On the ideal of the shortest vectors in the Leech lattice and other lattices

Adjoint Representations of the Symmetric Group

On some incidence structures constructed from groups and related codes

Quantum wires, orthogonal polynomials and Diophantine approximation

Abstract Algebra Study Sheet

Algorithmic Approach to Non-symmetric 3-class Association Schemes

arxiv: v1 [math.co] 2 Aug 2013

A classification of sharp tridiagonal pairs. Tatsuro Ito, Kazumasa Nomura, Paul Terwilliger

FIELD THEORY. Contents

Zero-Sum Flows in Regular Graphs

A Block Negacyclic Bush-Type Hadamard Matrix and Two Strongly Regular Graphs

Solutions for Problem Set 6

Some Extremal Self-Dual Codes and Unimodular Lattices in Dimension 40

Solutions to Example Sheet 1

Quasi-cyclic codes. Jay A. Wood. Algebra for Secure and Reliable Communications Modeling Morelia, Michoacán, Mexico October 12, 2012

On some combinatorial aspects of Representation Theory

Quasi-reducible Polynomials

Frames of the Leech lattice and their applications

REPRESENTATION THEORY OF S n

Radon Transforms and the Finite General Linear Groups

This section is an introduction to the basic themes of the course.

Since G is a compact Lie group, we can apply Schur orthogonality to see that G χ π (g) 2 dg =

Binary codes related to the moonshine vertex operator algebra

Character tables for some small groups

On the eigenvalues of Euclidean distance matrices

Algebraic aspects of Hadamard matrices

Leonard triples of q-racah type

The Third Workshop on Spectral Graph Theory and Related Topics 1

Iowa State University and American Institute of Mathematics

Design theory from the viewpoint of algebraic combinatorics

JOHNSON SCHEMES AND CERTAIN MATRICES WITH INTEGRAL EIGENVALUES

EXERCISES IN MODULAR FORMS I (MATH 726) (2) Prove that a lattice L is integral if and only if its Gram matrix has integer coefficients.

Coherent Configurations and Association Schemes. Part I. Definitions, examples, simple facts

A study of permutation groups and coherent configurations. John Herbert Batchelor. A Creative Component submitted to the graduate faculty

Transitive groups, derangements and related problems

CSIR - Algebra Problems

Spectra of Semidirect Products of Cyclic Groups

Generalised quadrangles with a group of automorphisms acting primitively on points and lines

Young s Natural Representations of S 4

`-modular Representations of Finite Reductive Groups

On pseudocyclic association schemes

Nonnegative Matrices I

arxiv: v1 [math.co] 1 Jan 2019

Existence of Taylor-Wiles Primes

MATHEMATICS COMPREHENSIVE EXAM: IN-CLASS COMPONENT

FURTHER PROBLEMS CONCERNING FINITE GEOMETRIES AND FINITE GROUPS WILLIAM M. KANTOR

Transcription:

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 2016 1 / 18

Association schemes Bannai and Ito, Algebraic Combinatorics I (1984). P- and Q-polynomial schemes A. Munemasa (Tohoku University) association schemes Hefei 2016 2 / 18

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 2016 2 / 18

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 2016 2 / 18

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 2016 2 / 18

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 2016 2 / 18

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 2016 2 / 18

Permutation representations association scheme multiplicity-free permutation representation ordinary representation theory A. Munemasa (Tohoku University) association schemes Hefei 2016 3 / 18

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 2016 3 / 18

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 2016 3 / 18

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 2016 3 / 18

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 2016 4 / 18

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 2016 5 / 18

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 2016 5 / 18

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 2016 6 / 18

Scott s theorem V = V 0 V 1 V d, θ = χ 0 + χ 1 + + χ 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 2016 7 / 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)). A. Munemasa (Tohoku University) association schemes Hefei 2016 8 / 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 2016 8 / 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. Is there a primitive counterexample? A. Munemasa (Tohoku University) association schemes Hefei 2016 8 / 18

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 2016 9 / 18

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 2016 10 / 18

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 2016 11 / 18

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 2016 12 / 18

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 2016 13 / 18

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 2016 14 / 18

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 2016 15 / 18

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 2016 15 / 18

Non-cyclotomic numbers 3 = e π 1/6 + e π 1/6 A. Munemasa (Tohoku University) association schemes Hefei 2016 16 / 18

Non-cyclotomic numbers 3 = e π 1/6 + e π 1/6 4 3 / cyclotomic field A. Munemasa (Tohoku University) association schemes Hefei 2016 16 / 18

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 2016 16 / 18

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 2016 16 / 18

Non-multiplicity-free permutation group A. Ryba and S. Smith: G = PGL(2, 11) acting on PGL(2, 11)/D 24 has 1 + 5 as an eigenvalue, which is a bipartite half of a bipartite 3-regular graph (flag-transitive incidence structure) on 55 + 55 vertices. A. Munemasa (Tohoku University) association schemes Hefei 2016 17 / 18

Non-multiplicity-free permutation group A. Ryba and S. Smith: G = PGL(2, 11) acting on PGL(2, 11)/D 24 has 1 + 5 as an eigenvalue, which is a bipartite half of a bipartite 3-regular graph (flag-transitive incidence structure) on 55 + 55 vertices. = 4 + 5 is an eigenvalue of A 2 A. Munemasa (Tohoku University) association schemes Hefei 2016 17 / 18

Non-multiplicity-free permutation group A. Ryba and S. Smith: G = PGL(2, 11) acting on PGL(2, 11)/D 24 has 1 + 5 as an eigenvalue, which is a bipartite half of a bipartite 3-regular graph (flag-transitive incidence structure) on 55 + 55 vertices. = 4 + 5 is an eigenvalue of A 2 = 4 + 5 is an eigenvalue of A A. Munemasa (Tohoku University) association schemes Hefei 2016 17 / 18

Non-multiplicity-free permutation group A. Ryba and S. Smith: G = PGL(2, 11) acting on PGL(2, 11)/D 24 has 1 + 5 as an eigenvalue, which is a bipartite half of a bipartite 3-regular graph (flag-transitive incidence structure) on 55 + 55 vertices. = 4 + 5 is an eigenvalue of A 2 = 4 + 5 is an eigenvalue of A = 1 + 4 + 5 is an eigenvalue of the line graph (G acts transitively, imprimitively). A. Munemasa (Tohoku University) association schemes Hefei 2016 17 / 18

Primitive counterexample 1 The smallest primitive group with non-cyclotomic eigenvalue is PSL(2, 19)/D 20. 2 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 2016 18 / 18

2024 © sciencedocbox.com Privacy Policy | Terms of Service | Feedback