Complex Hadamard Matrices and Combinatorial Structures
|
|
- Ἡσίοδος Καλλιγάς
- 5 χρόνια πριν
- Προβολές:
Transcript
1 Complex Hadamard Matrices and Combinatorial Structures Ada Chan Abstract Forty years ago, Goethals and Seidel showed that if the adjacency algebra of a strongly regular graph X contains a Hadamard matrix then X is of Latin square type or of negative Latin square type [8]. We extend their result to complex Hadamard matrices and find only three additional families of parameters for which the strongly regular graphs have complex Hadamard matrices in their adjacency algebras. We see that there are only three distance regular covers of complete graphs that give complex Hadamard matrices. 1 Introduction An n n complex matrix W is type II if n x=1 W (a, x) W (b, x) = { n if a = b, 0 otherwise. (1) We say W is type II equivalent to W if W = MW N for some invertible monomial matrices M and N. Type II matrices were introduced by Sylvester as inverse orthogonal matrices in [13]. In [11], Jones defined spin models to be matrices that satisfy three types of conditions corresponding to the three Reidemeister moves on link diagrams. Spin models give link invariants. For example, the Potts model is the n n matrix u 3 I + u 1 (J I), where (u 2 +u 2 ) 2 = n and J is the matrix of all ones, and it gives evaluations of Jones polynomial. Condition (1) corresponds to the second Reidemeister move, hence the term type II matrices. 1
2 A connection to combinatorics comes in Nomura s construction of association schemes from type II matrices. Further, type II matrices arise from various interesting combinatorial objects [2]. If all entries of an n n type II matrix W has absolute value 1, then (1) is equivalent to W W T = ni. In this case, W is a complex Hadamard matrix. Two complex Hadamard matrices are equivalent if they are type II equivalent. Apart from being a generalization of (real) Hadamard matrices, complex Hadamard matrices have applications in quantum information theory, operator theory and combinatorics, see [14], [15] and [16]. We are motivated to construct infinite families of complex Hadamard matrices, and to classify the complex Hadamard matrices of small sizes. An mn mn complex Hadamard matrix is of Diţă-type if it is equivalent to a complex Hadamard matrix of the form U(1, 1)V 1 U(1, 2)V 2... U(1, n)v n U(2, 1)V 1 U(2, 2)V 2... U(2, n)v n U(n, 1)V 1 U(n, 2)V 2... U(n, n)v n for some n n complex Hadamard matrix U and m m complex Hadamard matrices V 1,..., V n, see [5]. This construction is a special case of the generalized tensor product of type II matrices (U 1,..., U m ) (V 1,..., V n ) defined by Hosoya and Suzuki [9]. Diţă s construction gives most of the parametric families of complex Hadamard matrices in the catalogue of small complex Hadamard matrices [16]. To compile the catalogue, it is useful to know if a complex Hadamard matrix if of Diţă-type. Goethals and Seidel determined the parameters of strongly regular graphs that contain (real) Hadamard matrices in their adjacency algebras - they are of Latin square type and of negative Latin square type. In this paper, we show that there are only three more families of parameters for which the strongly regular graphs give complex Hadamard matrices. The Seidel matrices of these graphs are either regular two-graphs or the neighbourhoods of regular two-graphs. The situation is different for for distance regular covers of complete graphs. There are only finitely many such graphs that give complex Hadamard matrices. 2
3 2 Nomura Algebra Let W be an n n type II matrix. For a, b = 1,..., n, define vector Y a,b by Y a,b (x) = W (x, a) W (x, b) for x = 1,..., n. (2) The Nomura algebra of W is the set N W = {M : Y a,b is an eigenvector of M, for a, b = 1,..., n}. If follows immediately that N W contains I. The type II condition (1) of W implies J N W. So the dimension of N W is at least two. Jaeger et al. [10] showed that N W is a commutative matrix algebra that is also closed under the entrywise product and transpose. Any algebra that satisfies all these conditions has a basis of 01-matrices A = {A 0, A 1,..., A d } satisfying 1. A 0 = I. 2. d i=0 A i = J. 3. A T i A, for i = 0,..., d. 4. A i A j lies in the span of A, for i, j = 0,..., d. 5. A i A j = A j A i, for i, j = 0,..., d. We call A an association scheme with d classes and the span of A the Bose- Mesner algebra of A. When d = 1, A = {I, J I} and we say its Bose-Mesner algebra is trivial. When d = 2 and A 1 is symmetric, A = {I, A(X), A(X)} for some strongly regular graph X. 2.1 Theorem. [10] If W is a type II matrix then N W is the Bose-Mesner algebra of an association scheme. Here is a result about the Nomura algebras of equivalent type II matrices. 2.2 Theorem. [10] Suppose W 1 = P 1 D 1 W D 2 P 2, where D 1 and D 2 are invertible diagonal matrices, and P 1 and P 2 are permutation matrices. Then N W1 = P 1 N W P T 1. 3
4 We see that the dimension of N W is an invariant for equivalent complex Hadamard matrices. In particular, we have this following observation [1]. 2.3 Proposition. Let W be a complex Hadamard matrix. If N W is trivial then W is not of Diţă-type. A type II matrix W with two distinct entries a and b, where a ±b, is a linear combination of J and the incidence matrix of a symmetric design [2]. Szöllősi [15] showed that the Hadamard designs and the Menon designs are the only ones that give complex Hadamard matrices. We know that N W is trivial if the symmetric design has at least four points [2]. 2.4 Proposition. Suppose W is a complex Hadamard matrix of the form (t 1)N +J, where N is the incidence matrix of a symmetric (n, k, λ)-design. If n > 3 and t 1, then W is not of Diţă-type. Suppose C is a generalized conference matrix with minimal polynomial z 2 βz (n 1). When t satisfies t + t 1 + β = 0, ti + C is a type II matrix. If follows that t = 1 if and only if β R and β 2. Observe that a symmetric generalized conference matrix is a regular two-graph. Sankey [12] showed that for a regular two-graph C, the type II matrix ti + C has trivial Nomura algebra if β ± Proposition. Let C be a regular two-graph with minimal polynomial z 2 βz (n 1). If β < 2 and t + t 1 + β = 0 then the complex Hadamard matrix ti + C is not of Diţă-type. 3 Strongly Regular Graphs A strongly regular graph with parameters (v, k, a, c) is a k-regular graph X, that is not complete, in which every pair of adjacent vertices have a common neighbours and every pair of distinct non-adjacent vertices have c common neighbours. The adjacency matrix of X, A(X), satisfies A(X) 2 (a c)a(x) (k c)i = cj. Observe that A(X) is the incidence matrix of a symmetric (v, k, c)-design when a c = 0. 4
5 Since X is k-regular, k is an eigenvalue of A(X) with eigenvector 1. Let θ and τ be the other two eigenvalues of A(X). The eigenvectors of A(X) for θ and τ are orthogonal to 1, hence θ and τ are the roots of z 2 (a c)z (k c) = 0. We conclude that θτ = c k is non-zero when c < k, that is when X is not isomorphic to the complement of mk k+1, for some integer m 2. If X is not isomorphic to mk k+1 nor its complement then, without loss of generality, we have k > θ > 0 > τ. Further, if X is not a conference graph then θ and τ are integers, see [6]. Note that X is a strongly regular graph with parameters (v, v k 1, v 2 2k + c, v 2k + a) and A(X) = J I A(X) has eigenvalues (v k 1), ( 1 τ) and ( 1 θ). From the quadratic above, we see that c = k + θτ, The multiplicity of θ and τ are m θ = a = k + θτ + θ + τ, and v = (k θ)(k τ). k + θτ (v 1)τ + k τ θ and m τ = (v 1)θ + k. θ τ respectively. The integrality of m θ and m τ impose a necessary condition on (v, k, a, c) for the existence of the strongly regular graph [6]. We list all type II matrices in the Bose-Mesner algebra of X. 3.1 Theorem. [2] Let X be a strongly regular graph with v > 4 vertices, valency k, and eigenvalues k, θ and τ, where θ 0 > τ. Suppose W := I + xa(x) + ya(x). Then W is a type-ii matrix if and only if one of the following holds (a) y = x = 1 2 (2 v ± v 2 4v) and W is the Potts model. (b) x = 1 2 (2 v ± v 2 4v) and y = (1 + xk)/(x + k), and X is isomorphic to mk k+1 for some m > 1. 5
6 (c) x = 1 and y = v + 2(1 + θ)(1 + τ) ± v 2 + 4v(1 + θ)(1 + τ), 2(1 + θ)(1 + τ) and A(X) is the incidence matrix of a symmetric (v, v k 1, λ)-design where λ = v k 1 + (1 + θ)(1 + τ)). (d) x = 1 and y = v + 2θ2 + 2 ± (v 4)(v 4θ 2 ), 2(1 + θ)(1 + τ) and A(X) is the incidence matrix of a symmetric (v, k, k + θτ)-design. (e) x + x 1 is a zero of the quadratic with and θτz 2 + αz + β + 2θτ (3) α = v(θ + τ + 1) + (θ + τ) 2, β = v + v(1 + θ + τ) 2 2θ 2 2θτ 2τ 2 y = θτx3 [v(θ + τ + 1) 2θ 2τ 1]x 2 (v + 2θ + 2τ + τθ)x 1 (x 2. 1)(1 + θ)(1 + τ) In the first two cases, x 1 for v > 4. In case (c), A(X) is the incidence matrix of a symmetric design, hence ( 1 θ) + ( 1 τ) = 0. In Case (d), A(X) is the incidence matrix of a symmetric design, so θ + τ = 0. We have the following lemma for the all cases. 3.2 Lemma. Suppose X is a strongly regular graph with v > 4 vertices that is not isomorphic to mk k+1 nor mk k+1. Suppose v 2k. Let (x, y) be a solution given by Theorem 3.1. If x = 1 then θ + τ { 2, 1, 0}. 6
7 Proof. Theorem 3.1 (e) is the only case we need to consider. Let = α 2 + 4θτ(β + 2θτ). Solving the quadratic in (3) gives x + x 1 = α ±. 2θτ If x = 1 then x + x 1 = x + x R and 2 x + x 1 2. We assume 0 in this proof. If θ + τ 1, then α + 4θτ + = v(θ + τ + 1) + (θ + τ) 2 + 4θτ + > 0. 2v θτ + 4(k + θτ) It follows that α < 2. 2θτ Note that θ > 0, so the expression ( (α + 4θτ) ) ( (α + 4θτ) + ) = 4θτ(v 4)(θ + τ) 2 > 0. We conclude that α + 4θτ > 0 and α + 2θτ < 2. Thus x + x 1 < 2 and x 1. Suppose θ + τ 3. Consider α 4θτ = (θ + τ)(v + θ + τ) + v 4θτ. Since v + θ + τ = v + a c > 0, we have α 4θτ 3(v + θ + τ) + v 4θτ. Substituting θ + τ = a c and θτ = c k gives α 4θτ 2(v 2k) c 3a < 0. It follows that α + > 2. 2θτ Now the expression ( (α 4θτ) ) ( (α 4θτ) + ) = 4θτv(θ + τ + 2) 2 > 0. 7
8 We see that α 4θτ + < 0, so α 2θτ > 2. Therefore x + x 1 > 2 and x Theorem. Let X be a strongly regular graph with v > 4 vertices, valency k, and eigenvalues k, θ and τ where θ 0 > τ. Let W = I + xa(x) + ya(x) where (x, y) is a solution from Theorem 3.1. The W is a complex Hadamard matrix if and only if X or X has one of the following parameters: i (4θ 2, 2θ 2 θ, θ 2 θ, θ 2 θ) ii (4θ 2, 2θ 2 + θ, θ 2 + θ, θ 2 + θ) iii (4θ 2 1, 2θ 2, θ 2, θ 2 ) iv (4θ 2 + 4θ + 1, 2θ 2 + 2θ, θ 2 + θ 1, θ 2 + θ). v (4θ 2 + 4θ + 2, 2θ 2 + θ, θ 2 1, θ 2 ) Proof. Observe that θ + τ = 0 if and only if ( 1 τ) + ( 1 θ) = 2. By Lemma 3.2, it is sufficient to consider only the strongly regular graphs with θ + τ = 0 or θ + τ = 1. When θ + τ = 0, the quadratic in (3) gives x + x 1 = 2 or x + x 1 = ( v + 2θ2 ) θ 2. The former gives x = 1, and Theorem 3.1 (d) gives y = v + 2θ2 + 2 ± (v 4)(v 4θ 2 ) 2(1 θ 2. ) Note that when v < 4θ 2, y R and y = 1. Setting y = 1, we get (θ 2 1)(v 4θ 2 ) = 0. If θ = τ = 1 then v = k + 1 and X is complete. We conclude that y = 1 if and only if v = 4θ 2. On the other hand, setting y = 1 gives (v 4)(1 θ 2 ) = 0 which never occurs. We see that y = 1 if and only if v 4θ 2. 8
9 When x + x 1 v + 2θ2 = θ 2 which is real, we have x + x 1 2 if and only if v 4θ 2. Thus x = 1 when v 4θ 2. Simplifying v = (k θ)(k + θ) k θ 2 4θ 2 gives [k (2θ 2 θ)][k (2θ 2 + θ)] 0. Then we have 2θ 2 θ k 2θ 2 + θ. The integrality of m θ = 1 2 (v 1 k θ ) implies θ k. Hence k can be 2θ2 θ, 2θ 2 or 2θ 2 + θ, which give parameter set in (i), (iii) and (ii), respectively. Now (i) and (ii) are parameter sets for Latin-square graphs L θ (2θ) and negative Latin-square graphs NL θ (2θ), respectively. As expected from [8], Theomem (3.1) gives only Hadamard matrices. For parameter set (iii), we get x = 1 and y = 2θ2 3 ± 4θ 2 5i 2(θ 2, (4) 1) or and by Theorem 3.1 (e) y = 1 x x 1 x = 2θ2 + 1 ± 4θ 2 1i 2θ 2 ( θτx 1 (1 + θ)(1 + τ) (x + x v) (v 2)x 2 ) = 1. In all cases, x = y = 1. We now consider θ + τ = 1. If X is a conference graph then we get the parameter set (iv) and or x = y 1 = 1 ± (2θ + 1)(2θ + 3)i 2(θ + 1) x = y 1 = 1 ± (2θ + 1)(2θ 1)i. (6) 2θ It follows that x = y = 1. We assume θ is a positive integer. Theorem 3.1 (e) gives x + x 1 = 1 ± (2θ + 1) 4 4vθ(θ + 1) 2θ(θ + 1) 9 (5)
10 which is real if and only if We see that v v = (2θ + 1)4 4θ(θ + 1) = 1 4θ2 + 4θ θ(θ + 1) (k θ)(k + θ + 1) k θ(θ + 1) 4θ 2 + 4θ + 2. After simplification, this inequality becomes (k 2θ 2 θ)(k 2θ 2 3θ 1) 0. Hence we have 2θ 2 + θ k 2θ 2 + 3θ + 1. Now write k = 2θ 2 + θ + h for some integer 0 h 2θ + 1. Then v = (2θ2 + h)(2θ 2 + 2θ h) θ 2 + h = 4θ 2 + 4θ h(h 2θ 1) θ 2. + h For v Z, either h = 0, h = 2θ + 1, or (θ 2 + h) (h(h 2θ 1)). If h(h 2θ 1) 0 then the last condition implies θ 2 + h h(h 2θ 1). Now the inequality θ 2 + h h(h 2θ 1) = (θ 2 + h) + h(h 2θ 1) = (θ h) 2 0 holds if and only if h = θ. When h = θ and k = 2θ 2 + 2θ, we get parameter set (iv) and X is a conference graph. When h = 2θ + 1, X has parameter set (v). When h = 0, X has parameter set (v). In this case, (3) gives x+x 1 = 0 or θ 1 (1+θ) 1. We have x = ±i and y = x 1, or x = 1 ± 4θ 2 (θ + 1) 2 1 i 2θ(θ + 1) and y = x 1 = 1 4θ 2 (θ + 1) 2 1 i 2θ(θ + 1) In all cases, x = y = 1. We remark on the parameter sets that give complex Hadamard matrices with non-real entries. 1. Let X be a strongly regular graph with parameters (4θ 2 1, 2θ 2, θ 2, θ 2 ). The symplectic graph Sp(2r), for r 1, is an infinity family of graphs with these parameters [6]. Graphs of these parameters also arise from Steiner system S(2, θ, 2θ 2 θ). 10
11 Let S(X) = J I 2A(X) be the Seidel matrix of X. Then ( ) 0 1 T T = 1 S(X) is a regular two-graph with minimal polynomial z 2 + 2z (4θ 2 1). It is a generalized conference matrix with β = 2 and T + I is a Hadamard matrix. The solution in (4) is the same as the one given by Theorem 4.1 of [15]. We see in Proposition 5.2 that the complex Hadamard matrices obtained from these graphs, for θ 2, are not of Diţă-type. 2. Let X be a strongly regular graph with parameters (4θ 2 + 4θ + 1, 2θ 2 + 2θ, θ 2 + θ 1, θ 2 + θ). The Paley graphs have parameters of this form. Graphs of these parameters also arise from orthogonal arrays OA(θ + 1, 2θ + 1). Let S(X) be the Seidel matrix of X. Then ( ) 0 1 T T = 1 S(X) is a regular two-graph with minimal polynomial z 2 (2θ + 1) 2. Thus T is a conference matrix and the solutions in (5) and (6) are the same as the one given by Theorem 3.1 of [15]. When θ 2 + θ > 2, N W is trivial [3]. By Proposition 2.3 the complex Hadamard matrices obtained from these graphs are not of Diţă-type. 3. Let X be a strongly regular graph with parameter set (4θ 2 + 4θ + 2, 2θ 2 + θ, θ 2 1, θ 2 ). A construction of these graph when 2θ + 1 is prime power can be found in [4]. Graphs of these parameters also arise from Steiner system S(2, θ + 1, 2θ 2 + 2θ + 1). The Seidel matrix of X is a regular two-graph, hence a generalized conference matrix with β = 0. The complex Hadamard matrices with x = y 1 = ±i were constructed by Turyn in [17]. From Proposition 2.5, these complex Hadamard matrices are not of Diţă-type. 11
12 When x = 1 ± 4θ 2 (θ + 1) 2 1 i 2θ(θ + 1) and y = x 1 = 1 4θ 2 (θ + 1) 2 1 i, 2θ(θ + 1) we see in Proposition 5.3 that I + xa(x) + ya(x) is not of Diţă-type. 4 Covers of Complete Graphs A graph X of diameter d is antipodal if the relation at distance 0 or d is an equivalence relation. We are interested in the distance regular graphs with diameter three that are antipodal. These are the distance regular covers of complete graphs. There are three parameters (n, r, c 2 ) associated with each of these graphs where n is the number of equivalence classes; r is the size of each equivalence classes; and every pair of vertices at distance two have c 2 common neighbours. The intersection numbers of X depend on n, r and c 2, in particular, a 1 = n 2 (r 1)c 2. Let X be an antipodal distance-regular graph of diameter three of parameters (n, r, c 2 ). The adjacency matrix of X has four eigenvalues: n 1, 1, θ = δ + δ 2 + 4(n 1), and τ = δ δ 2 + 4(n 1), 2 2 where δ = n 2 rc Lemma. [7] If δ = 0 then θ = τ = n 1. Otherwise, θ and τ are integers. From Theorem 9.1 and its proof in [2], we see that 4.2 Lemma. [2] For i = 1, 2, 3, let A i be the i-th distance matrix of an antipodal distance regular graph of diameter three with parameters (n, r, c 2 ). Then W = I + xa 1 + ya 2 + za 3 is type II if and only if the following system of equations have a solution: ( (1 x (r 1)y + (r 1)z) 1 1 ) (r 1) (r 1) + = nr, (7) x y z (1 + θx θy z)(1 + θ x θ y 1 ) = nr, (8) z (1 + τx τy z)(1 + τ x τ y 1 ) = nr. (9) z 12
13 To get complex Hadamard matrices, we add the condition x = y = z = Lemma. If the system of equations in Lemma 4.2 has a solution satisfying x = y = z = 1 then n 16. Proof. Assume x = y = z = 1. Then for α {x, y, z, x y, x z, y z }, we have α + α 1 R and α + α 1 2. Expanding the right-hand side of Equation (7) gives nr = 2 + 2(r 1) 2 (x + 1 x ) (r 1)(y + 1 y ) + (r 1)(z + 1 z ) +(r 1)( y x + x y ) (r 1)(x z + z x ) (r 1)2 ( z y + y z ) 4r 2. (10) Similarly, Equations (8) and (9) yield nr = 2 + 2θ 2 + θ(x + 1 x ) θ(y + 1 y ) (z + 1 z ) θ2 ( y x + x y ) θ( z x + x z ) + θ( z y + y z ) 4(1 + θ) 2 (11) and nr = 2 + 2τ 2 + τ(x + 1 x ) τ(y + 1 y ) (z + 1 z ) τ 2 ( y x + x y ) τ( z x + x z ) + τ( z y + y z ) 2 + 2τ 2 2τ 2τ τ 2 2τ 2τ = 4(1 τ) 2, (12) respectively. When δ 2, the expression n 2 16(1 τ) 2 = n 2 4(δ 2) 2 4(δ 2 + 4(n 1)) + 8(δ 2) δ 2 + 4(n 1) n 2 4(δ 2) 2 4(δ 2 + 4(n 1)) + 8(δ 2)δ = n(n 16). If n 17 then n 2 > 16(1 τ) 2, it follows from (12) that n > 4r. When δ = 1, we have τ = 1 4n 3 2 and nr 4(1 τ) 2 = 4n n 3 < 4n + 4 n. When n 17, r n = 4 and (10) does not hold. 13
14 When δ = 0, θ = τ = n 1. Adding both sides of Equations (8) and (9) gives 2nr = 4n 2(z + 1 z ) 2(n 1)( y x + x y ) 8n. Hence r 4 and (10) does not hold for n 17. When δ = 1, we have θ = 1+ 4n 3 2 and nr 4(1 + θ) 2 = 4n n 3. Using the same argument for δ = 1, we see that if n 17 then nr 4(1+θ) 2 implies n > 4r. When δ 2, the expression n 2 16(1 + θ) 2 = n 2 8δ 2 16δ 16n 8(δ + 2) δ 2 + 4(n 1) n 2 16n 8δ 2 16δ 8(δ + 2)( δ) = n(n 16). If n 17 then n 2 > 16(1 + θ) 2, but (11) gives n > 4r. We conclude that when n 17, (10), (11) and (12) do not hold simultaneously. 4.4 Theorem. There are only finitely many antipodal distance-regular graphs of diameter three where the span of {I, A 1, A 2, A 3 } contains a complex Hadamard matrix. Proof. Since a 1 0, we have (r 1)c 2 n 2. Therefore, there are only finitely many parameter sets (n, r, c 2 ) where n 16. Computations in Maple revealed only three graphs that give complex Hadamard matrices: 1. The cycle on six vertices: its parameters are (3, 2, 1) and We get the matrix F 6 in [16]. y = 1 ± 3 i, z = ±i, x = yz The cube: its parameters are (4, 2, 2) and x = ±i, y = 1 and z = x. We get the complex Hadamard matrix ( ) 3 1 i i 1 14
15 3. The line graph of the Petersen graph: its parameters are (5, 3, 1) and x = 1, y = 7 ± 15 i, z = 1; 8 x = 5 ± 11 i, y = 1, z = x; or 6 x = 1 ± 15 i, y = x 1, z = 1. 4 Computation in Maple showed that N W is trivial for all (x, y) given here. By Proposition 2.3, none of these matrices is of Diţă-type. 5 Computation Let X be a strongly regular graph that has parameters in Cases (c) and (e) of Theorem 3.1. We show that the complex Hadamard matrix in the adjacency algebra of X is not of Diţă-type. We adapt the computation in [3] to these strongly regular graphs. The following is Lemma 3.1 of [3] which was phrased for conference graphs but the statement applies to all strongly regular graphs. 5.1 Lemma. Let X be a strongly regular graph on v 5 vertices with degree k 2. Let W = I + xa(x) + ya(x) be a complex Hadamard matrix. If the Hermitian product < Y α,β, Y γ,α > is non-zero for all adjacent vertices α and β and for all γ α, β, then N W is trivial. Let α, β and γ be vertices of a strongly regular graph X with parameters (v, k, a, c). For x α {α, ᾱ}, x β {β, β} and x γ {γ, γ}, we define Γ xαx β x γ to be the set of vertices that are adjacent (not adjacent) to x v if x v = v (x v = v, respectively), for v = α, β, γ. For instance Γ αβγ is the set of common neighbours of α, β and γ while Γ αβ γ is the set of common neighbours of α and β that are not adjacent to γ. Now the vertex set of X is partitioned into {α, β, γ} Γ αβγ Γᾱβγ Γ α βγ Γ αβ γ Γ α β γ Γᾱβ γ Γᾱ βγ Γᾱ β γ. Let W = I + xa(x) + ya(x) be a complex Hadamard matrix. From (2), we have Y α,β (u)y γ,α (u) = Y α,β (u)y α,γ (u) = 15 W (u, α) 2 W (u, β)w (u, γ).
16 It is easy to verify that 1 if u Γ αβγ Γᾱ β γ xy 1 if u Γ αβ γ Γ α βγ Y α,β (u)y γ,α (u) = x 1 y if u Γᾱβ γ Γᾱ βγ x 2 y 2 if u Γᾱβγ x 2 y 2 if u Γ α β γ. Hence the Hermitian product < Y α,β, Y γ,α > = 1 W (β, α)2 + W (α, β)w (α, γ) W (β, γ) + (13) W (γ, α) 2 W (γ, β) + Γ αβγ Γᾱ β γ + Γ α βγ Γ αβ γ xy 1 + Γᾱβ γ Γᾱ βγ x 1 y + Γᾱβγ x 2 y 2 + Γ α β γ x 2 y 2. In the following computation, we let α and β be adjacent vertices in X. 1. We first consider the case where γ is adjacent to both α and β. Then W (α, β) = W (α, γ) = W (β, γ) = x. We use Γ v to denote the set of neighbours of v in X. Then we get Γ α = Γ αβγ Γ α βγ Γ αβ γ Γ α β γ {β, γ} Γ β = Γ αβγ Γᾱβγ Γ αβ γ Γᾱβ γ {α, γ} Γ γ = Γ αβγ Γᾱβγ Γ α βγ Γᾱ βγ {α, β} Γ α Γ β = Γ αβγ Γ αβ γ {γ} Γ α Γ γ = Γ αβγ Γ α βγ {β} Γ β Γ γ = Γ αβγ Γᾱβγ {α} V (X) = Γ αβγ Γᾱβγ Γ α βγ Γ αβ γ Γ α β γ Γᾱβ γ Γᾱ βγ Γᾱ β γ {α, β, γ}. Now we translate the above to the following system of equations. k = Γ αβγ + Γ α βγ + Γ αβ γ + Γ α β γ +2 k = Γ αβγ + Γᾱβγ + Γ αβ γ + Γᾱβ γ +2 k = Γ αβγ + Γᾱβγ + Γ α βγ + Γᾱ βγ +2 a = Γ αβγ + Γ αβ γ +1 a = Γ αβγ + Γ α βγ +1 a = Γ αβγ + Γᾱβγ +1 v = Γ αβγ + Γᾱβγ + Γ α βγ + Γ αβ γ + Γ α β γ + Γᾱβ γ + Γᾱ βγ + Γᾱ β γ
17 Solving this system of equations, we get Γ αβγ = m, Γᾱβγ = Γ α βγ = Γ αβ γ = a 1 m, Γ α β γ = Γᾱβ γ = Γᾱ βγ = k 2a + m, and Γᾱ β γ = v 3k + 3a m, for some integer m. Using Equation (13), we have < Y α,β, Y γ,α > (14) = x 2 + 2x + (v 3k + 3a) + 2(a 1 m)xy 1 + 2(k 2a + m)x 1 y +(a 1 m)x 2 y 2 + (k 2a + m)x 2 y Suppose γ is adjacent to α but not to β which gives We get W (α, β) = W (α, γ) = x and W (β, γ) = y. k = Γ αβγ + Γ α βγ + Γ αβ γ + Γ α β γ +2 k = Γ αβγ + Γᾱβγ + Γ αβ γ + Γᾱβ γ +1 k = Γ αβγ + Γᾱβγ + Γ α βγ + Γᾱ βγ +1 a = Γ αβγ + Γ αβ γ a = Γ αβγ + Γ α βγ c = Γ αβγ + Γᾱβγ +1 v = Γ αβγ + Γᾱβγ + Γ α βγ + Γ αβ γ + Γ α β γ + Γᾱβ γ + Γᾱ βγ + Γᾱ β γ +3. Solving this system of equations yields Γ αβγ = m, Γᾱβγ = c 1 m Γ α βγ = Γ αβ γ = a m, Γ α β γ = k 2a 2 + m Γᾱβ γ = Γᾱ βγ = k a c + m, and Γᾱ β γ = v 3k + 2a + c m, for some integer m. Using Equation (13), we have < Y α,β, Y γ,α > (15) = x 2 + 2x 2 y 1 + (v 3k + 2a + c) + 2(a m)xy 1 +2(k a c + m)x 1 y + (c 1 m)x 2 y 2 + (k 2a 2 + m)x 2 y 2. 17
18 3. Suppose γ is adjacent to β but not to α which gives We get W (α, β) = W (β, γ) = x and W (α, γ) = y. k = Γ αβγ + Γ α βγ + Γ αβ γ + Γ α β γ +1 k = Γ αβγ + Γᾱβγ + Γ αβ γ + Γᾱβ γ +2 k = Γ αβγ + Γᾱβγ + Γ α βγ + Γᾱ βγ +1 a = Γ αβγ + Γ αβ γ c = Γ αβγ + Γ α βγ +1 a = Γ αβγ + Γᾱβγ v = Γ αβγ + Γᾱβγ + Γ α βγ + Γ αβ γ + Γ α β γ + Γᾱβ γ + Γᾱ βγ + Γᾱ β γ +3. Solving this system of equations gives Γ αβγ = m, Γᾱβγ = Γ αβ γ = a m, Γ α βγ = c 1 m, Γ α β γ = Γᾱ βγ = k a c + m, Γᾱβ γ = k 2a 2 + m, and Γᾱ β γ = v 3k + 2a + c m, for some integer m. Using Equation (13), we have < Y α,β, Y γ,α > (16) = x 1 y 1 + x + x 1 y 2 + (v 3k + 2a + c) + (a + c 1 2m)xy 1 +(2k 3a c 2 + 2m)x 1 y + (a m)x 2 y 2 + (k a c + m)x 2 y Suppose γ is not adjacent to α nor to β which gives W (α, β) = x and W (α, γ) = W (β, γ) = y. We get k = Γ αβγ + Γ α βγ + Γ αβ γ + Γ α β γ +1 k = Γ αβγ + Γᾱβγ + Γ αβ γ + Γᾱβ γ +1 k = Γ αβγ + Γᾱβγ + Γ α βγ + Γᾱ βγ a = Γ αβγ + Γ αβ γ c = Γ αβγ + Γ α βγ c = Γ αβγ + Γᾱβγ v = Γ αβγ + Γᾱβγ + Γ α βγ + Γ αβ γ + Γ α β γ + Γᾱβ γ + Γᾱ βγ + Γᾱ β γ
19 Solving this system of equations, we get Γ αβγ = m, Γᾱβγ = Γ α βγ = c m, Γ αβ γ = a m, Γ α β γ = Γᾱβ γ = k a c 1 + m, Γᾱ βγ = k 2c + m, and Γᾱ β γ = v 3k + a + 2c 1 m, for some integer m. Using Equation (13), we have < Y α,β, Y γ,α > (17) = x 1 y 1 + y + x 2 y 1 + (v 3k + 2a + c 1) + (a + c 2m)xy 1 +(2k a 3c 1 + 2m)x 1 y + (c m)x 2 y 2 + (k a c 1 + m)x 2 y Proposition. Let X be a strongly regular graph with parameters Let W = I + xa(x) + ya(x) where or (4θ 2 1, 2θ 2, θ 2, θ 2 ), for θ 2. x = 1 and y = 2θ2 3 ± 4θ 2 5 i 2(θ 2 1) x = 2θ2 + 1 ± 4θ 2 1 i 2θ 2 and y = 1. Then N W is trivial. Consequently, W is not of Diţă-type. Proof. Suppose x = 1 and y = 2θ2 3 ± 4θ 2 5 i 2(θ 2. 1) Using Equation (15), the real part of < Y α,β, Y γ,α > is (4θ 2 5)(θ 2 3) 2(θ 2 1) 2. Using Equations (14), (16) and (17), the real part of < Y α,β, Y γ,α > is (4θ 2 5) 2(θ 2 1) 19
20 for all the other vertex γ in V (X)\{α, β}. If θ 2 then < Y α,β, Y γ,α > 0 for all γ α, β. By Lemma 5.1, N W is trivial. Suppose x = 2θ2 + 1 ± 4θ 2 1 i 2θ 2 and y = 1. Using Equations (14), (15), (16) and (17), the real part of < Y α,β, Y γ,α > is (4θ 2 1) 2θ 2 which is non-zero for γ α, β and for θ 1. By Lemma 5.1, N W is trivial. 5.3 Proposition. Let X be a strongly regular graph with parameters Let W = I + xa(x) + ya(x) where (4θ 2 + 4θ + 2, 2θ 2 + θ, θ 2 1, θ 2 ). x = 1 ± 4θ 2 (θ + 1) 2 1 i 2θ(θ + 1) and y = x 1 = 1 4θ 2 (θ + 1) 2 1 i 2θ(θ + 1) Then N W is trivial. Consequently, W is not of Diţă-type. Proof. If γ is adjacent to both α and β then, by Equation (14), the real part of < Y α,β, Y γ,α > is (θ 2 + θ + 1)(2θ 2 + 2θ + 1)(2θ 2 + 2θ 1) 2θ 3 (1 + θ) 3. If γ is adjacent to α but not to β then by Equation (15), the real part of < Y α,β, Y γ,α > is (2θ 2 + 2θ 1)(2θ 2 + 2θ + 1)(θ 4 + 2θ 3 θ 1) 2θ 4 (1 + θ) 4. If γ is not adjacent to α then by Equations (16) and (17), the real part of < Y α,β, Y γ,α > is (2θ 2 + 2θ 1)(2θ 2 + 2θ + 1) 2θ 2 (1 + θ) 2. We have < Y α,β, Y γ,α > 0, for γ α, β and for θ 1. By Lemma 5.1, N W is trivial. 20
21 References [1] Chan, A. Nomura algebra of diţă-type complex Hadamard matrices. in preparation. [2] Chan, A., and Godsil, C. Type II matrices and combinatorial structures. Combinatorica 30, 1 (2010), [3] Chan, A., and Hosoya, R. Type-II matrices attached to conference graphs. J. Algebraic Combin. 20, 3 (2004), [4] Delsarte, P., and Goethals, J.-M. Alternating bilinear forms over GF (q). J. Combinatorial Theory Ser. A 19 (1975), [5] Diţă, P. Some results on the parametrization of complex Hadamard matrices. J. Phys. A 37, 20 (2004), [6] Godsil, C., and Royle, G. Algebraic graph theory, vol. 207 of Graduate Texts in Mathematics. Springer-Verlag, New York, [7] Godsil, C. D., and Hensel, A. D. Distance regular covers of the complete graph. J. Combin. Theory Ser. B 56, 2 (1992), [8] Goethals, J.-M., and Seidel, J. J. Strongly regular graphs derived from combinatorial designs. Canad. J. Math. 22 (1970), [9] Hosoya, R., and Suzuki, H. Type II matrices and their Bose-Mesner algebras. J. Algebraic Combin. 17, 1 (2003), [10] Jaeger, F., Matsumoto, M., and Nomura, K. Bose-Mesner algebras related to type II matrices and spin models. J. Algebraic Combin. 8, 1 (1998), [11] Jones, V. F. R. On knot invariants related to some statistical mechanical models. Pacific J. Math. 137, 2 (1989), [12] Sankey, A. D. Type II matrices in weighted Bose-Mesner algebras of ranks 2 and 3. J. Algebraic Combin. 32, 1 (2010), [13] Sylvester, J. J. Thoughts on inverse orthogonal matrices, simultaneous sign-successions, and tessellated pavements two or more colors, with applications to newton s rule, ornamental tile-work, and the theory of numbers. Phil. Mag. 34 (1867),
22 [14] Szöllősi, F. Parametrizing complex Hadamard matrices. European J. Combin. 29, 5 (2008), [15] Szöllősi, F. Exotic complex Hadamard matrices. Cryptogr. Commun. 2, 2 (2010), [16] Tadej, W., and Życzkowski, K. A concise guide to complex Hadamard matrices. Open Syst. Inf. Dyn. 13, 2 (2006), [17] Turyn, R. J. Complex Hadamard matrices. In Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta., 1969). Gordon and Breach, New York, 1970, pp
EE512: Error Control Coding
EE512: Error Control Coding Solution for Assignment on Finite Fields February 16, 2007 1. (a) Addition and Multiplication tables for GF (5) and GF (7) are shown in Tables 1 and 2. + 0 1 2 3 4 0 0 1 2 3
Διαβάστε περισσότερα2 Composition. Invertible Mappings
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan Composition. Invertible Mappings In this section we discuss two procedures for creating new mappings from old ones, namely,
Διαβάστε περισσότεραMatrices and Determinants
Matrices and Determinants SUBJECTIVE PROBLEMS: Q 1. For what value of k do the following system of equations possess a non-trivial (i.e., not all zero) solution over the set of rationals Q? x + ky + 3z
Διαβάστε περισσότεραCongruence Classes of Invertible Matrices of Order 3 over F 2
International Journal of Algebra, Vol. 8, 24, no. 5, 239-246 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/.2988/ija.24.422 Congruence Classes of Invertible Matrices of Order 3 over F 2 Ligong An and
Διαβάστε περισσότεραExample Sheet 3 Solutions
Example Sheet 3 Solutions. i Regular Sturm-Liouville. ii Singular Sturm-Liouville mixed boundary conditions. iii Not Sturm-Liouville ODE is not in Sturm-Liouville form. iv Regular Sturm-Liouville note
Διαβάστε περισσότεραEvery set of first-order formulas is equivalent to an independent set
Every set of first-order formulas is equivalent to an independent set May 6, 2008 Abstract A set of first-order formulas, whatever the cardinality of the set of symbols, is equivalent to an independent
Διαβάστε περισσότεραChapter 6: Systems of Linear Differential. be continuous functions on the interval
Chapter 6: Systems of Linear Differential Equations Let a (t), a 2 (t),..., a nn (t), b (t), b 2 (t),..., b n (t) be continuous functions on the interval I. The system of n first-order differential equations
Διαβάστε περισσότεραNowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in
Nowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in : tail in X, head in A nowhere-zero Γ-flow is a Γ-circulation such that
Διαβάστε περισσότεραSection 8.3 Trigonometric Equations
99 Section 8. Trigonometric Equations Objective 1: Solve Equations Involving One Trigonometric Function. In this section and the next, we will exple how to solving equations involving trigonometric functions.
Διαβάστε περισσότεραST5224: Advanced Statistical Theory II
ST5224: Advanced Statistical Theory II 2014/2015: Semester II Tutorial 7 1. Let X be a sample from a population P and consider testing hypotheses H 0 : P = P 0 versus H 1 : P = P 1, where P j is a known
Διαβάστε περισσότεραHomework 3 Solutions
Homework 3 Solutions Igor Yanovsky (Math 151A TA) Problem 1: Compute the absolute error and relative error in approximations of p by p. (Use calculator!) a) p π, p 22/7; b) p π, p 3.141. Solution: For
Διαβάστε περισσότερα6.1. Dirac Equation. Hamiltonian. Dirac Eq.
6.1. Dirac Equation Ref: M.Kaku, Quantum Field Theory, Oxford Univ Press (1993) η μν = η μν = diag(1, -1, -1, -1) p 0 = p 0 p = p i = -p i p μ p μ = p 0 p 0 + p i p i = E c 2 - p 2 = (m c) 2 H = c p 2
Διαβάστε περισσότεραC.S. 430 Assignment 6, Sample Solutions
C.S. 430 Assignment 6, Sample Solutions Paul Liu November 15, 2007 Note that these are sample solutions only; in many cases there were many acceptable answers. 1 Reynolds Problem 10.1 1.1 Normal-order
Διαβάστε περισσότεραNew bounds for spherical two-distance sets and equiangular lines
New bounds for spherical two-distance sets and equiangular lines Michigan State University Oct 8-31, 016 Anhui University Definition If X = {x 1, x,, x N } S n 1 (unit sphere in R n ) and x i, x j = a
Διαβάστε περισσότεραQuadratic Expressions
Quadratic Expressions. The standard form of a quadratic equation is ax + bx + c = 0 where a, b, c R and a 0. The roots of ax + bx + c = 0 are b ± b a 4ac. 3. For the equation ax +bx+c = 0, sum of the roots
Διαβάστε περισσότεραPartial Differential Equations in Biology The boundary element method. March 26, 2013
The boundary element method March 26, 203 Introduction and notation The problem: u = f in D R d u = ϕ in Γ D u n = g on Γ N, where D = Γ D Γ N, Γ D Γ N = (possibly, Γ D = [Neumann problem] or Γ N = [Dirichlet
Διαβάστε περισσότεραReminders: linear functions
Reminders: linear functions Let U and V be vector spaces over the same field F. Definition A function f : U V is linear if for every u 1, u 2 U, f (u 1 + u 2 ) = f (u 1 ) + f (u 2 ), and for every u U
Διαβάστε περισσότεραLecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3
Lecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3 1 State vector space and the dual space Space of wavefunctions The space of wavefunctions is the set of all
Διαβάστε περισσότεραCHAPTER 48 APPLICATIONS OF MATRICES AND DETERMINANTS
CHAPTER 48 APPLICATIONS OF MATRICES AND DETERMINANTS EXERCISE 01 Page 545 1. Use matrices to solve: 3x + 4y x + 5y + 7 3x + 4y x + 5y 7 Hence, 3 4 x 0 5 y 7 The inverse of 3 4 5 is: 1 5 4 1 5 4 15 8 3
Διαβάστε περισσότεραChapter 6: Systems of Linear Differential. be continuous functions on the interval
Chapter 6: Systems of Linear Differential Equations Let a (t), a 2 (t),..., a nn (t), b (t), b 2 (t),..., b n (t) be continuous functions on the interval I. The system of n first-order differential equations
Διαβάστε περισσότεραSCHOOL OF MATHEMATICAL SCIENCES G11LMA Linear Mathematics Examination Solutions
SCHOOL OF MATHEMATICAL SCIENCES GLMA Linear Mathematics 00- Examination Solutions. (a) i. ( + 5i)( i) = (6 + 5) + (5 )i = + i. Real part is, imaginary part is. (b) ii. + 5i i ( + 5i)( + i) = ( i)( + i)
Διαβάστε περισσότεραCHAPTER 25 SOLVING EQUATIONS BY ITERATIVE METHODS
CHAPTER 5 SOLVING EQUATIONS BY ITERATIVE METHODS EXERCISE 104 Page 8 1. Find the positive root of the equation x + 3x 5 = 0, correct to 3 significant figures, using the method of bisection. Let f(x) =
Διαβάστε περισσότερα4.6 Autoregressive Moving Average Model ARMA(1,1)
84 CHAPTER 4. STATIONARY TS MODELS 4.6 Autoregressive Moving Average Model ARMA(,) This section is an introduction to a wide class of models ARMA(p,q) which we will consider in more detail later in this
Διαβάστε περισσότερα2. THEORY OF EQUATIONS. PREVIOUS EAMCET Bits.
EAMCET-. THEORY OF EQUATIONS PREVIOUS EAMCET Bits. Each of the roots of the equation x 6x + 6x 5= are increased by k so that the new transformed equation does not contain term. Then k =... - 4. - Sol.
Διαβάστε περισσότεραStatistical Inference I Locally most powerful tests
Statistical Inference I Locally most powerful tests Shirsendu Mukherjee Department of Statistics, Asutosh College, Kolkata, India. shirsendu st@yahoo.co.in So far we have treated the testing of one-sided
Διαβάστε περισσότεραw o = R 1 p. (1) R = p =. = 1
Πανεπιστήµιο Κρήτης - Τµήµα Επιστήµης Υπολογιστών ΗΥ-570: Στατιστική Επεξεργασία Σήµατος 205 ιδάσκων : Α. Μουχτάρης Τριτη Σειρά Ασκήσεων Λύσεις Ασκηση 3. 5.2 (a) From the Wiener-Hopf equation we have:
Διαβάστε περισσότεραExercises 10. Find a fundamental matrix of the given system of equations. Also find the fundamental matrix Φ(t) satisfying Φ(0) = I. 1.
Exercises 0 More exercises are available in Elementary Differential Equations. If you have a problem to solve any of them, feel free to come to office hour. Problem Find a fundamental matrix of the given
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 19/5/2007
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Αν κάπου κάνετε κάποιες υποθέσεις να αναφερθούν στη σχετική ερώτηση. Όλα τα αρχεία που αναφέρονται στα προβλήματα βρίσκονται στον ίδιο φάκελο με το εκτελέσιμο
Διαβάστε περισσότεραTridiagonal matrices. Gérard MEURANT. October, 2008
Tridiagonal matrices Gérard MEURANT October, 2008 1 Similarity 2 Cholesy factorizations 3 Eigenvalues 4 Inverse Similarity Let α 1 ω 1 β 1 α 2 ω 2 T =......... β 2 α 1 ω 1 β 1 α and β i ω i, i = 1,...,
Διαβάστε περισσότεραOrdinal Arithmetic: Addition, Multiplication, Exponentiation and Limit
Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit Ting Zhang Stanford May 11, 2001 Stanford, 5/11/2001 1 Outline Ordinal Classification Ordinal Addition Ordinal Multiplication Ordinal
Διαβάστε περισσότεραLecture 15 - Root System Axiomatics
Lecture 15 - Root System Axiomatics Nov 1, 01 In this lecture we examine root systems from an axiomatic point of view. 1 Reflections If v R n, then it determines a hyperplane, denoted P v, through the
Διαβάστε περισσότεραInverse trigonometric functions & General Solution of Trigonometric Equations. ------------------ ----------------------------- -----------------
Inverse trigonometric functions & General Solution of Trigonometric Equations. 1. Sin ( ) = a) b) c) d) Ans b. Solution : Method 1. Ans a: 17 > 1 a) is rejected. w.k.t Sin ( sin ) = d is rejected. If sin
Διαβάστε περισσότεραFinite Field Problems: Solutions
Finite Field Problems: Solutions 1. Let f = x 2 +1 Z 11 [x] and let F = Z 11 [x]/(f), a field. Let Solution: F =11 2 = 121, so F = 121 1 = 120. The possible orders are the divisors of 120. Solution: The
Διαβάστε περισσότεραThe Simply Typed Lambda Calculus
Type Inference Instead of writing type annotations, can we use an algorithm to infer what the type annotations should be? That depends on the type system. For simple type systems the answer is yes, and
Διαβάστε περισσότεραOn a four-dimensional hyperbolic manifold with finite volume
BULETINUL ACADEMIEI DE ŞTIINŢE A REPUBLICII MOLDOVA. MATEMATICA Numbers 2(72) 3(73), 2013, Pages 80 89 ISSN 1024 7696 On a four-dimensional hyperbolic manifold with finite volume I.S.Gutsul Abstract. In
Διαβάστε περισσότεραA Note on Intuitionistic Fuzzy. Equivalence Relation
International Mathematical Forum, 5, 2010, no. 67, 3301-3307 A Note on Intuitionistic Fuzzy Equivalence Relation D. K. Basnet Dept. of Mathematics, Assam University Silchar-788011, Assam, India dkbasnet@rediffmail.com
Διαβάστε περισσότεραFractional Colorings and Zykov Products of graphs
Fractional Colorings and Zykov Products of graphs Who? Nichole Schimanski When? July 27, 2011 Graphs A graph, G, consists of a vertex set, V (G), and an edge set, E(G). V (G) is any finite set E(G) is
Διαβάστε περισσότεραOther Test Constructions: Likelihood Ratio & Bayes Tests
Other Test Constructions: Likelihood Ratio & Bayes Tests Side-Note: So far we have seen a few approaches for creating tests such as Neyman-Pearson Lemma ( most powerful tests of H 0 : θ = θ 0 vs H 1 :
Διαβάστε περισσότεραConcrete Mathematics Exercises from 30 September 2016
Concrete Mathematics Exercises from 30 September 2016 Silvio Capobianco Exercise 1.7 Let H(n) = J(n + 1) J(n). Equation (1.8) tells us that H(2n) = 2, and H(2n+1) = J(2n+2) J(2n+1) = (2J(n+1) 1) (2J(n)+1)
Διαβάστε περισσότεραCyclic or elementary abelian Covers of K 4
Cyclic or elementary abelian Covers of K 4 Yan-Quan Feng Mathematics, Beijing Jiaotong University Beijing 100044, P.R. China Summer School, Rogla, Slovenian 2011-06 Outline 1 Question 2 Main results 3
Διαβάστε περισσότεραPhys460.nb Solution for the t-dependent Schrodinger s equation How did we find the solution? (not required)
Phys460.nb 81 ψ n (t) is still the (same) eigenstate of H But for tdependent H. The answer is NO. 5.5.5. Solution for the tdependent Schrodinger s equation If we assume that at time t 0, the electron starts
Διαβάστε περισσότεραLecture 13 - Root Space Decomposition II
Lecture 13 - Root Space Decomposition II October 18, 2012 1 Review First let us recall the situation. Let g be a simple algebra, with maximal toral subalgebra h (which we are calling a CSA, or Cartan Subalgebra).
Διαβάστε περισσότεραNumerical Analysis FMN011
Numerical Analysis FMN011 Carmen Arévalo Lund University carmen@maths.lth.se Lecture 12 Periodic data A function g has period P if g(x + P ) = g(x) Model: Trigonometric polynomial of order M T M (x) =
Διαβάστε περισσότεραCoefficient Inequalities for a New Subclass of K-uniformly Convex Functions
International Journal of Computational Science and Mathematics. ISSN 0974-89 Volume, Number (00), pp. 67--75 International Research Publication House http://www.irphouse.com Coefficient Inequalities for
Διαβάστε περισσότεραk A = [k, k]( )[a 1, a 2 ] = [ka 1,ka 2 ] 4For the division of two intervals of confidence in R +
Chapter 3. Fuzzy Arithmetic 3- Fuzzy arithmetic: ~Addition(+) and subtraction (-): Let A = [a and B = [b, b in R If x [a and y [b, b than x+y [a +b +b Symbolically,we write A(+)B = [a (+)[b, b = [a +b
Διαβάστε περισσότεραCRASH COURSE IN PRECALCULUS
CRASH COURSE IN PRECALCULUS Shiah-Sen Wang The graphs are prepared by Chien-Lun Lai Based on : Precalculus: Mathematics for Calculus by J. Stuwart, L. Redin & S. Watson, 6th edition, 01, Brooks/Cole Chapter
Διαβάστε περισσότεραHomework 8 Model Solution Section
MATH 004 Homework Solution Homework 8 Model Solution Section 14.5 14.6. 14.5. Use the Chain Rule to find dz where z cosx + 4y), x 5t 4, y 1 t. dz dx + dy y sinx + 4y)0t + 4) sinx + 4y) 1t ) 0t + 4t ) sinx
Διαβάστε περισσότεραLecture 21: Properties and robustness of LSE
Lecture 21: Properties and robustness of LSE BLUE: Robustness of LSE against normality We now study properties of l τ β and σ 2 under assumption A2, i.e., without the normality assumption on ε. From Theorem
Διαβάστε περισσότεραProblem Set 3: Solutions
CMPSCI 69GG Applied Information Theory Fall 006 Problem Set 3: Solutions. [Cover and Thomas 7.] a Define the following notation, C I p xx; Y max X; Y C I p xx; Ỹ max I X; Ỹ We would like to show that C
Διαβάστε περισσότερα6.3 Forecasting ARMA processes
122 CHAPTER 6. ARMA MODELS 6.3 Forecasting ARMA processes The purpose of forecasting is to predict future values of a TS based on the data collected to the present. In this section we will discuss a linear
Διαβάστε περισσότεραSection 7.6 Double and Half Angle Formulas
09 Section 7. Double and Half Angle Fmulas To derive the double-angles fmulas, we will use the sum of two angles fmulas that we developed in the last section. We will let α θ and β θ: cos(θ) cos(θ + θ)
Διαβάστε περισσότερα3.4 SUM AND DIFFERENCE FORMULAS. NOTE: cos(α+β) cos α + cos β cos(α-β) cos α -cos β
3.4 SUM AND DIFFERENCE FORMULAS Page Theorem cos(αβ cos α cos β -sin α cos(α-β cos α cos β sin α NOTE: cos(αβ cos α cos β cos(α-β cos α -cos β Proof of cos(α-β cos α cos β sin α Let s use a unit circle
Διαβάστε περισσότεραSolution Series 9. i=1 x i and i=1 x i.
Lecturer: Prof. Dr. Mete SONER Coordinator: Yilin WANG Solution Series 9 Q1. Let α, β >, the p.d.f. of a beta distribution with parameters α and β is { Γ(α+β) Γ(α)Γ(β) f(x α, β) xα 1 (1 x) β 1 for < x
Διαβάστε περισσότεραSOLVING CUBICS AND QUARTICS BY RADICALS
SOLVING CUBICS AND QUARTICS BY RADICALS The purpose of this handout is to record the classical formulas expressing the roots of degree three and degree four polynomials in terms of radicals. We begin with
Διαβάστε περισσότεραAreas and Lengths in Polar Coordinates
Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the
Διαβάστε περισσότεραderivation of the Laplacian from rectangular to spherical coordinates
derivation of the Laplacian from rectangular to spherical coordinates swapnizzle 03-03- :5:43 We begin by recognizing the familiar conversion from rectangular to spherical coordinates (note that φ is used
Διαβάστε περισσότεραSpace-Time Symmetries
Chapter Space-Time Symmetries In classical fiel theory any continuous symmetry of the action generates a conserve current by Noether's proceure. If the Lagrangian is not invariant but only shifts by a
Διαβάστε περισσότεραANSWERSHEET (TOPIC = DIFFERENTIAL CALCULUS) COLLECTION #2. h 0 h h 0 h h 0 ( ) g k = g 0 + g 1 + g g 2009 =?
Teko Classes IITJEE/AIEEE Maths by SUHAAG SIR, Bhopal, Ph (0755) 3 00 000 www.tekoclasses.com ANSWERSHEET (TOPIC DIFFERENTIAL CALCULUS) COLLECTION # Question Type A.Single Correct Type Q. (A) Sol least
Διαβάστε περισσότεραORDINAL ARITHMETIC JULIAN J. SCHLÖDER
ORDINAL ARITHMETIC JULIAN J. SCHLÖDER Abstract. We define ordinal arithmetic and show laws of Left- Monotonicity, Associativity, Distributivity, some minor related properties and the Cantor Normal Form.
Διαβάστε περισσότεραPractice Exam 2. Conceptual Questions. 1. State a Basic identity and then verify it. (a) Identity: Solution: One identity is csc(θ) = 1
Conceptual Questions. State a Basic identity and then verify it. a) Identity: Solution: One identity is cscθ) = sinθ) Practice Exam b) Verification: Solution: Given the point of intersection x, y) of the
Διαβάστε περισσότερα( ) 2 and compare to M.
Problems and Solutions for Section 4.2 4.9 through 4.33) 4.9 Calculate the square root of the matrix 3!0 M!0 8 Hint: Let M / 2 a!b ; calculate M / 2!b c ) 2 and compare to M. Solution: Given: 3!0 M!0 8
Διαβάστε περισσότεραEcon 2110: Fall 2008 Suggested Solutions to Problem Set 8 questions or comments to Dan Fetter 1
Eon : Fall 8 Suggested Solutions to Problem Set 8 Email questions or omments to Dan Fetter Problem. Let X be a salar with density f(x, θ) (θx + θ) [ x ] with θ. (a) Find the most powerful level α test
Διαβάστε περισσότεραAreas and Lengths in Polar Coordinates
Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the
Διαβάστε περισσότεραHOMEWORK 4 = G. In order to plot the stress versus the stretch we define a normalized stretch:
HOMEWORK 4 Problem a For the fast loading case, we want to derive the relationship between P zz and λ z. We know that the nominal stress is expressed as: P zz = ψ λ z where λ z = λ λ z. Therefore, applying
Διαβάστε περισσότεραFourier Series. MATH 211, Calculus II. J. Robert Buchanan. Spring Department of Mathematics
Fourier Series MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Introduction Not all functions can be represented by Taylor series. f (k) (c) A Taylor series f (x) = (x c)
Διαβάστε περισσότεραJordan Form of a Square Matrix
Jordan Form of a Square Matrix Josh Engwer Texas Tech University josh.engwer@ttu.edu June 3 KEY CONCEPTS & DEFINITIONS: R Set of all real numbers C Set of all complex numbers = {a + bi : a b R and i =
Διαβάστε περισσότερα= λ 1 1 e. = λ 1 =12. has the properties e 1. e 3,V(Y
Stat 50 Homework Solutions Spring 005. (a λ λ λ 44 (b trace( λ + λ + λ 0 (c V (e x e e λ e e λ e (λ e by definition, the eigenvector e has the properties e λ e and e e. (d λ e e + λ e e + λ e e 8 6 4 4
Διαβάστε περισσότεραMATHEMATICS. 1. If A and B are square matrices of order 3 such that A = -1, B =3, then 3AB = 1) -9 2) -27 3) -81 4) 81
1. If A and B are square matrices of order 3 such that A = -1, B =3, then 3AB = 1) -9 2) -27 3) -81 4) 81 We know that KA = A If A is n th Order 3AB =3 3 A. B = 27 1 3 = 81 3 2. If A= 2 1 0 0 2 1 then
Διαβάστε περισσότεραSolutions to Exercise Sheet 5
Solutions to Eercise Sheet 5 jacques@ucsd.edu. Let X and Y be random variables with joint pdf f(, y) = 3y( + y) where and y. Determine each of the following probabilities. Solutions. a. P (X ). b. P (X
Διαβάστε περισσότεραSCITECH Volume 13, Issue 2 RESEARCH ORGANISATION Published online: March 29, 2018
Journal of rogressive Research in Mathematics(JRM) ISSN: 2395-028 SCITECH Volume 3, Issue 2 RESEARCH ORGANISATION ublished online: March 29, 208 Journal of rogressive Research in Mathematics www.scitecresearch.com/journals
Διαβάστε περισσότεραApproximation of distance between locations on earth given by latitude and longitude
Approximation of distance between locations on earth given by latitude and longitude Jan Behrens 2012-12-31 In this paper we shall provide a method to approximate distances between two points on earth
Διαβάστε περισσότεραOptimal Parameter in Hermitian and Skew-Hermitian Splitting Method for Certain Two-by-Two Block Matrices
Optimal Parameter in Hermitian and Skew-Hermitian Splitting Method for Certain Two-by-Two Block Matrices Chi-Kwong Li Department of Mathematics The College of William and Mary Williamsburg, Virginia 23187-8795
Διαβάστε περισσότεραΑπόκριση σε Μοναδιαία Ωστική Δύναμη (Unit Impulse) Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο. Απόστολος Σ.
Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο The time integral of a force is referred to as impulse, is determined by and is obtained from: Newton s 2 nd Law of motion states that the action
Διαβάστε περισσότεραGenerating Set of the Complete Semigroups of Binary Relations
Applied Mathematics 06 7 98-07 Published Online January 06 in SciRes http://wwwscirporg/journal/am http://dxdoiorg/036/am067009 Generating Set of the Complete Semigroups of Binary Relations Yasha iasamidze
Διαβάστε περισσότεραUniform Convergence of Fourier Series Michael Taylor
Uniform Convergence of Fourier Series Michael Taylor Given f L 1 T 1 ), we consider the partial sums of the Fourier series of f: N 1) S N fθ) = ˆfk)e ikθ. k= N A calculation gives the Dirichlet formula
Διαβάστε περισσότεραMath221: HW# 1 solutions
Math: HW# solutions Andy Royston October, 5 7.5.7, 3 rd Ed. We have a n = b n = a = fxdx = xdx =, x cos nxdx = x sin nx n sin nxdx n = cos nx n = n n, x sin nxdx = x cos nx n + cos nxdx n cos n = + sin
Διαβάστε περισσότερα2. Let H 1 and H 2 be Hilbert spaces and let T : H 1 H 2 be a bounded linear operator. Prove that [T (H 1 )] = N (T ). (6p)
Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: F3B, F4Sy, NVP 2005-03-08 Skrivtid: 9 14 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok
Διαβάστε περισσότεραPARTIAL NOTES for 6.1 Trigonometric Identities
PARTIAL NOTES for 6.1 Trigonometric Identities tanθ = sinθ cosθ cotθ = cosθ sinθ BASIC IDENTITIES cscθ = 1 sinθ secθ = 1 cosθ cotθ = 1 tanθ PYTHAGOREAN IDENTITIES sin θ + cos θ =1 tan θ +1= sec θ 1 + cot
Διαβάστε περισσότεραProblem Set 9 Solutions. θ + 1. θ 2 + cotθ ( ) sinθ e iφ is an eigenfunction of the ˆ L 2 operator. / θ 2. φ 2. sin 2 θ φ 2. ( ) = e iφ. = e iφ cosθ.
Chemistry 362 Dr Jean M Standard Problem Set 9 Solutions The ˆ L 2 operator is defined as Verify that the angular wavefunction Y θ,φ) Also verify that the eigenvalue is given by 2! 2 & L ˆ 2! 2 2 θ 2 +
Διαβάστε περισσότεραCommutative Monoids in Intuitionistic Fuzzy Sets
Commutative Monoids in Intuitionistic Fuzzy Sets S K Mala #1, Dr. MM Shanmugapriya *2 1 PhD Scholar in Mathematics, Karpagam University, Coimbatore, Tamilnadu- 641021 Assistant Professor of Mathematics,
Διαβάστε περισσότεραThe challenges of non-stable predicates
The challenges of non-stable predicates Consider a non-stable predicate Φ encoding, say, a safety property. We want to determine whether Φ holds for our program. The challenges of non-stable predicates
Διαβάστε περισσότερα1. Introduction and Preliminaries.
Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.yu/filomat Filomat 22:1 (2008), 97 106 ON δ SETS IN γ SPACES V. Renuka Devi and D. Sivaraj Abstract We
Διαβάστε περισσότεραSecond Order RLC Filters
ECEN 60 Circuits/Electronics Spring 007-0-07 P. Mathys Second Order RLC Filters RLC Lowpass Filter A passive RLC lowpass filter (LPF) circuit is shown in the following schematic. R L C v O (t) Using phasor
Διαβάστε περισσότεραMath 446 Homework 3 Solutions. (1). (i): Reverse triangle inequality for metrics: Let (X, d) be a metric space and let x, y, z X.
Math 446 Homework 3 Solutions. (1). (i): Reverse triangle inequalit for metrics: Let (X, d) be a metric space and let x,, z X. Prove that d(x, z) d(, z) d(x, ). (ii): Reverse triangle inequalit for norms:
Διαβάστε περισσότεραSecond Order Partial Differential Equations
Chapter 7 Second Order Partial Differential Equations 7.1 Introduction A second order linear PDE in two independent variables (x, y Ω can be written as A(x, y u x + B(x, y u xy + C(x, y u u u + D(x, y
Διαβάστε περισσότεραDIRECT PRODUCT AND WREATH PRODUCT OF TRANSFORMATION SEMIGROUPS
GANIT J. Bangladesh Math. oc. IN 606-694) 0) -7 DIRECT PRODUCT AND WREATH PRODUCT OF TRANFORMATION EMIGROUP ubrata Majumdar, * Kalyan Kumar Dey and Mohd. Altab Hossain Department of Mathematics University
Διαβάστε περισσότεραSection 9.2 Polar Equations and Graphs
180 Section 9. Polar Equations and Graphs In this section, we will be graphing polar equations on a polar grid. In the first few examples, we will write the polar equation in rectangular form to help identify
Διαβάστε περισσότερα9.09. # 1. Area inside the oval limaçon r = cos θ. To graph, start with θ = 0 so r = 6. Compute dr
9.9 #. Area inside the oval limaçon r = + cos. To graph, start with = so r =. Compute d = sin. Interesting points are where d vanishes, or at =,,, etc. For these values of we compute r:,,, and the values
Διαβάστε περισσότεραPg The perimeter is P = 3x The area of a triangle is. where b is the base, h is the height. In our case b = x, then the area is
Pg. 9. The perimeter is P = The area of a triangle is A = bh where b is the base, h is the height 0 h= btan 60 = b = b In our case b =, then the area is A = = 0. By Pythagorean theorem a + a = d a a =
Διαβάστε περισσότεραSrednicki Chapter 55
Srednicki Chapter 55 QFT Problems & Solutions A. George August 3, 03 Srednicki 55.. Use equations 55.3-55.0 and A i, A j ] = Π i, Π j ] = 0 (at equal times) to verify equations 55.-55.3. This is our third
Διαβάστε περισσότεραTrigonometric Formula Sheet
Trigonometric Formula Sheet Definition of the Trig Functions Right Triangle Definition Assume that: 0 < θ < or 0 < θ < 90 Unit Circle Definition Assume θ can be any angle. y x, y hypotenuse opposite θ
Διαβάστε περισσότεραSOME PROPERTIES OF FUZZY REAL NUMBERS
Sahand Communications in Mathematical Analysis (SCMA) Vol. 3 No. 1 (2016), 21-27 http://scma.maragheh.ac.ir SOME PROPERTIES OF FUZZY REAL NUMBERS BAYAZ DARABY 1 AND JAVAD JAFARI 2 Abstract. In the mathematical
Διαβάστε περισσότεραIf we restrict the domain of y = sin x to [ π, π ], the restrict function. y = sin x, π 2 x π 2
Chapter 3. Analytic Trigonometry 3.1 The inverse sine, cosine, and tangent functions 1. Review: Inverse function (1) f 1 (f(x)) = x for every x in the domain of f and f(f 1 (x)) = x for every x in the
Διαβάστε περισσότεραMATH423 String Theory Solutions 4. = 0 τ = f(s). (1) dτ ds = dxµ dτ f (s) (2) dτ 2 [f (s)] 2 + dxµ. dτ f (s) (3)
1. MATH43 String Theory Solutions 4 x = 0 τ = fs). 1) = = f s) ) x = x [f s)] + f s) 3) equation of motion is x = 0 if an only if f s) = 0 i.e. fs) = As + B with A, B constants. i.e. allowe reparametrisations
Διαβάστε περισσότεραLecture 2. Soundness and completeness of propositional logic
Lecture 2 Soundness and completeness of propositional logic February 9, 2004 1 Overview Review of natural deduction. Soundness and completeness. Semantics of propositional formulas. Soundness proof. Completeness
Διαβάστε περισσότεραOn Numerical Radius of Some Matrices
International Journal of Mathematical Analysis Vol., 08, no., 9-8 HIKARI Ltd, www.m-hikari.com https://doi.org/0.988/ijma.08.75 On Numerical Radius of Some Matrices Shyamasree Ghosh Dastidar Department
Διαβάστε περισσότεραLecture 10 - Representation Theory III: Theory of Weights
Lecture 10 - Representation Theory III: Theory of Weights February 18, 2012 1 Terminology One assumes a base = {α i } i has been chosen. Then a weight Λ with non-negative integral Dynkin coefficients Λ
Διαβάστε περισσότεραArithmetical applications of lagrangian interpolation. Tanguy Rivoal. Institut Fourier CNRS and Université de Grenoble 1
Arithmetical applications of lagrangian interpolation Tanguy Rivoal Institut Fourier CNRS and Université de Grenoble Conference Diophantine and Analytic Problems in Number Theory, The 00th anniversary
Διαβάστε περισσότεραMINIMAL CLOSED SETS AND MAXIMAL CLOSED SETS
MINIMAL CLOSED SETS AND MAXIMAL CLOSED SETS FUMIE NAKAOKA AND NOBUYUKI ODA Received 20 December 2005; Revised 28 May 2006; Accepted 6 August 2006 Some properties of minimal closed sets and maximal closed
Διαβάστε περισσότεραIf we restrict the domain of y = sin x to [ π 2, π 2
Chapter 3. Analytic Trigonometry 3.1 The inverse sine, cosine, and tangent functions 1. Review: Inverse function (1) f 1 (f(x)) = x for every x in the domain of f and f(f 1 (x)) = x for every x in the
Διαβάστε περισσότερα