Vertex subsets with minimal width and dual width
|
|
- Elmer Francis
- 5 years ago
- Views:
Transcription
1 Vertex subsets with minimal width and dual width in Q-polynomial distance-regular graphs University of Wisconsin & Tohoku University February 2, 2011
2 Every face (or facet) of a hypercube is a hypercube...
3 Goal Generalize this situation to Q-polynomial distance-regular graphs. Discuss its applications.
4 Distance-regular graphs Γ = (X, R) : a finite connected simple graph with diameter d : the path-length distance function Define A 0, A 1,..., A d R X X by { 1 if (x, y) = i (A i ) xy = 0 otherwise For x X, set Γ i (x) = {y X : (x, y) = i}. Γ is distance-regular if there are integers a i, b i, c i such that A 1 A i = b i 1 A i 1 + a i A i + c i+1 A i+1 (0 i d) where A 1 = A d+1 = 0.
5 A 1 A i = b i 1 A i 1 + a i A i + c i+1 A i+1 (0 i d)
6 Example: hypercubes X = {0, 1} d x R y {i : x i y i } = 1 Γ = Q d = (X, R) : the hypercube Q 3 : Q d = the binary Hamming graph
7 Example: Johnson graphs Ω : a finite set with Ω = v 2d X = {x Ω : x = d} x R y x y = d 1 (x, y Ω) Γ = J(v, d) = (X, R) : the Johnson graph The complement of J(5, 2) with Ω = {1, 2, 3, 4, 5}: {3,4} {1,2} {1,5} {2,3} {1,4} {2,5} {3,5} {4,5} {2,4} {1,3}
8 A 1 A i = b i 1 A i 1 + a i A i + c i+1 A i+1 (0 i d) Γ = (X, R) : a distance-regular graph with diameter d A 0, A 1,..., A d : the distance matrices of Γ We set A := A 1 (the adjacency matrix of Γ). θ 0, θ 1,..., θ d : the distinct eigenvalues of A E i : the orthogonal projection onto the eigenspace of A with eigenvalue θ i R[A] = A 0,..., A d = E 0,..., E d : the Bose Mesner algebra of Γ
9 θ 0, θ 1..., θ d Γ is regular with valency k := b 0 : We always set θ 0 = k = b 0. E 0 R X = 1 where 1 : the all-ones vector E 0 = 1 X J where J : the all-ones matrix in RX X
10 θ 0, θ 1..., θ d Recall A 1 A i = b i 1 A i 1 + a i A i + c i+1 A i+1 (0 i d). Γ is Q-polynomial with respect to {E i } d i=0 if there are scalars a i, b i, c i (0 i d) such that b i 1 c i 0 (1 i d) and X E 1 E i = b i 1E i 1 + a i E i + c i+1e i+1 (0 i d) where E 1 = E d+1 = 0 and is the Hadamard product. The ordering {E i } d i=0 is uniquely determined by E 1.
11 Hypercubes and binary Hamming matroids {0, 1, } : the claw semilattice of order 3 : 0 1 (P, ) : the direct product of d claw semilattices: P = {0, 1, } d u v u i = or u i = v i (1 i d) H(d, 2) = (P, ) : the binary Hamming matroid rank(u) = {i : u i } (u P) X = {0, 1} d = top(p) : the top fiber of H(d, 2)
12 Hypercubes and binary Hamming matroids u P : rank i χ u R X : the characteristic vector of Y u := {x X : u x} rank d u rank i Remark There is an ordering E 0, E 1,..., E d such that i E i R X = χ u : u P, rank(u) = i (0 i d). h=0 Moreover, Q d is Q-polynomial with respect to {E i } d i=0.
13 Y u = {x X : u x} is a facet of Q d If d = 3 and u = (, 0, ) then: Y u Every facet of Q d is of this form. The induced subgraph on Y u is Q d rank(u).
14 Johnson graphs and truncated Boolean algebras Recall Ω : a finite set with Ω = v 2d P = {u Ω : u d} u v u v B(d, v) = (P, ) : the truncated Boolean algebra rank(u) = u (u P) X = {x Ω : x = d} = top(p) : the top fiber of B(d, v)
15 Johnson graphs and truncated Boolean algebras u P : rank i χ u R X : the characteristic vector of Y u := {x X : u x} rank d u rank i Remark There is an ordering E 0, E 1,..., E d such that i E i R X = χ u : u P, rank(u) = i (0 i d). h=0 Moreover, J(v, d) is Q-polynomial with respect to {E i } d i=0.
16 Y u = {x X : u x} induces J(v rank(u), d rank(u)) Ω Ω\u x u x\u Remark H(d, 2) and B(d, v) are examples of regular quantum matroids (Terwilliger, 1996).
17 Width and dual width (Brouwer et al., 2003) Γ = (X, R) : a distance-regular graph with diameter d A 0, A 1,..., A d : the distance matrices E 0, E 1,..., E d : the primitive idempotents of R[A] Suppose Γ is Q-polynomial with respect to {E i } d i=0. Y X : a nonempty subset of X χ R X : the characteristic vector of Y w = max{i : χ T A i χ 0} : the width of Y w = max{i : χ T E i χ 0} : the dual width of Y Y w
18 w = max{i : χ T A i χ 0}, w = max{i : χ T E i χ 0} Theorem (Brouwer Godsil Koolen Martin, 2003) We have w + w d. If equality holds then the induced subgraph Γ Y on Y is a Q-polynomial distance-regular graph with diameter w provided that it is connected. Definition We call Y a descendent of Γ if w + w = d.
19 Examples: Γ = Q d or J(v, d) u P : rank i Y u := {x X : u x} satisfies w = d i and w = i. rank d u rank i Theorem (Brouwer et al., 2003; T., 2006) If Γ is associated with a regular quantum matroid, then every descendent of Γ is isomorphic to some Y u under the full automorphism group of Γ.
20 Observation Y u Y u is convex (geodetically closed).
21 AA i = b i 1 A i 1 + a i A i + c i+1 A i+1 (0 i d) We say Γ has classical parameters (d, q, α, β) if ([ ] [ ] )( [ ] ) [ ] ( [ ] ) d i i i i 1 b i = β α, c i = 1+α Example q q for 0 i d, where [ ] i j is the q-binomial coefficient. q If Γ = Q d then b i = d i and c i = i, so Γ has classical parameters (d, 1, 0, 1). q q q Currently, there are 15 known infinite families of distance-regular graphs with classical parameters and with unbounded diameter.
22 The families related to Hamming graphs Doob graphs halved cubes bilinear forms graphs pseudo halving q-analog Hamming graphs (hypercubes) half dual polar graphs dual polar graphs with second Q-polynomial ordering Ustimenko graphs distance 1-or-2 q-analog dual polar graphs pseudo halving alternating forms graphs last subconst. Hermitean forms graphs halving Hemmeter graphs last subconst. quadratic forms graphs
23 The families related to Johnson graphs Johnson graphs q-analog Grassmann graphs pseudo twisted Grassmann graphs
24 b i = ( [ d 1 ]q [ i 1 ]q )(β α[ i 1 ]q ), c i = [ i 1 ]q (1 + α[ ] i 1 1 q ) Y X : a descendent of Γ, i.e., w + w = d Γ Y : the induced subgraph on Y Theorem (T.) Suppose 1 < w < d. Then Y is convex precisely when Γ has classical parameters. Theorem (T.) If Γ has classical parameters (d, q, α, β) then Γ Y has classical parameters (w, q, α, β). The converse also holds, provided w 3. Classification of descendents is complete for all 15 families (T.).
25 The Erdős Ko Rado theorem (1961) Ω : a finite set with Ω = v 2d X = {x Ω : x = d} Theorem (Erdős Ko Rado, 1961) Let v (t + 1)(d t + 1) and let Y X be a t-intersecting family, i.e., x y t for all x, y Y. Then ( ) v t Y. d t If v > (t + 1)(d t + 1) and if Y = ( v t d t) then for some u Ω with u = t. Y = {x X : u x}
26 A modern treatment of the E K R theorem This is in fact a result about the Johnson graph J(v, d) and the truncated Boolean algebra B(d, v) = (P, ). Theorem (Erdős Ko Rado, 1961) Let v (t + 1)(d t + 1) and let Y X be a t-intersecting family, i.e., w(y) d t. Then ( ) v t Y. d t If v > (t + 1)(d t + 1) and if Y = ( v t d t) then for some u P with rank(u) = t. Y = Y u
27 Delsarte s linear programming method Define Q = (Q ij ) 0 i,j d by E j = 1 X d Q ij A i i=0 (0 j d), or equivalently (E 0, E 1,..., E d ) = 1 X (A 0, A 1,..., A d )Q. Since E 0 = 1 X J = 1 X (A 0 + A A d ) we find Q 00 = Q 10 = = Q d0 = 1.
28 E j = 1 X d i=0 Q ija i, Q 00 = Q 10 = = Q d0 = 1 Y X : w(y) d t χ R X : the characteristic vector of Y e = (e 0, e 1,..., e d ) : the inner distribution of Y : e i = 1 Y χt A i χ (0 i d) Then (P0) (P1) (P2) (P3) (eq) 0 = e 0 + e e d = 1 Y χt Jχ = Y, (eq) j = e 0 = 1, e d t+1 = = e d = 0, d e i Q ij = X Y χt E j χ 0 (1 j d). i=0
29 (eq) 0 = Y, e 0 = 1, e d t+1 = = e d = 0, (eq) j 0 ( j) A vector f (unique, if any) satisfying the following conditions gives a feasible solution to the dual problem: (D1) (D2) (D3) (D4) f 0 = 1, f 1 = = f t = 0, f t+1 > 0,..., f d > 0, (fq T ) 1 = = (fq T ) d t = 0. By the duality of linear programming, we have Y (fq T ) 0 and equality holds if and only if (eq) j f j = 0 (1 j d) (eq) t+1 = = (eq) d = 0 w (Y) t.
30 Y (fq T ) 0 ; Y = (fq T ) 0 w (Y) t Since w(y) d t and w(y) + w (Y) d, we find Y = (fq T ) 0 if and only if Y is a descendent of J(v, d). Under certain conditions, the vector satisfying (D1) (D4) was constructed in each of the following cases: Γ f (fq ( T 0 Johnson J(v, d) Wilson (1984) v t ) d t Hamming H(d, q) MDS weight enumerators q d t ] Grassmann J q (v, d) Frankl Wilson (1986) bilinear forms Bil q (d, e) (d, e, t, q)-singleton systems, Delsarte (1978) [ v t d t q q (d t)e Since J q (2d + 1, d) and the twisted Grassmann graph J q (2d + 1, d) have the same Q, we now also get the Erdős Ko Rado theorem for J q (2d + 1, d).
The 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 informationVertex subsets with minimal width and dual width in Q-polynomial distance-regular graphs
Vertex subsets with minimal width and dual width in Q-polynomial distance-regular graphs Hajime Tanaka Department of Mathematics, University of Wisconsin 480 Lincoln Drive, Madison, WI 53706, U.S.A. htanaka@math.is.tohoku.ac.jp
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 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 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 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 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 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 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 informationA Questionable Distance-Regular Graph
A Questionable Distance-Regular Graph Rebecca Ross Abstract In this paper, we introduce distance-regular graphs and develop the intersection algebra for these graphs which is based upon its intersection
More informationD-bounded Distance-Regular Graphs
D-bounded Distance-Regular Graphs CHIH-WEN WENG 53706 Abstract Let Γ = (X, R) denote a distance-regular graph with diameter D 3 and distance function δ. A (vertex) subgraph X is said to be weak-geodetically
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 informationBoolean degree 1 functions on some classical association schemes
Boolean degree 1 functions on some classical association schemes Yuval Filmus, Ferdinand Ihringer February 16, 2018 Abstract We investigate Boolean degree 1 functions for several classical association
More informationErdős-Ko-Rado theorems in polar spaces
Singapore, May 2016 The theorem of Erdős-Ko-Rado Theorem, 1961: If S is an intersecting family of k-subsets of an n-set Ω, n 2k, then S ( n 1 k 1). For n 2k + 1 equality holds iff S consists of all k-subsets
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 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 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 informationApproaches to the Erdős-Ko-Rado Theorems
Approaches to the Erdős-Ko-Rado Theorems Karen Meagher (joint work with Bahman Ahmadi, Peter Borg, Chris Godsil, Alison Purdy and Pablo Spiga) Finite Geometries, Irsee, September 2017 Set systems An intersecting
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 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 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 informationTriply even codes binary codes, lattices and framed vertex operator algebras
Triply even codes binary codes, lattices and framed vertex operator algebras Akihiro Munemasa 1 1 Graduate School of Information Sciences Tohoku University (joint work with Koichi Betsumiya, Masaaki Harada
More informationDistance-regular graphs where the distance-d graph has fewer distinct eigenvalues
NOTICE: this is the author s version of a work that was accepted for publication in . Changes resulting from the publishing process, such as peer review, editing, corrections,
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 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 informationSome Notes on Distance-Transitive and Distance-Regular Graphs
Some Notes on Distance-Transitive and Distance-Regular Graphs Robert Bailey February 2004 These are notes from lectures given in the Queen Mary Combinatorics Study Group on 13th and 20th February 2004,
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 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 informationGraphs With Many Valencies and Few Eigenvalues
Graphs With Many Valencies and Few Eigenvalues By Edwin van Dam, Jack H. Koolen, Zheng-Jiang Xia ELA Vol 28. 2015 Vicente Valle Martinez Math 595 Spectral Graph Theory Apr 14, 2017 V. Valle Martinez (Math
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 informationCompletely Regular Clique Graphs. SCAC, August 21, 2012 Hiroshi Suzuki International Christian University
Completely Regular Clique Graphs SCAC, August 21, 2012 Hiroshi Suzuki International Christian University Proposition. Let Γ = (X, R) be a connected graph of diameter D. Then the following are equivalent.
More informationIntroduction to Kleene Algebras
Introduction to Kleene Algebras Riccardo Pucella Basic Notions Seminar December 1, 2005 Introduction to Kleene Algebras p.1 Idempotent Semirings An idempotent semiring is a structure S = (S, +,, 1, 0)
More informationThe Terwilliger Algebras of Group Association Schemes
The Terwilliger Algebras of Group Association Schemes Eiichi Bannai Akihiro Munemasa The Terwilliger algebra of an association scheme was introduced by Paul Terwilliger [7] in order to study P-and Q-polynomial
More informationA 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 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 informationMIT Algebraic techniques and semidefinite optimization May 9, Lecture 21. Lecturer: Pablo A. Parrilo Scribe:???
MIT 6.972 Algebraic techniques and semidefinite optimization May 9, 2006 Lecture 2 Lecturer: Pablo A. Parrilo Scribe:??? In this lecture we study techniques to exploit the symmetry that can be present
More informationarxiv: v2 [math.co] 24 May 2018
A characterization of the graphs of bilinear (d d)-forms over F 2 arxiv:5.09435v2 [math.co] 24 May 208 Alexander L. Gavrilyuk School of Mathematical Sciences, University of Science and Technology of China,
More informationarxiv: v1 [math.co] 14 Jan 2016
The Cameron-Liebler problem for sets Maarten De Boec, Leo Storme and Andrea Švob arxiv:1601.03628v1 [math.co] 14 Jan 2016 Abstract Cameron-Liebler line classes and Cameron-Liebler -classes in PG(2 + 1,
More informationNon-Standard Coding Theory
Non-Standard Coding Theory Steven T. Dougherty July 3, 2013 Rosenbloom-Tsfasman Metric Codes with the Rosenbloom-Tsfasman Metric Rosenbloom-Tsfasman Metric Mat n,s (F q ) denotes the linear space of all
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 informationA Course in Combinatorics
A Course in Combinatorics J. H. van Lint Technical Universüy of Eindhoven and R. M. Wilson California Institute of Technology H CAMBRIDGE UNIVERSITY PRESS CONTENTS Preface xi 1. Graphs 1 Terminology of
More informationCospectral graphs and the generalized adjacency matrix
Linear Algebra and its Applications 42 2007) 41 www.elsevier.com/locate/laa Cospectral graphs and the generalized adjacency matrix E.R. van Dam a,1, W.H. Haemers a,, J.H. Koolen b,2 a Tilburg University,
More informationAbstract We survey some of what can be deduced about automorphisms of a graph from information on its eigenvalues and eigenvectors. Two of the main to
Symmetry and Eigenvectors Ada Chan and Chris D. Godsil Combinatorics and Optimization University of Waterloo Waterloo, Ontario Canada N2L 3G http://bilby.uwaterloo.ca Support from a National Sciences and
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 informationTotally Bipartite Tridiagonal Pairs. Kazumasa Nomura and Paul Terwilliger
Contents Tridiagonal pair background TB tridiagonal pairs and systems The standard basis and matrix representations The classification of TB tridiagonal systems The Askey-Wilson relations Some automorphisms
More informationNew feasibility conditions for directed strongly regular graphs
New feasibility conditions for directed strongly regular graphs Sylvia A. Hobart Jason Williford Department of Mathematics University of Wyoming Laramie, Wyoming, U.S.A sahobart@uwyo.edu, jwillif1@uwyo.edu
More informationA Vector Space Analog of Lovasz s Version of the Kruskal-Katona Theorem
Claude Tardif Non-canonical Independent sets in Graph Powers Let s 4 be an integer. The truncated s-simplex T s is defined as follows: V (T s ) = {(i, j) {0, 1,..., s 1} 2 : i j}, E(T s ) = {[(i, j), (,
More informationOn generalized binomial series and strongly regular graphs
Proyecciones Journal of Mathematics Vol. 32, N o 4, pp. 393-408, December 203. Universidad Católica del Norte Antofagasta - Chile On generalized binomial series and strongly regular graphs Vasco Moço Mano,
More informationSelf-Complementary Arc-Transitive Graphs and Their Imposters
Self-Complementary Arc-Transitive Graphs and Their Imposters by Natalie Mullin A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Mathematics
More informationTotally Bipartite Tridiagonal Pairs. Kazumasa Nomura and Paul Terwilliger
Contents Tridiagonal pair background TB tridiagonal pairs and systems The standard basis and matrix representations The classification of TB tridiagonal systems The Askey-Wilson relations Some automorphisms
More informationLinear Algebra. Session 12
Linear Algebra. Session 12 Dr. Marco A Roque Sol 08/01/2017 Example 12.1 Find the constant function that is the least squares fit to the following data x 0 1 2 3 f(x) 1 0 1 2 Solution c = 1 c = 0 f (x)
More informationLecture 2 Linear Codes
Lecture 2 Linear Codes 2.1. Linear Codes From now on we want to identify the alphabet Σ with a finite field F q. For general codes, introduced in the last section, the description is hard. For a code of
More informationAssignment 1 Math 5341 Linear Algebra Review. Give complete answers to each of the following questions. Show all of your work.
Assignment 1 Math 5341 Linear Algebra Review Give complete answers to each of the following questions Show all of your work Note: You might struggle with some of these questions, either because it has
More informationSemidefinite Programming Basics and Applications
Semidefinite Programming Basics and Applications Ray Pörn, principal lecturer Åbo Akademi University Novia University of Applied Sciences Content What is semidefinite programming (SDP)? How to represent
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 informationPeriodicity & State Transfer Some Results Some Questions. Periodic Graphs. Chris Godsil. St John s, June 7, Chris Godsil Periodic Graphs
St John s, June 7, 2009 Outline 1 Periodicity & State Transfer 2 Some Results 3 Some Questions Unitary Operators Suppose X is a graph with adjacency matrix A. Definition We define the operator H X (t)
More informationPartial cubes: structures, characterizations, and constructions
Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes
More informationUSING GRAPHS AND GAMES TO GENERATE CAP SET BOUNDS
USING GRAPHS AND GAMES TO GENERATE CAP SET BOUNDS JOSH ABBOTT AND TREVOR MCGUIRE Abstract. Let F 3 be the field with 3 elements and consider the k- dimensional affine space, F k 3, over F 3. A line of
More informationSome Bounds for the Distribution Numbers of an Association Scheme
Europ. J. Combinatorics (1988) 9, 1-5 Some Bounds for the Distribution Numbers of an Association Scheme THOMAS BIER AND PHILIPPE DELSARTE We generalize the definition of distribution numbers of an association
More informationPeter J. Dukes. 22 August, 2012
22 August, 22 Graph decomposition Let G and H be graphs on m n vertices. A decompostion of G into copies of H is a collection {H i } of subgraphs of G such that each H i = H, and every edge of G belongs
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 informationAlmost Independent Binary Random Variables
Project Number: MA-WJM-6401 Almost Independent Binary Random Variables A Major Qualifying Project submitted to the Faculty of the WORCESTER POLYTECHNIC INSTITUTE in partial fulfillment of the requirements
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 informationICT12 8. Linear codes. The Gilbert-Varshamov lower bound and the MacWilliams identities SXD
1 ICT12 8. Linear codes. The Gilbert-Varshamov lower bound and the MacWilliams identities 19.10.2012 SXD 8.1. The Gilbert Varshamov existence condition 8.2. The MacWilliams identities 2 8.1. The Gilbert
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationRegular graphs with a small number of distinct eigenvalues
Regular graphs with a small number of distinct eigenvalues Tamara Koledin UNIVERZITET U BEOGRADU ELEKTROTEHNIČKI FAKULTET This is joint work with Zoran Stanić Bipartite regular graphs Bipartite regular
More informationApplying block intersection polynomials to study graphs and designs
Applying block intersection polynomials to study graphs and designs Leonard Soicher Queen Mary University of London CoCoA15, Colorado State University, Fort Collins, July 2015 Leonard Soicher (QMUL) Block
More informationLecture 1. 1 Conic programming. MA 796S: Convex Optimization and Interior Point Methods October 8, Consider the conic program. min.
MA 796S: Convex Optimization and Interior Point Methods October 8, 2007 Lecture 1 Lecturer: Kartik Sivaramakrishnan Scribe: Kartik Sivaramakrishnan 1 Conic programming Consider the conic program min s.t.
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 informationRelaxations of combinatorial problems via association schemes
1 Relaxations of combinatorial problems via association schemes Etienne de Klerk, Fernando M. de Oliveira Filho, and Dmitrii V. Pasechnik Tilburg University, The Netherlands; Nanyang Technological University,
More informationStrongly regular graphs and Borsuk s conjecture
Optimal Point Configurations and Orthogonal Polynomials 2017 Strongly regular graphs and Borsuk s conjecture Andriy Bondarenko Norwegian University of Science and Technology 19 April 2017 Andriy Bondarenko
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 informationAverage Mixing Matrix of Trees
Electronic Journal of Linear Algebra Volume 34 Volume 34 08 Article 9 08 Average Mixing Matrix of Trees Chris Godsil University of Waterloo, cgodsil@uwaterloo.ca Krystal Guo Université libre de Bruxelles,
More informationQUADRATIC AND SYMMETRIC BILINEAR FORMS OVER FINITE FIELDS AND THEIR ASSOCIATION SCHEMES
QUADRATIC AND SYMMETRIC BILINEAR FORMS OVER FINITE FIELDS AND THEIR ASSOCIATION SCHEMES KAI-UWE SCHMIDT Abstract. Let Q(m, q) and S (m, q) be the sets of quadratic forms and symmetric bilinear forms on
More informationSemidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5
Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5 Instructor: Farid Alizadeh Scribe: Anton Riabov 10/08/2001 1 Overview We continue studying the maximum eigenvalue SDP, and generalize
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 informationDecomposition algorithms in Clifford algebras
Decomposition algorithms in Clifford algebras G. Stacey Staples 1 Department of Mathematics and Statistics Southern Illinois University Edwardsville Combinatorics and Computer Algebra Fort Collins, 2015
More informationOn the metric dimension of imprimitive distance-regular graphs
On the metric dimension of imprimitive distance-regular graphs Robert F. Bailey Abstract. A resolving set for a graph Γ is a collection of vertices S, chosen so that for each vertex v, the list of distances
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 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 informationThe (extended) rank weight enumerator and q-matroids
The (extended) rank weight enumerator and q-matroids Relinde Jurrius Ruud Pellikaan Vrije Universiteit Brussel, Belgium Eindhoven University of Technology, The Netherlands Conference on Random network
More information1 Positive definiteness and semidefiniteness
Positive definiteness and semidefiniteness Zdeněk Dvořák May 9, 205 For integers a, b, and c, let D(a, b, c) be the diagonal matrix with + for i =,..., a, D i,i = for i = a +,..., a + b,. 0 for i = a +
More 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 informationReconstruction and Higher Dimensional Geometry
Reconstruction and Higher Dimensional Geometry Hongyu He Department of Mathematics Louisiana State University email: hongyu@math.lsu.edu Abstract Tutte proved that, if two graphs, both with more than two
More informationLinear Algebra and Dirac Notation, Pt. 3
Linear Algebra and Dirac Notation, Pt. 3 PHYS 500 - Southern Illinois University February 1, 2017 PHYS 500 - Southern Illinois University Linear Algebra and Dirac Notation, Pt. 3 February 1, 2017 1 / 16
More informationStrongly regular graphs constructed from groups
Strongly regular graphs constructed from groups Dean Crnković Department of Mathematics University of Rijeka Croatia Symmetry vs Regularity Pilsen, Czech Republic, July 2018 This work has been fully supported
More informatione j = Ad(f i ) 1 2a ij/a ii
A characterization of generalized Kac-Moody algebras. J. Algebra 174, 1073-1079 (1995). Richard E. Borcherds, D.P.M.M.S., 16 Mill Lane, Cambridge CB2 1SB, England. Generalized Kac-Moody algebras can be
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 Witt designs, Golay codes and Mathieu groups
The Witt designs, Golay codes and Mathieu groups 1 The Golay codes Let V be a vector space over F q with fixed basis e 1,..., e n. A code C is a subset of V. A linear code is a subspace of V. The vector
More informationChapter 1. Preliminaries. The purpose of this chapter is to provide some basic background information. Linear Space. Hilbert Space.
Chapter 1 Preliminaries The purpose of this chapter is to provide some basic background information. Linear Space Hilbert Space Basic Principles 1 2 Preliminaries Linear Space The notion of linear space
More informationLeonard pairs and the q-tetrahedron algebra. Tatsuro Ito, Hjalmar Rosengren, Paul Terwilliger
Tatsuro Ito Hjalmar Rosengren Paul Terwilliger Overview Leonard pairs and the Askey-scheme of orthogonal polynomials Leonard pairs of q-racah type The LB-UB form and the compact form The q-tetrahedron
More informationRadial eigenvectors of the Laplacian of the nonbinary hypercube
Radial eigenvectors of the Laplacian of the nonbinary hypercube Murali K. Srinivasan Department of Mathematics Indian Institute of Technology, Bombay Powai, Mumbai 400076, INDIA mks@math.iitb.ac.in murali.k.srinivasan@gmail.com
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 information3. Abstract Boolean Algebras
3. ABSTRACT BOOLEAN ALGEBRAS 123 3. Abstract Boolean Algebras 3.1. Abstract Boolean Algebra. Definition 3.1.1. An abstract Boolean algebra is defined as a set B containing two distinct elements 0 and 1,
More informationWhen can perfect state transfer occur?
Electronic Journal of Linear Algebra Volume 23 Volume 23 (2012) Article 62 2012 When can perfect state transfer occur? Chris Godsil cgodsil@uwaterloo.ca Follow this and additional works at: http://repository.uwyo.edu/ela
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 informationOn the automorphism groups of PCC. primitive coherent configurations. Bohdan Kivva, UChicago
On the automorphism groups of primitive coherent configurations Bohdan Kivva (U Chicago) Advisor: László Babai Symmetry vs Regularity, WL2018 Pilsen, 6 July 2018 Plan for this talk Babai s classification
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 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 informationOn Boolean functions which are bent and negabent
On Boolean functions which are bent and negabent Matthew G. Parker 1 and Alexander Pott 2 1 The Selmer Center, Department of Informatics, University of Bergen, N-5020 Bergen, Norway 2 Institute for Algebra
More information