Equiangular lines in Euclidean spaces
|
|
- Wesley Ward
- 6 years ago
- Views:
Transcription
1 Equiangular lines in Euclidean spaces Gary Greaves 東北大学 Tohoku University 14th August 215 joint work with J. Koolen, A. Munemasa, and F. Szöllősi. Gary Greaves Equiangular lines in Euclidean spaces 1/23
2 Plan From lines to matrices; Upper bounds for N(d); Lower bounds for N(d); Seidel matrices with 3 eigenvalues; A strengthening of the relative bound; New upper bounds. Gary Greaves Equiangular lines in Euclidean spaces 2/23
3 Equiangular line systems Let L be a system of n lines spanned by v 1,..., v n R d. L is equiangular if v i, v i = 1 and v i, v j = α (α is called the common angle). Problem: given d, what is the largest possible number N(d) of equiangular lines in R d? Questions Martin (215): Find, as many as you can, equiangular lines in R d. Yu (215): Determine N(14) and N(16). Gary Greaves Equiangular lines in Euclidean spaces 3/23
4 Seidel matrices Let L be an equiangular line system of n lines in R d with common angle α. Let M be the Gram matrix for the line system L. Then M is positive semidefinite with nullity n d. Assume α > and set S = (M I)/α. S is a {, ±1}-matrix with smallest eigenvalue 1/α with multiplicity n d. S = S(L) is called a Seidel matrix. Relation to graphs: S = J I 2A. Gary Greaves Equiangular lines in Euclidean spaces 4/23
5 Seidel matrices Let L be an equiangular line system of n lines in R d with common angle α. Let M be the Gram matrix for the line system L. Then M is positive semidefinite with nullity n d. Assume α > and set S = (M I)/α. S is a {, ±1}-matrix with smallest eigenvalue 1/α with multiplicity n d. Smallest eigenvalue λ = 1/α. S = S(L) is called a Seidel matrix. Relation to graphs: S = J I 2A. Gary Greaves Equiangular lines in Euclidean spaces 4/23
6 Basic properties of Seidel matrices Let S be an n n Seidel matrix. tr S =, tr S 2 = n(n 1); GG, AM, JK, FS (215+): det S 4 ( 1) n 1 (n 1); Neumann (1973): If S has an even integer eigenvalue λ then λ has multiplicity at most 1. 2A = J I S. Gary Greaves Equiangular lines in Euclidean spaces 5/23
7 Icosahedron o o1 i o5 i1 i5 i2 i4 o2 i3 o4 o3 Gary Greaves Equiangular lines in Euclidean spaces 6/23
8 Icosahedron o o1 i o5 i1 i5 i2 i4 o2 i3 o4 o3 Gary Greaves Equiangular lines in Euclidean spaces 6/23
9 Icosahedron o o1 i o5 i1 i5 i2 i4 o2 i3 o4 o3 Gary Greaves Equiangular lines in Euclidean spaces 6/23
10 Icosahedron o o1 i o5 i1 i5 i2 i4 o2 i3 o4 o3 Gary Greaves Equiangular lines in Euclidean spaces 6/23
11 Icosahedron o o1 i o5 i1 i5 i2 i4 o2 i3 o4 o3 Gary Greaves Equiangular lines in Euclidean spaces 6/23
12 Icosahedron o o1 i o5 i1 i5 i2 i4 o2 i3 o4 o3 Gary Greaves Equiangular lines in Euclidean spaces 6/23
13 Icosahedron o o1 i o5 i1 i5 i2 i4 o2 i3 o4 o3 Gary Greaves Equiangular lines in Euclidean spaces 6/23
14 Icosahedron o o1 i o5 i1 i5 i2 i4 o2 i3 o4 o3 Gary Greaves Equiangular lines in Euclidean spaces 6/23
15 Icosahedron S = ; Spectrum: {[ 5] 3, [ 5] 3 }; n = 6, d = 3, and α = 1/ 5. Question: for d = 3, can we do better than n = 6? Gary Greaves Equiangular lines in Euclidean spaces 6/23
16 Upper bounds for N(d) Let L be an equiangular line system of n lines in R d whose Seidel matrix has smallest eigenvalue λ. Gerzon (1973): Absolute bound: n d(d + 1). 2 Van Lint and Seidel (1966): for λ 2 d + 2 Relative bound: n d(λ2 1) λ 2 d. Neumann (1973): If n > 2d then λ is an odd integer. Gary Greaves Equiangular lines in Euclidean spaces 7/23
17 Upper bounds for N(d) Let L be an equiangular line system of n lines in R d whose Seidel matrix has smallest eigenvalue λ. Van Lint and Seidel (1966): for λ 2 d + 2 Relative bound: n d(λ2 1) λ 2 d. Neumann (1973): If n > 2d then λ is an odd integer. Barg and Yu (213): SDP upper bounds for d 136. Okuda and Yu (215+): New relative bound. Gary Greaves Equiangular lines in Euclidean spaces 7/23
18 Lower Bounds Lemmens and Seidel (1973): N(d) d d. de Caen (2): N(d) m 2 /2 for d = 3m/2 1 (m = 4 t ). Szöllősi (211): = N(d) (d + 2) 2 /72. Gary Greaves Equiangular lines in Euclidean spaces 8/23
19 Lower Bounds Lemmens and Seidel (1973): N(d) d d. de Caen (2): N(d) m 2 /2 for d = 3m/2 1 (m = 4 t ). Szöllősi (211): = N(d) (d + 2) 2 /72. GG, AM, JK, FS (215+): N(d) 32d2 +328d Gary Greaves Equiangular lines in Euclidean spaces 8/23
20 Lower Bounds de Caen (2): N(d) m 2 /2 for d = 3m/2 1 (m = 4 t ). Szöllősi (211): = N(d) (d + 2) 2 /72. GG, AM, JK, FS (215+): N(d) 32d2 +328d Proposition (GG, AM, JK, FS 215+) For each t 1 and m = 4 t there exists an equiangular set of (a) m(m/2 + 1) lines in dimension R 3m/2+1 ; and (b) m(m/2 + 1) 1 lines in dimension R 3m/2 ; and (c) mj lines in dimension R m+j 1 for every 1 j m/2. Gary Greaves Equiangular lines in Euclidean spaces 8/23
21 Illustration of the proof Let m = 4. There is a set of m/2 + 1 MUBs of R , , Gary Greaves Equiangular lines in Euclidean spaces 9/23
22 Illustration of the proof Let m = 4. There is a set of m/2 + 1 MUBs of R , , Gary Greaves Equiangular lines in Euclidean spaces 9/23
23 Illustration of the proof Let m = 4. There is a set of m/2 + 1 MUBs of R , , Gary Greaves Equiangular lines in Euclidean spaces 9/23
24 Illustration of the proof We have 12 lines in R 7 ; Gary Greaves Equiangular lines in Euclidean spaces 9/23
25 Illustration of the proof We have 12 lines in R 7 ; We have 11 lines in R 7 ; Gary Greaves Equiangular lines in Euclidean spaces 9/23
26 Illustration of the proof We have 12 lines in R 7 ; We have 11 lines in R 6 ; Left nullspace: Gary Greaves Equiangular lines in Euclidean spaces 9/23
27 Illustration of the proof We have 12 lines in R 7 ; We have 11 lines in R 6 ; We have 8 lines in R 6 ; Left nullspace: Gary Greaves Equiangular lines in Euclidean spaces 9/23
28 Illustration of the proof We have 12 lines in R 7 ; We have 11 lines in R 6 ; We have 8 lines in R 5 ; Left nullspace: 2, Gary Greaves Equiangular lines in Euclidean spaces 9/23
29 Illustration of the proof We have 12 lines in R 7 ; We have 11 lines in R 6 ; We have 8 lines in R 5 ; Left nullspace: < Same as de Caen 2, Gary Greaves Equiangular lines in Euclidean spaces 9/23
30 Seidel matrices with few eigenvalues Gary Greaves Equiangular lines in Euclidean spaces 1/23
31 Seidel matrices with two distinct eigenvalues Let L be an equiangular line system of n lines in R d with common angle α. If n meets either the absolute bound or the relative bound then S(L) has precisely two distinct eigenvalues. Related to strongly regular graphs (regular graphs with 3 eigenvalues). Gary Greaves Equiangular lines in Euclidean spaces 11/23
32 Seidel matrices with two distinct eigenvalues Let L be an equiangular line system of n lines in R d with common angle α. If n meets either the absolute bound or the relative bound then S(L) has precisely two distinct eigenvalues. Related to strongly regular graphs (regular graphs with 3 eigenvalues). Seidel (1995): d n Gary Greaves Equiangular lines in Euclidean spaces 11/23
33 Seidel matrices with two distinct eigenvalues Let L be an equiangular line system of n lines in R d with common angle α. If n meets either the absolute bound or the relative bound then S(L) has precisely two distinct eigenvalues. Related to strongly regular graphs (regular graphs with 3 eigenvalues). d n Gary Greaves Equiangular lines in Euclidean spaces 11/23
34 Seidel matrices with two distinct eigenvalues Let L be an equiangular line system of n lines in R d with common angle α. If n meets either the absolute bound or the relative bound then S(L) has precisely two distinct eigenvalues. Related to strongly regular graphs (regular graphs with 3 eigenvalues). d n Gary Greaves Equiangular lines in Euclidean spaces 11/23
35 Seidel matrices with two distinct eigenvalues Let L be an equiangular line system of n lines in R d with common angle α. If n meets either the absolute bound or the relative bound then S(L) has precisely two distinct eigenvalues. Related to strongly regular graphs (regular graphs with 3 eigenvalues). d n Gary Greaves Equiangular lines in Euclidean spaces 11/23
36 Seidel matrices with two distinct eigenvalues Let L be an equiangular line system of n lines in R d with common angle α. If n meets either the absolute bound or the relative bound then S(L) has precisely two distinct eigenvalues. Related to strongly regular graphs (regular graphs with 3 eigenvalues). d n Gary Greaves Equiangular lines in Euclidean spaces 11/23
37 Seidel matrices with two distinct eigenvalues Let L be an equiangular line system of n lines in R d with common angle α. If n meets either the absolute bound or the relative bound then S(L) has precisely two distinct eigenvalues. Related to strongly regular graphs (regular graphs with 3 eigenvalues). d n Gary Greaves Equiangular lines in Euclidean spaces 11/23
38 Seidel matrices with 3 eigenvalues: constructions SRG construction Let A be the adjacency matrix of an n-vertex strongly regular graph with spectrum {[k] 1, [θ] a, [τ] b }. S = J I 2A has at most 3 distinct eigenvalues: {[n 1 2k] 1, [ 1 2θ] a, [ 1 2τ] b }; Gary Greaves Equiangular lines in Euclidean spaces 12/23
39 Seidel matrices with 3 eigenvalues: constructions SRG construction Let A be the adjacency matrix of an n-vertex strongly regular graph with spectrum {[k] 1, [θ] a, [τ] b }. S = J I 2A has at most 3 distinct eigenvalues: {[n 1 2k] 1, [ 1 2θ] a, [ 1 2τ] b }; Tensor construction Let S be an n n Seidel matrix with spectrum {[λ ] n d, [λ 1 ] d }. J m (S I n ) + I nm has at most 3 distinct eigenvalues: {[m(λ 1) + 1] n d, [1] n(m 1), [m(λ 1 1) + 1] d }. Gary Greaves Equiangular lines in Euclidean spaces 12/23
40 From two eigenvalues to three: coclique removal Let S be an n n Seidel matrix with spectrum {[λ ] n d, [λ 1 ] d }. Take a graph G in the switching class of S. For any vertex v we have the following lemma. Lemma The Seidel matrix corresponding to G\{v} has spectrum {[λ ] n d 1, [λ 1 ] d 1, [λ + λ 1 ] 1 }. Gary Greaves Equiangular lines in Euclidean spaces 13/23
41 From two eigenvalues to three: coclique removal Let S be an n n Seidel matrix with spectrum {[λ ] n d, [λ 1 ] d }. Take a graph G in the switching class of S. For any vertex v we have the following lemma. Lemma The Seidel matrix corresponding to G\{v} has spectrum {[λ ] n d 1, [λ 1 ] d 1, [λ + λ 1 ] 1 }. Gary Greaves Equiangular lines in Euclidean spaces 13/23
42 From two eigenvalues to three: coclique removal Let S be an n n Seidel matrix with spectrum {[λ ] n d, [λ 1 ] d }. Suppose that a graph G in the switching class of S that contains a coclique C on c min(n d, d) vertices. Theorem (GG, AM, JK, FS 215+) The Seidel matrix corresponding to G\C has spectrum {[λ ] n d c, [λ 1 ] d c, [λ + λ c] 1, [λ + λ 1 + 1] c 1 }. Gary Greaves Equiangular lines in Euclidean spaces 13/23
43 From two eigenvalues to three: coclique removal Theorem (GG, AM, JK, FS 215+) The Seidel matrix corresponding to G\C has spectrum {[λ ] n d c, [λ 1 ] d c, [λ + λ c] 1, [λ + λ 1 + 1] c 1 }. Example (cf. Tremain 28) Start with Seidel matrix S with spectrum {[ 5] 21, [7] 15 }. spec(s\k 1 ) = {[ 5] 2, [2] 1, [7] 14 } spec(s\k 2 ) = {[ 5] 19, [1] 1, [3] 1, [7] 13 } spec(s\k 3 ) = {[ 5] 18, [] 1, [3] 2, [7] 12 } spec(s\k 4 ) = {[ 5] 17, [ 1] 1, [3] 3, [7] 11 } spec(s\k 5 ) = {[ 5] 16, [ 2] 1, [3] 4, [7] 1 } spec(s\k 6 ) = {[ 5] 15, [ 3] 1, [3] 5, [7] 9 } spec(s\k 7 ) = {[ 5] 14, [ 4] 1, [3] 6, [7] 8 } spec(s\k 8 ) = {[ 5] 13, [ 5] 1, [3] 7, [7] 7 } Gary Greaves Equiangular lines in Euclidean spaces 13/23
44 From two eigenvalues to three: coclique removal Theorem (GG, AM, JK, FS 215+) The Seidel matrix corresponding to G\C has spectrum {[λ ] n d c, [λ 1 ] d c, [λ + λ c] 1, [λ + λ 1 + 1] c 1 }. Example (cf. Tremain 28) Start with Seidel matrix S with spectrum {[ 5] 21, [7] 15 }. spec(s\k 1 ) = {[ 5] 2, [2] 1, [7] 14 } spec(s\k 2 ) = {[ 5] 19, [1] 1, [3] 1, [7] 13 } spec(s\k 3 ) = {[ 5] 18, [] 1, [3] 2, [7] 12 } spec(s\k 4 ) = {[ 5] 17, [ 1] 1, [3] 3, [7] 11 } spec(s\k 5 ) = {[ 5] 16, [ 2] 1, [3] 4, [7] 1 } spec(s\k 6 ) = {[ 5] 15, [ 3] 1, [3] 5, [7] 9 } spec(s\k 7 ) = {[ 5] 14, [ 4] 1, [3] 6, [7] 8 } spec(s\k 8 ) = {[ 5] 13, [ 5] 1, [3] 7, [7] 7 } = {[ 5] 14, [3] 7, [7] 7 } Gary Greaves Equiangular lines in Euclidean spaces 13/23
45 From two eigenvalues to three: coclique removal Theorem (GG, AM, JK, FS 215+) The Seidel matrix corresponding to G\C has spectrum {[λ ] n d c, [λ 1 ] d c, [λ + λ c] 1, [λ + λ 1 + 1] c 1 }. Resulting Seidel matrix has at most 3 eigenvalues when c = λ or c = d. Only two eigenvalues when c = d = λ This technique is useful if we know something about the size of a coclique in G. Gary Greaves Equiangular lines in Euclidean spaces 13/23
46 Properties of Seidel matrices with 3 eigenvalues Theorem (GG, AM, JK, FS 215+) Let S be an n n Seidel matrix with precisely 3 distinct eigenvalues. Then S has a rational eigenvalue. Furthermore, if n 3 mod 4 then every eigenvalue of S is rational. Gary Greaves Equiangular lines in Euclidean spaces 14/23
47 Properties of Seidel matrices with 3 eigenvalues Theorem (GG, AM, JK, FS 215+) Let S be an n n Seidel matrix with precisely 3 distinct eigenvalues. Then S has a rational eigenvalue. Furthermore, if n 3 mod 4 then every eigenvalue of S is rational. Theorem (GG, AM, JK, FS 215+) For primes p 3 mod 4, there do not exist any p p Seidel matrices having precisely 3 distinct eigenvalues. Except for n = 4, they exist for all other n. n # Gary Greaves Equiangular lines in Euclidean spaces 14/23
48 Strengthening the relative bound Gary Greaves Equiangular lines in Euclidean spaces 15/23
49 Strengthening the relative bound Theorem (Relative bound) Let L be an equiangular line system of n lines in R d whose Seidel matrix has smallest eigenvalue λ and suppose λ 2 d + 2. n d(λ2 1) λ 2 d. Equality implies that S has 2 distinct eigenvalues. Gary Greaves Equiangular lines in Euclidean spaces 16/23
50 Strengthening the relative bound Theorem (Relative bound) Let L be an equiangular line system of n lines in R d whose Seidel matrix has smallest eigenvalue λ and suppose λ 2 d + 2. n d(λ2 1) λ 2 d. Equality implies that S has 2 distinct eigenvalues. GG, AM, JK, FS (215+): Suppose n = and there exists µ Z satisfying d(λ 2 1) λ 2 d certain conditions. Then S has at most 4 distinct eigenvalues. {[λ ] n d, [µ 1] a, [µ] b, [µ + 1] d a b }. Gary Greaves Equiangular lines in Euclidean spaces 16/23
51 Case study: equiangular lines in R 14 Suppose there is n > 2 14 equiangular lines in R 14. Neumann (1973): λ is an odd integer. Lemmens and Seidel (1973): N 3 (14) = 28. Relative bound = λ = 5, N 5 (14) Suppose we have n = 3 (d = 14), with corresponding Seidel matrix S having eigenvalues λ (n d) < λ 1 λ 2 λ d. Gary Greaves Equiangular lines in Euclidean spaces 17/23
52 Case study: equiangular lines in R 14 Lemmens and Seidel (1973): N 3 (14) = 28. Relative bound = λ = 5, N 5 (14) Suppose we have n = 3 (d = 14), with corresponding Seidel matrix S having eigenvalues λ (n d) < λ 1 λ 2 λ d. Using the trace formulae, we have d λ i = (n d)λ = 8; i=1 d λ 2 i = n(n 1) (n d)λ 2 = 47. i=1 Gary Greaves Equiangular lines in Euclidean spaces 17/23
53 Case study: equiangular lines in R 14 Suppose we have n = 3 (d = 14), with corresponding Seidel matrix S having eigenvalues λ (n d) < λ 1 λ 2 λ d. Using the trace formulae, we have Then d λ i = (n d)λ = 8; i=1 d λ 2 i = n(n 1) (n d)λ 2 = 47. i=1 1 = d i=1 (λ i 6) 2 /d Gary Greaves Equiangular lines in Euclidean spaces 17/23
54 Case study: equiangular lines in R 14 Suppose we have n = 3 (d = 14), with corresponding Seidel matrix S having eigenvalues λ (n d) < λ 1 λ 2 λ d. Using the trace formulae, we have Then d λ i = (n d)λ = 8; i=1 d λ 2 i = n(n 1) (n d)λ 2 = 47. i=1 1 = d i=1 (λ i 6) 2 /d d (λ i 6) 2 1. Gary Greaves Equiangular lines in Euclidean spaces 17/23
55 Case study: equiangular lines in R 14 Suppose we have n = 3 (d = 14), with corresponding Seidel matrix S having eigenvalues λ (n d) < λ 1 λ 2 λ d. Using the trace formulae, we have Then d λ i = (n d)λ = 8; i=1 d λ 2 i = n(n 1) (n d)λ 2 = 47. i=1 1 = d i=1 Hence (λ i 6) {±1}. (λ i 6) 2 /d d (λ i 6) 2 1. Gary Greaves Equiangular lines in Euclidean spaces 17/23
56 Relative bound in low dimensions d λ d(λ 2 1) λ 2 d Spectrum {[ 5] 16, [5] 9, [7] 5 } {[ 5] 21, [7] 15 } {[ 5] 26, [7] 7, [9] 9 } {[ 5] 34, [1] 17 } {[ 5] 43, [11] 9, [12] 1, [13] 8 } {[ 5] 57, [15] 19 } {[ 5] 76, [19] 2 } Gary Greaves Equiangular lines in Euclidean spaces 18/23
57 Relative bound in low dimensions d λ d(λ 2 1) λ 2 d Spectrum {[ 5] 16, [5] 9, [7] 5 } {[ 5] 21, [7] 15 } {[ 5] 26, [7] 7, [9] 9 } {[ 5] 34, [1] 17 } {[ 5] 43, [11] 9, [12] 1, [13] 8 } {[ 5] 57, [15] 19 } {[ 5] 76, [19] 2 } Gary Greaves Equiangular lines in Euclidean spaces 18/23
58 Relative bound in low dimensions d λ d(λ 2 1) λ 2 d Spectrum {[ 5] 16, [5] 9, [7] 5 } {[ 5] 21, [7] 15 } {[ 5] 26, [7] 7, [9] 9 } {[ 5] 34, [1] 17 } {[ 5] 43, [11] 9, [12] 1, [13] 8 } {[ 5] 57, [15] 19 } {[ 5] 76, [19] 2 } Seidel matrices cannot have even eigenvalues with multiplicity greater than 1. 2A = J I S. Gary Greaves Equiangular lines in Euclidean spaces 18/23
59 Relative bound in low dimensions d λ d(λ 2 1) λ 2 d Spectrum {[ 5] 16, [5] 9, [7] 5 } {[ 5] 21, [7] 15 } {[ 5] 26, [7] 7, [9] 9 } {[ 5] 34, [1] 17 } {[ 5] 43, [11] 9, [12] 1, [13] 8 } {[ 5] 57, [15] 19 } {[ 5] 76, [19] 2 } Seidel matrices cannot have even eigenvalues with multiplicity greater than 1. 2A = J I S. Gary Greaves Equiangular lines in Euclidean spaces 18/23
60 Euler graphs An Euler graph is a graph each of whose vertices have even valency. Theorem (Mallows-Sloane 1975) The number of switching classes of n n Seidel matrices equals the number of Euler graphs on n vertices. Theorem (GG, AM, JK, FS 215+) Let S be a Seidel matrix with precisely 3 distinct eigenvalues. Then S is switching equivalent to a Seidel matrix S = J I 2A where A is the adjacency matrix of an Euler graph. Gary Greaves Equiangular lines in Euclidean spaces 19/23
61 Killing Seidel matrices with three eigenvalues Theorem (GG, AM, JK, FS 215+) Let S be an n n Seidel matrix with spec. {[λ] a, [µ] b, [ν] c }. Suppose n 2 mod 4, λ + µ mod 4, and n 1 + λµ = 4. Then ν 2 (λ + µ)ν + λµ /4 = n/c Z and ν n/c 1. Gary Greaves Equiangular lines in Euclidean spaces 2/23
62 Killing Seidel matrices with three eigenvalues Theorem (GG, AM, JK, FS 215+) Let S be an n n Seidel matrix with spec. {[λ] a, [µ] b, [ν] c }. Suppose n 2 mod 4, λ + µ mod 4, and n 1 + λµ = 4. Then ν 2 (λ + µ)ν + λµ /4 = n/c Z and ν n/c 1. Corollary The candidate Seidel matrices with spectra {[ 5] 16, [5] 9, [7] 5 } and {[ 5] 26, [7] 7, [9] 9 } do not exist. Corollary Regular graphs with spectra {[11] 1, [2] 16, [ 3] 9, [ 4] 4 } and {[12] 1, [2] 16, [ 3] 8, [ 4] 5 } do not exist. Gary Greaves Equiangular lines in Euclidean spaces 2/23
63 Case study: equiangular lines in R 14 Let S be the Seidel matrix with spectrum {[ 5] 16, [5] 9, [7] 5 }. The matrix M := S 2 25I has spectrum {[] 25, [24] 5 }. M = 28J 24I 2(AJ + JA) + 4(A 2 + A) mod 4. M is positive semidefinite and M ii = 4 = M ij {, ±4}. Deduce M is switching equivalent to 4J 6 I 5. Evaluating [S 3 ] 11 in two different ways gives the bound. Gary Greaves Equiangular lines in Euclidean spaces 21/23
64 Conclusion N(14) {28, 29} and N(16) {4, 41}. Show that 3 (42) equiangular lines in R 14 (R 16 ) implies that the associated Seidel matrix has spectrum {[ 5] 16, [5] 9, [7] 5 } ({[ 5] 26, [7] 7, [9] 9 }). Kill the corresponding Seidel matrices with three eigenvalues. Can we construct or kill other Seidel matrices with three eigenvalues? What about {[ 5] 43, [11] 9, [12] 1, [13] 8 }? (N(18) = 61?) Gary Greaves Equiangular lines in Euclidean spaces 22/23
65 Feasible Seidel matrices with 3 eigenvalues n d λ µ ν Existence Remark [ 5] 14 [3] 7 [7] 7 Y 3 14 [ 5] 16 [5] 9 [7] 5 N 4 16 [ 5] 24 [5] 6 [9] 1? 4 16 [ 5] 24 [7] 15 [15] 1 Y [ 5] 26 [7] 7 [9] 9 N [ 5] 31 [7] 8 [11] 9 Y [ 5] 32 [9] 16 [16] 1? [ 5] 3 [3] 6 [11] 12? [ 5] 3 [7] 16 [19] 2? [ 5] 36 [7] 9 [13] 9? 6 18 [ 5] 42 [11] 15 [15] 3? coclique removal? [ 5] 53 [13] 16 [19] 3 Y [ 5] 56 [1] 1 [15] 18? from {[ 5] 57, [15] 19 } 9 2 [ 5] 7 [13] 5 [19] 15? 95 2 [ 5] 75 [14] 1 [19] 19? from {[ 5] 76, [19] 2 } Gary Greaves Equiangular lines in Euclidean spaces 23/23
Graphs 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 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 informationarxiv: v3 [math.co] 15 Jul 2017
SYMMETRIC AND SKEW-SYMMETRIC {0,±1}-MATRICES WITH LARGE DETERMINANTS arxiv:1601.02769v3 [math.co] 15 Jul 2017 GARY GREAVES AND SHO SUDA Abstract. We show that the existence of {±1}-matrices having largest
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 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 informationMa/CS 6b Class 23: Eigenvalues in Regular Graphs
Ma/CS 6b Class 3: Eigenvalues in Regular Graphs By Adam Sheffer Recall: The Spectrum of a Graph Consider a graph G = V, E and let A be the adjacency matrix of G. The eigenvalues of G are the eigenvalues
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 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 informationOn a lower bound on the Laplacian eigenvalues of a graph
On a lower bound on the Laplacian eigenvalues of a graph Akihiro Munemasa (joint work with Gary Greaves and Anni Peng) Graduate School of Information Sciences Tohoku University May 22, 2016 JCCA 2016,
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 informationInequalities for matrices and the L-intersecting problem
Inequalities for matrices and the L-intersecting problem Richard M. Wilson California Institute of Technology Pasadena, CA 91125, USA Systems of Lines WPI, August 10, 2015 The L-intersecting problem Given
More informationHadamard and conference matrices
Hadamard and conference matrices Peter J. Cameron December 2011 with input from Dennis Lin, Will Orrick and Gordon Royle Hadamard s theorem Let H be an n n matrix, all of whose entries are at most 1 in
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 informationMa/CS 6b Class 20: Spectral Graph Theory
Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Eigenvalues and Eigenvectors A an n n matrix of real numbers. The eigenvalues of A are the numbers λ such that Ax = λx for some nonzero vector x
More informationButson-Hadamard matrices in association schemes of class 6 on Galois rings of characteristic 4
Butson-Hadamard matrices in association schemes of class 6 on Galois rings of characteristic 4 Akihiro Munemasa Tohoku University (joint work with Takuya Ikuta) November 17, 2017 Combinatorics Seminar
More informationProgram (Day 1) Spectral mapping theorem and asymptotic behavior of quantum walks on infinite graphs
Program (Day 1) Nov.29 (Fri) Kawai Hall, Dept. of Math., Tohoku Univ. 9:25 9:30 10:10 10:20 11:00 11:10 11:50 14:00 14:40 14:50 15:30 15:40 16:30 18:00 Opening Address from Chair Spectral mapping theorem
More informationA new upper bound on the clique number of a strongly regular graph
A new upper bound on the clique number of a strongly regular graph Leonard Soicher Queen Mary University of London LSBU Maths Study Group 2017 New Year Lecture Leonard Soicher (QMUL) Clique number of an
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 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 informationOn fat Hoffman graphs with smallest eigenvalue at least 3
On fat Hoffman graphs with smallest eigenvalue at least 3 Qianqian Yang University of Science and Technology of China Ninth Shanghai Conference on Combinatorics Shanghai Jiaotong University May 24-28,
More informationThe Interlace Polynomial of Graphs at 1
The Interlace Polynomial of Graphs at 1 PN Balister B Bollobás J Cutler L Pebody July 3, 2002 Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152 USA Abstract In this paper we
More informationMa/CS 6b Class 20: Spectral Graph Theory
Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Recall: Parity of a Permutation S n the set of permutations of 1,2,, n. A permutation σ S n is even if it can be written as a composition of an
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 informationAALBORG UNIVERSITY. Directed strongly regular graphs with rank 5. Leif Kjær Jørgensen. Department of Mathematical Sciences. Aalborg University
AALBORG UNIVERSITY Directed strongly regular graphs with ran 5 by Leif Kjær Jørgensen R-2014-05 May 2014 Department of Mathematical Sciences Aalborg University Fredri Bajers Vej G DK - 9220 Aalborg Øst
More informationLinear Algebra and its Applications
Linear Algebra and its Applications xxx (2008) xxx xxx Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa Graphs with three distinct
More informationHadamard and conference matrices
Hadamard and conference matrices Peter J. Cameron University of St Andrews & Queen Mary University of London Mathematics Study Group with input from Rosemary Bailey, Katarzyna Filipiak, Joachim Kunert,
More informationPrimitive Digraphs with Smallest Large Exponent
Primitive Digraphs with Smallest Large Exponent by Shahla Nasserasr B.Sc., University of Tabriz, Iran 1999 A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of MASTER OF SCIENCE
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 informationCONSTRUCTION OF DIRECTED STRONGLY REGULAR GRAPHS USING FINITE INCIDENCE STRUCTURES
CONSTRUCTION OF DIRECTED STRONGLY REGULAR GRAPHS USING FINITE INCIDENCE STRUCTURES OKTAY OLMEZ AND SUNG Y. SONG Abstract. We use finite incident structures to construct new infinite families of directed
More informationPROBLEMS ON LINEAR ALGEBRA
1 Basic Linear Algebra PROBLEMS ON LINEAR ALGEBRA 1. Let M n be the (2n + 1) (2n + 1) for which 0, i = j (M n ) ij = 1, i j 1,..., n (mod 2n + 1) 1, i j n + 1,..., 2n (mod 2n + 1). Find the rank of M n.
More informationHadamard and conference matrices
Hadamard and conference matrices Peter J. Cameron University of St Andrews & Queen Mary University of London Mathematics Study Group with input from Rosemary Bailey, Katarzyna Filipiak, Joachim Kunert,
More informationGeometry. Ubiquitous Angles in Equiangular Sets of Lines. B. Guiduli 1 and M. Rosenfeld Preface (by M.R.)
Discrete Comput Geom 24:313 324 (2000) DOI: 10.1007/s004540010038 Discrete & Computational Geometry 2000 Springer-Verlag New York Inc. Ubiquitous Angles in Equiangular Sets of Lines B. Guiduli 1 and M.
More informationImproved bounds on book crossing numbers of complete bipartite graphs via semidefinite programming
Improved bounds on book crossing numbers of complete bipartite graphs via semidefinite programming Etienne de Klerk, Dima Pasechnik, and Gelasio Salazar NTU, Singapore, and Tilburg University, The Netherlands
More informationConstructive proof of deficiency theorem of (g, f)-factor
SCIENCE CHINA Mathematics. ARTICLES. doi: 10.1007/s11425-010-0079-6 Constructive proof of deficiency theorem of (g, f)-factor LU HongLiang 1, & YU QingLin 2 1 Center for Combinatorics, LPMC, Nankai University,
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 informationA lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo
A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo A. E. Brouwer & W. H. Haemers 2008-02-28 Abstract We show that if µ j is the j-th largest Laplacian eigenvalue, and d
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 informationGENERATING SETS KEITH CONRAD
GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors
More informationMath 2070BC Term 2 Weeks 1 13 Lecture Notes
Math 2070BC 2017 18 Term 2 Weeks 1 13 Lecture Notes Keywords: group operation multiplication associative identity element inverse commutative abelian group Special Linear Group order infinite order cyclic
More informationRoot systems and optimal block designs
Root systems and optimal block designs Peter J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, UK p.j.cameron@qmul.ac.uk Abstract Motivated by a question
More informationA Colin de Verdiere-Type Invariant and Odd-K 4 - and Odd-K3 2 -Free Signed Graphs
A Colin de Verdiere-Type Invariant and Odd-K 4 - and Odd-K3 2 -Free Signed Graphs Hein van der Holst Georgia State University Conference honouring Robin s 50th birthday Joint work with Marina Arav, Frank
More informationLaplacian Integral Graphs with Maximum Degree 3
Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,
More information18.S34 linear algebra problems (2007)
18.S34 linear algebra problems (2007) Useful ideas for evaluating determinants 1. Row reduction, expanding by minors, or combinations thereof; sometimes these are useful in combination with an induction
More informationThe Graph Realization Problem
The Graph Realization Problem via Semi-Definite Programming A. Y. Alfakih alfakih@uwindsor.ca Mathematics and Statistics University of Windsor The Graph Realization Problem p.1/21 The Graph Realization
More informationSelf-complementary strongly regular graphs revisited
Self-complementary strongly regular graphs revisited Ferenc Szöllősi (joint work in part with Patric Östergård) szoferi@gmail.com Department of Communications and Networking, Aalto University Talk at CoCoA15
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 informationEigenvalues and edge-connectivity of regular graphs
Eigenvalues and edge-connectivity of regular graphs Sebastian M. Cioabă University of Delaware Department of Mathematical Sciences Newark DE 19716, USA cioaba@math.udel.edu August 3, 009 Abstract In this
More informationCartesian Products of Z-Matrix Networks: Factorization and Interval Analysis
Nabi-Abdolyouse) Factorization University (Distributed andofinterval Washington Space Analysis Systems1 Lab / 27(D Cartesian Products of Z-Matrix Networks: Factorization and Interval Analysis Airlie Chapman
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 informationCritical Groups for Cayley Graphs of Bent Functions
Critical Groups for Cayley Graphs of Bent Functions Thomas F. Gruebl Adviser: David Joyner December 9, 2015 1 Introduction This paper will study the critical group of bent functions in the p-ary case.
More informationBipartite graphs with five eigenvalues and pseudo designs
J Algebr Comb (2012) 36:209 221 DOI 10.1007/s10801-011-0331-3 Bipartite graphs with five eigenvalues and pseudo designs Ebrahim Ghorbani Received: 20 November 2010 / Accepted: 11 November 2011 / Published
More informationCSL361 Problem set 4: Basic linear algebra
CSL361 Problem set 4: Basic linear algebra February 21, 2017 [Note:] If the numerical matrix computations turn out to be tedious, you may use the function rref in Matlab. 1 Row-reduced echelon matrices
More informationA Study of Linear Programming Bounds for Spherical Codes. A Major Qualifying Project Report. submitted to the Faculty. of the
Project Number: MA-WJM-4801 A Study of Linear Programming Bounds for Spherical Codes A Major Qualifying Project Report submitted to the Faculty of the WORCESTER POLYTECHNIC INSTITUTE in partial fulfillment
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 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 information--------------------------------------------------------------------------------------------- Math 6023 Topics: Design and Graph Theory ---------------------------------------------------------------------------------------------
More informationOn the Dynamic Chromatic Number of Graphs
On the Dynamic Chromatic Number of Graphs Maryam Ghanbari Joint Work with S. Akbari and S. Jahanbekam Sharif University of Technology m_phonix@math.sharif.ir 1. Introduction Let G be a graph. A vertex
More informationSDP and eigenvalue bounds for the graph partition problem
SDP and eigenvalue bounds for the graph partition problem Renata Sotirov and Edwin van Dam Tilburg University, The Netherlands Outline... the graph partition problem Outline... the graph partition problem
More informationThe candidates are advised that they must always show their working, otherwise they will not be awarded full marks for their answers.
MID SWEDEN UNIVERSITY TFM Examinations 2006 MAAB16 Discrete Mathematics B Duration: 5 hours Date: 7 June 2006 There are EIGHT questions on this paper and you should answer as many as you can in the time
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 informationFRAMES, GRAPHS AND ERASURES
FRAMES, GRAPHS AND ERASURES BERNHARD G. BODMANN AND VERN I. PAULSEN Abstract. Two-uniform frames and their use for the coding of vectors are the main subject of this paper. These frames are known to be
More informationAutomorphisms of strongly regular graphs and PDS in Abelian groups
Automorphisms of strongly regular graphs and PDS in Abelian groups Zeying Wang Department of Mathematical Sciences Michigan Technological University Joint work with Stefaan De Winter and Ellen Kamischke
More informationarxiv: v2 [math.fa] 11 Nov 2016
PARTITIONS OF EQUIANGULAR TIGHT FRAMES JAMES ROSADO, HIEU D. NGUYEN, AND LEI CAO arxiv:1610.06654v [math.fa] 11 Nov 016 Abstract. We present a new efficient algorithm to construct partitions of a special
More informationToughness, connectivity and the spectrum of regular graphs
Outline Toughness, connectivity and the spectrum of regular graphs Xiaofeng Gu (University of West Georgia) Joint work with S.M. Cioabă (University of Delaware) AEGT, August 7, 2017 Outline Outline 1 Toughness
More informationLecture 10. Semidefinite Programs and the Max-Cut Problem Max Cut
Lecture 10 Semidefinite Programs and the Max-Cut Problem In this class we will finally introduce the content from the second half of the course title, Semidefinite Programs We will first motivate the discussion
More informationLaplacians of Graphs, Spectra and Laplacian polynomials
Laplacians of Graphs, Spectra and Laplacian polynomials Lector: Alexander Mednykh Sobolev Institute of Mathematics Novosibirsk State University Winter School in Harmonic Functions on Graphs and Combinatorial
More informationNOTE ON THE SKEW ENERGY OF ORIENTED GRAPHS. Communicated by Ivan Gutman. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 4 No. 1 (2015), pp. 57-61. c 2015 University of Isfahan www.combinatorics.ir www.ui.ac.ir NOTE ON THE SKEW ENERGY OF
More informationOn graphs with smallest eigenvalue at least 3 and their lattices
On graphs with smallest eigenvalue at least 3 and their lattices arxiv:1804.00369v1 [math.co] 2 Apr 2018 e-mail: Jack H. Koolen, Jae Young Yang, Qianqian Yang School of Mathematical Sciences, University
More informationA Study of Linear Programming Bounds for Spherical Codes. A Major Qualifying Project Report. submitted to the Faculty. of the
Project Number: MA-WJM-4801 A Study of Linear Programming Bounds for Spherical Codes A Major Qualifying Project Report submitted to the Faculty of the WORCESTER POLYTECHNIC INSTITUTE in partial fulfillment
More informationHOMEWORK #2 - MATH 3260
HOMEWORK # - MATH 36 ASSIGNED: JANUARAY 3, 3 DUE: FEBRUARY 1, AT :3PM 1) a) Give by listing the sequence of vertices 4 Hamiltonian cycles in K 9 no two of which have an edge in common. Solution: Here is
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 informationMcGill University Faculty of Science. Solutions to Practice Final Examination Math 240 Discrete Structures 1. Time: 3 hours Marked out of 60
McGill University Faculty of Science Solutions to Practice Final Examination Math 40 Discrete Structures Time: hours Marked out of 60 Question. [6] Prove that the statement (p q) (q r) (p r) is a contradiction
More informationChapter 2 Spectra of Finite Graphs
Chapter 2 Spectra of Finite Graphs 2.1 Characteristic Polynomials Let G = (V, E) be a finite graph on n = V vertices. Numbering the vertices, we write down its adjacency matrix in an explicit form of n
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 informationClassification of root systems
Classification of root systems September 8, 2017 1 Introduction These notes are an approximate outline of some of the material to be covered on Thursday, April 9; Tuesday, April 14; and Thursday, April
More informationThe energy of integral circulant graphs
Applied Linear Algebra ALA 200 Faculty of Sciences and Mathematics University of Niš, Serbia Novi Sad, May 200 Graph energy Integral circulant graphs Recent applications Let G be a simple graph with n
More informationa(b + c) = ab + ac a, b, c k
Lecture 2. The Categories of Vector Spaces PCMI Summer 2015 Undergraduate Lectures on Flag Varieties Lecture 2. We discuss the categories of vector spaces and linear maps. Since vector spaces are always
More informationLaplacian and Random Walks on Graphs
Laplacian and Random Walks on Graphs Linyuan Lu University of South Carolina Selected Topics on Spectral Graph Theory (II) Nankai University, Tianjin, May 22, 2014 Five talks Selected Topics on Spectral
More informationNon-existence of strongly regular graphs with feasible block graph parameters of quasi-symmetric designs
Non-existence of strongly regular graphs with feasible block graph parameters of quasi-symmetric designs Rajendra M. Pawale, Mohan S. Shrikhande*, Shubhada M. Nyayate August 22, 2015 Abstract A quasi-symmetric
More informationIntroduction to Semidefinite Programming I: Basic properties a
Introduction to Semidefinite Programming I: Basic properties and variations on the Goemans-Williamson approximation algorithm for max-cut MFO seminar on Semidefinite Programming May 30, 2010 Semidefinite
More informationConceptual Questions for Review
Conceptual Questions for Review Chapter 1 1.1 Which vectors are linear combinations of v = (3, 1) and w = (4, 3)? 1.2 Compare the dot product of v = (3, 1) and w = (4, 3) to the product of their lengths.
More informationAn Introduction to Spectral Graph Theory
An Introduction to Spectral Graph Theory Mackenzie Wheeler Supervisor: Dr. Gary MacGillivray University of Victoria WheelerM@uvic.ca Outline Outline 1. How many walks are there from vertices v i to v j
More informationThe Matrix-Tree Theorem
The Matrix-Tree Theorem Christopher Eur March 22, 2015 Abstract: We give a brief introduction to graph theory in light of linear algebra. Our results culminates in the proof of Matrix-Tree Theorem. 1 Preliminaries
More informationElementary linear algebra
Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The
More informationA Solution to the Checkerboard Problem
A Solution to the Checkerboard Problem Futaba Okamoto Mathematics Department, University of Wisconsin La Crosse, La Crosse, WI 5460 Ebrahim Salehi Department of Mathematical Sciences, University of Nevada
More informationDeterminant of the distance matrix of a tree with matrix weights
Determinant of the distance matrix of a tree with matrix weights R. B. Bapat Indian Statistical Institute New Delhi, 110016, India fax: 91-11-26856779, e-mail: rbb@isid.ac.in Abstract Let T be a tree with
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 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 informationRegular factors of regular graphs from eigenvalues
Regular factors of regular graphs from eigenvalues Hongliang Lu Center for Combinatorics, LPMC Nankai University, Tianjin, China Abstract Let m and r be two integers. Let G be a connected r-regular graph
More informationA linear algebraic view of partition regular matrices
A linear algebraic view of partition regular matrices Leslie Hogben Jillian McLeod June 7, 3 4 5 6 7 8 9 Abstract Rado showed that a rational matrix is partition regular over N if and only if it satisfies
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 informationRecitation 8: Graphs and Adjacency Matrices
Math 1b TA: Padraic Bartlett Recitation 8: Graphs and Adjacency Matrices Week 8 Caltech 2011 1 Random Question Suppose you take a large triangle XY Z, and divide it up with straight line segments into
More informationSupplementary Notes March 23, The subgroup Ω for orthogonal groups
The subgroup Ω for orthogonal groups 18.704 Supplementary Notes March 23, 2005 In the case of the linear group, it is shown in the text that P SL(n, F ) (that is, the group SL(n) of determinant one matrices,
More informationOn certain Regular Maps with Automorphism group PSL(2, p) Martin Downs
BULLETIN OF THE GREEK MATHEMATICAL SOCIETY Volume 53, 2007 (59 67) On certain Regular Maps with Automorphism group PSL(2, p) Martin Downs Received 18/04/2007 Accepted 03/10/2007 Abstract Let p be any prime
More informationMATH 2200 Final Review
MATH 00 Final Review Thomas Goller December 7, 01 1 Exam Format The final exam will consist of 8-10 proofs It will take place on Tuesday, December 11, from 10:30 AM - 1:30 PM, in the usual room Topics
More informationMATH 423 Linear Algebra II Lecture 20: Geometry of linear transformations. Eigenvalues and eigenvectors. Characteristic polynomial.
MATH 423 Linear Algebra II Lecture 20: Geometry of linear transformations. Eigenvalues and eigenvectors. Characteristic polynomial. Geometric properties of determinants 2 2 determinants and plane geometry
More informationTilburg University. Strongly Regular Graphs with Maximal Energy Haemers, W. H. Publication date: Link to publication
Tilburg University Strongly Regular Graphs with Maximal Energy Haemers, W. H. Publication date: 2007 Link to publication Citation for published version (APA): Haemers, W. H. (2007). Strongly Regular Graphs
More informationarxiv: v4 [math.co] 12 Feb 2017
arxiv:1511.03511v4 [math.co] 12 Feb 2017 On the signed graphs with two distinct eigenvalues F. Ramezani 1 Department of Mathematics, K.N.Toosi University of Technology, Tehran, Iran P.O. Box 16315-1618
More informationLecture Semidefinite Programming and Graph Partitioning
Approximation Algorithms and Hardness of Approximation April 16, 013 Lecture 14 Lecturer: Alantha Newman Scribes: Marwa El Halabi 1 Semidefinite Programming and Graph Partitioning In previous lectures,
More informationApproximation Algorithms
Approximation Algorithms Chapter 26 Semidefinite Programming Zacharias Pitouras 1 Introduction LP place a good lower bound on OPT for NP-hard problems Are there other ways of doing this? Vector programs
More information