Cyclic or elementary abelian Covers of K 4

Μέγεθος: px
Εμφάνιση ξεκινά από τη σελίδα:

Download "Cyclic or elementary abelian Covers of K 4"

Transcript

1 Cyclic or elementary abelian Covers of K 4 Yan-Quan Feng Mathematics, Beijing Jiaotong University Beijing , P.R. China Summer School, Rogla, Slovenian

2 Outline 1 Question 2 Main results 3 Automorphisms of K 4 4 Ideas for the proof of main results 5 References

3 Question Given a base graph X and a transformation group K, find all non-isomorphic covers such that a group G of automorphisms of X lifts. In this talk, we will give an example by letting X = K 4, K cyclic or elementary abelian, and G an arc-transitive group of K 4. Furthermore, an application of the above result is given to classify cubic symmetric graphs of certain orders.

4 Theorem 1: Let K be a cyclic or an elementary abelian group, and let X be a connected K -covering of the complete graph K 4 whose fibre-preserving subgroup is arc-transitive. Then, (1) if K is cyclic then X is 2-regular and isomorphic to the complete graph K 4, the 3-dimensional Hypercube Q 3, or the generalized Petersen graph P(8, 3). (2) If K is an elementary abelian group Z m p (p prime, m 2), then X is 2-regular and isomorphic to one of EK p 3. Theorem 2: Let X be a connected cubic symmetric graph of order 4p or 4p 2 (p a prime). Then X is isomorphic to the 3-dimensional Hypercube Q 3, the generalized Petersen graph P(8, 3) or P(10, 3), the Dodecahedron (3-regular), or the Coxeter graph C 28 (3-regular).

5 Y.-Q. Feng, J.H. Kwak / Journal of Combinatorial Theory, Series B 97 (2007) Automorphisms of K 4,4 α Fig. = 3. (ab)(cd) The complete graph β = K(bcd) 4 with voltage assignment γ = (bc) φ. A 4 = α, β S 4 = α, β, γ Aut(K 4 ) = S 4 able 2 undamental cycles and their images with voltages on K 4 1 Fundamental cycles: abc, acd, adb φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) 2 Assume that N is the fibre-preserving group and the covering graph is N-arc-transitive. bc z 1 bad z 3 acd z 2 acb z 1 cd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 db z 3 bca z 1 abc z 1 adc z 2 3 Let N project to L. Then K 4 is L-arc-transitive. Thus, L = A 4 or S 4. Hence, α and β lifts.

6 Proof for Theorem 1 C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 Table: Fundamental cycles and their images with voltages on K 4 1 K = z 1, z 2, z 3 = Z n or Z m p. L = A 4 = α, β lifts.

7 Proof for Theorem 1 C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 Table: Fundamental cycles and their images with voltages on K 4 1 K = z 1, z 2, z 3 = Z n or Z m p. L = A 4 = α, β lifts. 2 α: φ(c) α = φ(c α ), where C ranges over fundamental cycles. Similarly, we can define β and γ.

8 Proof for Theorem 1 C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 Table: Fundamental cycles and their images with voltages on K 4 1 K = z 1, z 2, z 3 = Z n or Z m p. L = A 4 = α, β lifts. 2 α: φ(c) α = φ(c α ), where C ranges over fundamental cycles. Similarly, we can define β and γ. 3 Since L lifts, α can be extended to an automorphism of K, say α. Similarly, we can define β and γ if γ lifts.

9 Proof for Theorem 1 C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 Table: Fundamental cycles and their images with voltages on K 4 1 K = z 1, z 2, z 3 = Z n or Z m p. L = A 4 = α, β lifts. 2 α: φ(c) α = φ(c α ), where C ranges over fundamental cycles. Similarly, we can define β and γ. 3 Since L lifts, α can be extended to an automorphism of K, say α. Similarly, we can define β and γ if γ lifts. 4 z β 1 = z 2 and z β 2 = z 3 o(z 1 ) = o(z 2 ) = o(z 3 ).

10 K = Z n C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 1 K = Z n = z 1, z 2, z 3 = z 1 = z 2 = z 3. Let z 1 = 1.

11 K = Z n C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 1 K = Z n = z 1, z 2, z 3 = z 1 = z 2 = z 3. Let z 1 = 1. 2 Let 1 β = k. Then (k, n) = 1. z β 1 = z 2, z β 2 = z 3, z β 3 = z 1 z 2 = k, z 3 = k 2, k 3 = 1 in Z n.

12 K = Z n C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 1 K = Z n = z 1, z 2, z 3 = z 1 = z 2 = z 3. Let z 1 = 1. 2 Let 1 β = k. Then (k, n) = 1. z β 1 = z 2, z β 2 = z 3, z β 3 = z 1 z 2 = k, z 3 = k 2, k 3 = 1 in Z n. 3 Let 1 α = l. z1 α = z 3, z3 α = z 1 l = k 2, lk 2 = 1 l = k 2 = l 1 l 2 = 1, k = k 4 = l 2 = 1, l = k 2 = 1.

13 K = Z n C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 1 K = Z n = z 1, z 2, z 3 = z 1 = z 2 = z 3. Let z 1 = 1. 2 Let 1 β = k. Then (k, n) = 1. z β 1 = z 2, z β 2 = z 3, z β 3 = z 1 z 2 = k, z 3 = k 2, k 3 = 1 in Z n. 3 Let 1 α = l. z1 α = z 3, z3 α = z 1 l = k 2, lk 2 = 1 l = k 2 = l 1 l 2 = 1, k = k 4 = l 2 = 1, l = k 2 = 1. 4 z 1 = z 2 = z 3 = 1. z α 2 = z 1 z 2 z 3 4 = 0 n = 2, 4.

14 K = Z n C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 1 K = Z n = z 1, z 2, z 3 = z 1 = z 2 = z 3. Let z 1 = 1. 2 Let 1 β = k. Then (k, n) = 1. z β 1 = z 2, z β 2 = z 3, z β 3 = z 1 z 2 = k, z 3 = k 2, k 3 = 1 in Z n. 3 Let 1 α = l. z1 α = z 3, z3 α = z 1 l = k 2, lk 2 = 1 l = k 2 = l 1 l 2 = 1, k = k 4 = l 2 = 1, l = k 2 = 1. 4 z 1 = z 2 = z 3 = 1. z α 2 = z 1 z 2 z 3 4 = 0 n = 2, 4. 5 For n = 2, 4, α, β and γ extends to automorphisms of Z n. It follows that X = Q 3 or P(8, 3) because there is unique connected cubic symmetric graph of order 8 or 16.

15 K = Z m p, m 2 C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 1 K = z 1, z 2, z 3 m = 2 or 3.

16 K = Z m p, m 2 C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 1 K = z 1, z 2, z 3 m = 2 or 3. 2 m = 2 K = Z 2 p = a b. z β 1 = z 2, z β 2 = z 3, z β 3 = z 1 z 1 and z 2 linearly independent. z 1 = a, z 2 = b.

17 K = Z m p, m 2 C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 1 K = z 1, z 2, z 3 m = 2 or 3. 2 m = 2 K = Z 2 p = a b. z β 1 = z 2, z β 2 = z 3, z β 3 = z 1 z 1 and z 2 linearly independent. z 1 = a, z 2 = b. 3 z 3 = ka + lb a = z 1 = z β 3 = kb + l(ka + lb) lk = 1, k + l 2 = 0 in Z p l 3 = 1, k = l 1.

18 K = Z m p, m 2 C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 1 K = z 1, z 2, z 3 m = 2 or 3. 2 m = 2 K = Z 2 p = a b. z β 1 = z 2, z β 2 = z 3, z β 3 = z 1 z 1 and z 2 linearly independent. z 1 = a, z 2 = b. 3 z 3 = ka + lb a = z 1 = z β 3 = kb + l(ka + lb) lk = 1, k + l 2 = 0 in Z p l 3 = 1, k = l 1. 4 z 3 = ka + lb a = z 1 = z3 α = k(ka + lb) l[(k + 1)a + (l + 1)b] k 2 kl l = 1, kl l 2 l = 0 2l = 2, l 2 + l 1 = 0, contradiction.

19 K = Z m p, m 2 C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 1 m = 3 z 1, z 2, z 3 are linearly independent α, β, γ can be extended to automorphisms of K Aut( X) contains a 2-regular subgroup B.

20 K = Z m p, m 2 C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 1 m = 3 z 1, z 2, z 3 are linearly independent α, β, γ can be extended to automorphisms of K Aut( X) contains a 2-regular subgroup B. 2 Suppose that X is 3-arc-transitive. By [2], X is 3-regular. Let A = Aut( X) A : B = 2 and B A.

21 K = Z m p, m 2 C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 1 m = 3 z 1, z 2, z 3 are linearly independent α, β, γ can be extended to automorphisms of K Aut( X) contains a 2-regular subgroup B. 2 Suppose that X is 3-arc-transitive. By [2], X is 3-regular. Let A = Aut( X) A : B = 2 and B A. 3 If p = 2 or 3, by Conder and Dobcsányi [1], X is 2-regular, a contradiction.

22 K = Z m p, m 2 C φ(c) C α φ(c α ) C β φ(c β ) C γ φ(c γ ) abc z 1 bad z 3 acd z 2 acb z 1 acd z 2 bdc z 1 z 2 z 3 adb z 3 abd z 3 adb z 3 bca z 1 abc z 1 adc z 2 1 m = 3 z 1, z 2, z 3 are linearly independent α, β, γ can be extended to automorphisms of K Aut( X) contains a 2-regular subgroup B. 2 Suppose that X is 3-arc-transitive. By [2], X is 3-regular. Let A = Aut( X) A : B = 2 and B A. 3 If p = 2 or 3, by Conder and Dobcsányi [1], X is 2-regular, a contradiction. 4 If p 5 then K Syl p (B) K A K 4 is 3-arc-transitive, a contradiction. Thus, X is 2-regular.

23 Proof for Theorem 2 Theorem 2: Let X be a connected cubic symmetric graph of order 4p or 4p 2 (p a prime). Then X is isomorphic to the 3-dimensional Hypercube Q 3, the generalized Petersen graph P(8, 3) or P(10, 3), the Dodecahedron (3-regular), or the Coxeter graph C 28 (3-regular). 1 Let X be a connected cubic symmetric graph of order 4m, m = p or p 2. Let A = Aut(X). By Tutte [6], A 192m.

24 Proof for Theorem 2 Theorem 2: Let X be a connected cubic symmetric graph of order 4p or 4p 2 (p a prime). Then X is isomorphic to the 3-dimensional Hypercube Q 3, the generalized Petersen graph P(8, 3) or P(10, 3), the Dodecahedron (3-regular), or the Coxeter graph C 28 (3-regular). 1 Let X be a connected cubic symmetric graph of order 4m, m = p or p 2. Let A = Aut(X). By Tutte [6], A 192m. 2 If p < 17, by Conder and Dobcsányi [1], V (X) = 8, 16, 20, 28, which are Q 3, P(8, 3), the Dodecahedron, P(10, 3) or the Coxeter graph C 28.

25 Proof for Theorem 2 Theorem 2: Let X be a connected cubic symmetric graph of order 4p or 4p 2 (p a prime). Then X is isomorphic to the 3-dimensional Hypercube Q 3, the generalized Petersen graph P(8, 3) or P(10, 3), the Dodecahedron (3-regular), or the Coxeter graph C 28 (3-regular). 1 Let X be a connected cubic symmetric graph of order 4m, m = p or p 2. Let A = Aut(X). By Tutte [6], A 192m. 2 If p < 17, by Conder and Dobcsányi [1], V (X) = 8, 16, 20, 28, which are Q 3, P(8, 3), the Dodecahedron, P(10, 3) or the Coxeter graph C Let p 17. We aim to deduce a contradiction.

26 Proof for Theorem 2 Theorem 2: Let X be a connected cubic symmetric graph of order 4p or 4p 2 (p a prime). Then X is isomorphic to the 3-dimensional Hypercube Q 3, the generalized Petersen graph P(8, 3) or P(10, 3), the Dodecahedron (3-regular), or the Coxeter graph C 28 (3-regular). 1 Let X be a connected cubic symmetric graph of order 4m, m = p or p 2. Let A = Aut(X). By Tutte [6], A 192m. 2 If p < 17, by Conder and Dobcsányi [1], V (X) = 8, 16, 20, 28, which are Q 3, P(8, 3), the Dodecahedron, P(10, 3) or the Coxeter graph C Let p 17. We aim to deduce a contradiction. 4 Let P Syl p (A). Then Syl p (A) = np + 1 = A : N A (P). If np + 1 = 1 P A X is a regular covering of K 4, but no such graph X by Theorem 1, a contradiction.

27 Conditions: V (X) = 4p 2 and P A 1 Thus, np + 1 > 1. p 17 np , A 192m np (m = p or p 2 ).

28 Conditions: V (X) = 4p 2 and P A 1 Thus, np + 1 > 1. p 17 np , A 192m np (m = p or p 2 ). 2 np = 191, 95, 47, 23, 63, 31 either p = 191, 47, 31 or 23 and n = 1, or p = 19 and n = 5.

29 Conditions: V (X) = 4p 2 and P A 1 Thus, np + 1 > 1. p 17 np , A 192m np (m = p or p 2 ). 2 np = 191, 95, 47, 23, 63, 31 either p = 191, 47, 31 or 23 and n = 1, or p = 19 and n = 5. 3 Again by Conder and Dobcsányi [1], there is no such X of order 4p.

30 Conditions: V (X) = 4p 2 and P A 1 Thus, np + 1 > 1. p 17 np , A 192m np (m = p or p 2 ). 2 np = 191, 95, 47, 23, 63, 31 either p = 191, 47, 31 or 23 and n = 1, or p = 19 and n = 5. 3 Again by Conder and Dobcsányi [1], there is no such X of order 4p. 4 Thus, V (X) = 4p 2.

31 Conditions: V (X) = 4p 2 and P A 1 Thus, np + 1 > 1. p 17 np , A 192m np (m = p or p 2 ). 2 np = 191, 95, 47, 23, 63, 31 either p = 191, 47, 31 or 23 and n = 1, or p = 19 and n = 5. 3 Again by Conder and Dobcsányi [1], there is no such X of order 4p. 4 Thus, V (X) = 4p 2. 5 n = 1 and p = 191, 47, 31 or 23. Let H = N A (P). Considering the right multiplication action of A on right cosets of H in A A/H A (p + 1)! p H A P H A = p P H A A X P HA is a connected cubic symmetric graph of order 4p, a contradiction.

32 Conditions: V (X) = 4p 2 and P A 1 p = 19 and n = 5 A : N A (P) = np + 1 = A X is 4-arc-transitive A = or

33 Conditions: V (X) = 4p 2 and P A 1 p = 19 and n = 5 A : N A (P) = np + 1 = A X is 4-arc-transitive A = or By Gorenstein [3, pp.12-14], a simple {2, 3, q}-group exists if and only if q = 5, 7, 13 or 17 A is solvable for a minimal normal subgroup N of A, N = Z s r, r = 2, 3, 19.

34 Conditions: V (X) = 4p 2 and P A 1 p = 19 and n = 5 A : N A (P) = np + 1 = A X is 4-arc-transitive A = or By Gorenstein [3, pp.12-14], a simple {2, 3, q}-group exists if and only if q = 5, 7, 13 or 17 A is solvable for a minimal normal subgroup N of A, N = Z s r, r = 2, 3, r = 3 N A v, impossible. r = 2 or 19 X N is a connected cubic 4-arc-transitive graph of order 722 or 38, which is impossible by Conder and Dobcsányi [1].

35 M.D.E. Conder, P. Dobcsǎnyi, Trivalent symmetric graphs on up to 768 vertices, J. Combin. Math. Combin. Comput. 40(2002) M.D.E. Conder, R. Nedela, A refined classification of symmetric cubic graphs, J. Algebra 322(2009) D. Gorenstein, Finite Simple Groups, New York and London: Plenum Press, P. Lorimer, Vertex-transitive graphs: symmetric graphs of prime valency, J. Graph Theory 8(1984), A. Malnič, Group actions, coverings and lifts of automorphisms, Discrete Math. 182(1998), W.T. Tutte, On the symmetry of cubic graphs, Canad. J. Math. 11(1959),

36 Thank you!

Congruence Classes of Invertible Matrices of Order 3 over F 2

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

Διαβάστε περισσότερα

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

Διαβάστε περισσότερα

Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit

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

Διαβάστε περισσότερα

2 Composition. Invertible Mappings

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,

Διαβάστε περισσότερα

Fractional Colorings and Zykov Products of graphs

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

Διαβάστε περισσότερα

EE512: Error Control Coding

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

Διαβάστε περισσότερα

Affine Weyl Groups. Gabriele Nebe. Summerschool GRK 1632, September Lehrstuhl D für Mathematik

Affine Weyl Groups. Gabriele Nebe. Summerschool GRK 1632, September Lehrstuhl D für Mathematik Affine Weyl Groups Gabriele Nebe Lehrstuhl D für Mathematik Summerschool GRK 1632, September 2015 Crystallographic root systems. Definition A crystallographic root system Φ is a finite set of non zero

Διαβάστε περισσότερα

On a four-dimensional hyperbolic manifold with finite volume

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

Διαβάστε περισσότερα

ORDINAL ARITHMETIC JULIAN J. SCHLÖDER

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.

Διαβάστε περισσότερα

MINIMAL CLOSED SETS AND MAXIMAL CLOSED SETS

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

Διαβάστε περισσότερα

On the Galois Group of Linear Difference-Differential Equations

On the Galois Group of Linear Difference-Differential Equations On the Galois Group of Linear Difference-Differential Equations Ruyong Feng KLMM, Chinese Academy of Sciences, China Ruyong Feng (KLMM, CAS) Galois Group 1 / 19 Contents 1 Basic Notations and Concepts

Διαβάστε περισσότερα

Finite Field Problems: Solutions

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

Διαβάστε περισσότερα

Example Sheet 3 Solutions

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

Διαβάστε περισσότερα

Abstract Storage Devices

Abstract Storage Devices Abstract Storage Devices Robert König Ueli Maurer Stefano Tessaro SOFSEM 2009 January 27, 2009 Outline 1. Motivation: Storage Devices 2. Abstract Storage Devices (ASD s) 3. Reducibility 4. Factoring ASD

Διαβάστε περισσότερα

A Note on Intuitionistic Fuzzy. Equivalence Relation

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

Διαβάστε περισσότερα

ST5224: Advanced Statistical Theory II

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

Διαβάστε περισσότερα

Homomorphism in Intuitionistic Fuzzy Automata

Homomorphism in Intuitionistic Fuzzy Automata International Journal of Fuzzy Mathematics Systems. ISSN 2248-9940 Volume 3, Number 1 (2013), pp. 39-45 Research India Publications http://www.ripublication.com/ijfms.htm Homomorphism in Intuitionistic

Διαβάστε περισσότερα

Lecture 15 - Root System Axiomatics

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

Διαβάστε περισσότερα

C.S. 430 Assignment 6, Sample Solutions

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

Διαβάστε περισσότερα

5. Choice under Uncertainty

5. Choice under Uncertainty 5. Choice under Uncertainty Daisuke Oyama Microeconomics I May 23, 2018 Formulations von Neumann-Morgenstern (1944/1947) X: Set of prizes Π: Set of probability distributions on X : Preference relation

Διαβάστε περισσότερα

Fourier Series. MATH 211, Calculus II. J. Robert Buchanan. Spring Department of Mathematics

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)

Διαβάστε περισσότερα

Chapter 3: Ordinal Numbers

Chapter 3: Ordinal Numbers Chapter 3: Ordinal Numbers There are two kinds of number.. Ordinal numbers (0th), st, 2nd, 3rd, 4th, 5th,..., ω, ω +,... ω2, ω2+,... ω 2... answers to the question What position is... in a sequence? What

Διαβάστε περισσότερα

Chapter 6: Systems of Linear Differential. be continuous functions on the interval

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

Διαβάστε περισσότερα

Practice Exam 2. Conceptual Questions. 1. State a Basic identity and then verify it. (a) Identity: Solution: One identity is csc(θ) = 1

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

Διαβάστε περισσότερα

A General Note on δ-quasi Monotone and Increasing Sequence

A General Note on δ-quasi Monotone and Increasing Sequence International Mathematical Forum, 4, 2009, no. 3, 143-149 A General Note on δ-quasi Monotone and Increasing Sequence Santosh Kr. Saxena H. N. 419, Jawaharpuri, Badaun, U.P., India Presently working in

Διαβάστε περισσότερα

Reminders: linear functions

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

Διαβάστε περισσότερα

Uniform Convergence of Fourier Series Michael Taylor

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

Διαβάστε περισσότερα

Phys460.nb Solution for the t-dependent Schrodinger s equation How did we find the solution? (not required)

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

Διαβάστε περισσότερα

Second Order Partial Differential Equations

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

Διαβάστε περισσότερα

Statistical Inference I Locally most powerful tests

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

Διαβάστε περισσότερα

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)

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

Διαβάστε περισσότερα

SCITECH Volume 13, Issue 2 RESEARCH ORGANISATION Published online: March 29, 2018

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

Διαβάστε περισσότερα

Main source: "Discrete-time systems and computer control" by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1

Main source: Discrete-time systems and computer control by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1 Main source: "Discrete-time systems and computer control" by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1 A Brief History of Sampling Research 1915 - Edmund Taylor Whittaker (1873-1956) devised a

Διαβάστε περισσότερα

Inverse trigonometric functions & General Solution of Trigonometric Equations. ------------------ ----------------------------- -----------------

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

Διαβάστε περισσότερα

Lecture 13 - Root Space Decomposition II

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).

Διαβάστε περισσότερα

Solutions to Selected Homework Problems 1.26 Claim: α : S S which is 1-1 but not onto β : S S which is onto but not 1-1. y z = z y y, z S.

Solutions to Selected Homework Problems 1.26 Claim: α : S S which is 1-1 but not onto β : S S which is onto but not 1-1. y z = z y y, z S. Solutions to Selected Homework Problems 1.26 Claim: α : S S which is 1-1 but not onto β : S S which is onto but not 1-1. Proof. ( ) Since α is 1-1, β : S S such that β α = id S. Since β α = id S is onto,

Διαβάστε περισσότερα

THE SECOND ISOMORPHISM THEOREM ON ORDERED SET UNDER ANTIORDERS. Daniel A. Romano

THE SECOND ISOMORPHISM THEOREM ON ORDERED SET UNDER ANTIORDERS. Daniel A. Romano 235 Kragujevac J. Math. 30 (2007) 235 242. THE SECOND ISOMORPHISM THEOREM ON ORDERED SET UNDER ANTIORDERS Daniel A. Romano Department of Mathematics and Informatics, Banja Luka University, Mladena Stojanovića

Διαβάστε περισσότερα

Lecture 34 Bootstrap confidence intervals

Lecture 34 Bootstrap confidence intervals Lecture 34 Bootstrap confidence intervals Confidence Intervals θ: an unknown parameter of interest We want to find limits θ and θ such that Gt = P nˆθ θ t If G 1 1 α is known, then P θ θ = P θ θ = 1 α

Διαβάστε περισσότερα

Math221: HW# 1 solutions

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

Διαβάστε περισσότερα

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 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:

Διαβάστε περισσότερα

The Small World Theorem

The Small World Theorem The Small World Theorem Ulrich Meierfrankenfeld, Bernd Stellmacher June 10, 2002 Assume M(S) 2 and Q!. We investigate the Structure of E/O p (E). For L L define L = L O p (L). In this section we assume

Διαβάστε περισσότερα

The challenges of non-stable predicates

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

Διαβάστε περισσότερα

Math 6 SL Probability Distributions Practice Test Mark Scheme

Math 6 SL Probability Distributions Practice Test Mark Scheme Math 6 SL Probability Distributions Practice Test Mark Scheme. (a) Note: Award A for vertical line to right of mean, A for shading to right of their vertical line. AA N (b) evidence of recognizing symmetry

Διαβάστε περισσότερα

Approximation of distance between locations on earth given by latitude and longitude

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

Διαβάστε περισσότερα

The Probabilistic Method - Probabilistic Techniques. Lecture 7: The Janson Inequality

The Probabilistic Method - Probabilistic Techniques. Lecture 7: The Janson Inequality The Probabilistic Method - Probabilistic Techniques Lecture 7: The Janson Inequality Sotiris Nikoletseas Associate Professor Computer Engineering and Informatics Department 2014-2015 Sotiris Nikoletseas,

Διαβάστε περισσότερα

Areas and Lengths in Polar Coordinates

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 8 Model Solution Section

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

Διαβάστε περισσότερα

ΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 19/5/2007

ΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 19/5/2007 Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Αν κάπου κάνετε κάποιες υποθέσεις να αναφερθούν στη σχετική ερώτηση. Όλα τα αρχεία που αναφέρονται στα προβλήματα βρίσκονται στον ίδιο φάκελο με το εκτελέσιμο

Διαβάστε περισσότερα

Lecture 10 - Representation Theory III: Theory of Weights

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 Λ

Διαβάστε περισσότερα

Απόκριση σε Μοναδιαία Ωστική Δύναμη (Unit Impulse) Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο. Απόστολος Σ.

Απόκριση σε Μοναδιαία Ωστική Δύναμη (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

Διαβάστε περισσότερα

Lecture 2. Soundness and completeness of propositional logic

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

Διαβάστε περισσότερα

arxiv: v2 [math.gr] 14 Dec 2018

arxiv: v2 [math.gr] 14 Dec 2018 arxiv:181.05311v [math.gr] 1 Dec 018 Sequences over finite fields defined by BN-pair decomposition of PSL (q) recursively Robert Shwartz Department of Mathematics Ariel University, Israel robertsh@ariel.ac.il

Διαβάστε περισσότερα

Iterated trilinear fourier integrals with arbitrary symbols

Iterated trilinear fourier integrals with arbitrary symbols Cornell University ICM 04, Satellite Conference in Harmonic Analysis, Chosun University, Gwangju, Korea August 6, 04 Motivation the Coifman-Meyer theorem with classical paraproduct(979) B(f, f )(x) :=

Διαβάστε περισσότερα

SOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM

SOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM SOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM Solutions to Question 1 a) The cumulative distribution function of T conditional on N n is Pr T t N n) Pr max X 1,..., X N ) t N n) Pr max

Διαβάστε περισσότερα

From root systems to Dynkin diagrams

From root systems to Dynkin diagrams From root systems to Dynkin diagrams Heiko Dietrich Abstract. We describe root systems and their associated Dynkin diagrams; these notes follow closely the book of Erdman & Wildon ( Introduction to Lie

Διαβάστε περισσότερα

Jordan Form of a Square Matrix

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 =

Διαβάστε περισσότερα

Distances in Sierpiński Triangle Graphs

Distances in Sierpiński Triangle Graphs Distances in Sierpiński Triangle Graphs Sara Sabrina Zemljič joint work with Andreas M. Hinz June 18th 2015 Motivation Sierpiński triangle introduced by Wac law Sierpiński in 1915. S. S. Zemljič 1 Motivation

Διαβάστε περισσότερα

SCHOOL OF MATHEMATICAL SCIENCES G11LMA Linear Mathematics Examination Solutions

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)

Διαβάστε περισσότερα

Generating Set of the Complete Semigroups of Binary Relations

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

Διαβάστε περισσότερα

Mean-Variance Analysis

Mean-Variance Analysis Mean-Variance Analysis Jan Schneider McCombs School of Business University of Texas at Austin Jan Schneider Mean-Variance Analysis Beta Representation of the Risk Premium risk premium E t [Rt t+τ ] R1

Διαβάστε περισσότερα

ω ω ω ω ω ω+2 ω ω+2 + ω ω ω ω+2 + ω ω+1 ω ω+2 2 ω ω ω ω ω ω ω ω+1 ω ω2 ω ω2 + ω ω ω2 + ω ω ω ω2 + ω ω+1 ω ω2 + ω ω+1 + ω ω ω ω2 + ω

ω ω ω ω ω ω+2 ω ω+2 + ω ω ω ω+2 + ω ω+1 ω ω+2 2 ω ω ω ω ω ω ω ω+1 ω ω2 ω ω2 + ω ω ω2 + ω ω ω ω2 + ω ω+1 ω ω2 + ω ω+1 + ω ω ω ω2 + ω 0 1 2 3 4 5 6 ω ω + 1 ω + 2 ω + 3 ω + 4 ω2 ω2 + 1 ω2 + 2 ω2 + 3 ω3 ω3 + 1 ω3 + 2 ω4 ω4 + 1 ω5 ω 2 ω 2 + 1 ω 2 + 2 ω 2 + ω ω 2 + ω + 1 ω 2 + ω2 ω 2 2 ω 2 2 + 1 ω 2 2 + ω ω 2 3 ω 3 ω 3 + 1 ω 3 + ω ω 3 +

Διαβάστε περισσότερα

k A = [k, k]( )[a 1, a 2 ] = [ka 1,ka 2 ] 4For the division of two intervals of confidence in R +

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

Διαβάστε περισσότερα

1. Introduction and Preliminaries.

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

Διαβάστε περισσότερα

Matrices and Determinants

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

Διαβάστε περισσότερα

Space-Time Symmetries

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

Διαβάστε περισσότερα

Chapter 6: Systems of Linear Differential. be continuous functions on the interval

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

Διαβάστε περισσότερα

DIRECT PRODUCT AND WREATH PRODUCT OF TRANSFORMATION SEMIGROUPS

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

Διαβάστε περισσότερα

SOME PROPERTIES OF FUZZY REAL NUMBERS

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

Διαβάστε περισσότερα

Overview. Transition Semantics. Configurations and the transition relation. Executions and computation

Overview. Transition Semantics. Configurations and the transition relation. Executions and computation Overview Transition Semantics Configurations and the transition relation Executions and computation Inference rules for small-step structural operational semantics for the simple imperative language Transition

Διαβάστε περισσότερα

ΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 6/5/2006

ΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 6/5/2006 Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Ολοι οι αριθμοί που αναφέρονται σε όλα τα ερωτήματα είναι μικρότεροι το 1000 εκτός αν ορίζεται διαφορετικά στη διατύπωση του προβλήματος. Διάρκεια: 3,5 ώρες Καλή

Διαβάστε περισσότερα

Areas and Lengths in Polar Coordinates

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

Διαβάστε περισσότερα

F A S C I C U L I M A T H E M A T I C I

F A S C I C U L I M A T H E M A T I C I F A S C I C U L I M A T H E M A T I C I Nr 46 2011 C. Carpintero, N. Rajesh and E. Rosas ON A CLASS OF (γ, γ )-PREOPEN SETS IN A TOPOLOGICAL SPACE Abstract. In this paper we have introduced the concept

Διαβάστε περισσότερα

Homomorphism and Cartesian Product on Fuzzy Translation and Fuzzy Multiplication of PS-algebras

Homomorphism and Cartesian Product on Fuzzy Translation and Fuzzy Multiplication of PS-algebras Annals of Pure and Applied athematics Vol. 8, No. 1, 2014, 93-104 ISSN: 2279-087X (P), 2279-0888(online) Published on 11 November 2014 www.researchmathsci.org Annals of Homomorphism and Cartesian Product

Διαβάστε περισσότερα

3.4 SUM AND DIFFERENCE FORMULAS. NOTE: cos(α+β) cos α + cos β cos(α-β) 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

Διαβάστε περισσότερα

6.1. Dirac Equation. Hamiltonian. Dirac Eq.

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

Διαβάστε περισσότερα

5.4 The Poisson Distribution.

5.4 The Poisson Distribution. The worst thing you can do about a situation is nothing. Sr. O Shea Jackson 5.4 The Poisson Distribution. Description of the Poisson Distribution Discrete probability distribution. The random variable

Διαβάστε περισσότερα

( y) Partial Differential Equations

( y) Partial Differential Equations Partial Dierential Equations Linear P.D.Es. contains no owers roducts o the deendent variables / an o its derivatives can occasionall be solved. Consider eamle ( ) a (sometimes written as a ) we can integrate

Διαβάστε περισσότερα

Section 8.3 Trigonometric Equations

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.

Διαβάστε περισσότερα

CHAPTER 25 SOLVING EQUATIONS BY ITERATIVE METHODS

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) =

Διαβάστε περισσότερα

Other Test Constructions: Likelihood Ratio & Bayes Tests

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 :

Διαβάστε περισσότερα

Lecture Notes Introduction to Cluster Algebra

Lecture Notes Introduction to Cluster Algebra Lecture Notes Introduction to Cluster Algebra Ivan C.H. Ip Update: May 29, 2017 7.2 Properties of Exchangeable roots The notion of exchangeable is explained as follows Proposition 7.20. If C and C = C

Διαβάστε περισσότερα

ANSWERSHEET (TOPIC = DIFFERENTIAL CALCULUS) COLLECTION #2. h 0 h h 0 h h 0 ( ) g k = g 0 + g 1 + g g 2009 =?

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

Διαβάστε περισσότερα

Problem Set 3: Solutions

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

Διαβάστε περισσότερα

4.6 Autoregressive Moving Average Model ARMA(1,1)

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

Διαβάστε περισσότερα

UNIT - I LINEAR ALGEBRA. , such that αν V satisfying following condition

UNIT - I LINEAR ALGEBRA. , such that αν V satisfying following condition UNIT - I LINEAR ALGEBRA Definition Vector Space : A non-empty set V is said to be vector space over the field F. If V is an abelian group under addition and if for every α, β F, ν, ν 2 V, such that αν

Διαβάστε περισσότερα

Section 8.2 Graphs of Polar Equations

Section 8.2 Graphs of Polar Equations Section 8. Graphs of Polar Equations Graphing Polar Equations The graph of a polar equation r = f(θ), or more generally F(r,θ) = 0, consists of all points P that have at least one polar representation

Διαβάστε περισσότερα

New bounds for spherical two-distance sets and equiangular lines

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

Διαβάστε περισσότερα

Some new generalized topologies via hereditary classes. Key Words:hereditary generalized topological space, A κ(h,µ)-sets, κµ -topology.

Some new generalized topologies via hereditary classes. Key Words:hereditary generalized topological space, A κ(h,µ)-sets, κµ -topology. Bol. Soc. Paran. Mat. (3s.) v. 30 2 (2012): 71 77. c SPM ISSN-2175-1188 on line ISSN-00378712 in press SPM: www.spm.uem.br/bspm doi:10.5269/bspm.v30i2.13793 Some new generalized topologies via hereditary

Διαβάστε περισσότερα

Sequent Calculi for the Modal µ-calculus over S5. Luca Alberucci, University of Berne. Logic Colloquium Berne, July 4th 2008

Sequent Calculi for the Modal µ-calculus over S5. Luca Alberucci, University of Berne. Logic Colloquium Berne, July 4th 2008 Sequent Calculi for the Modal µ-calculus over S5 Luca Alberucci, University of Berne Logic Colloquium Berne, July 4th 2008 Introduction Koz: Axiomatisation for the modal µ-calculus over K Axioms: All classical

Διαβάστε περισσότερα

Coefficient Inequalities for a New Subclass of K-uniformly Convex Functions

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

Διαβάστε περισσότερα

Lecture 21: Properties and robustness of LSE

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

Διαβάστε περισσότερα

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

Διαβάστε περισσότερα

A Lambda Model Characterizing Computational Behaviours of Terms

A Lambda Model Characterizing Computational Behaviours of Terms A Lambda Model Characterizing Computational Behaviours of Terms joint paper with Silvia Ghilezan RPC 01, Sendai, October 26, 2001 1 Plan of the talk normalization properties inverse limit model Stone dualities

Διαβάστε περισσότερα

A Bonus-Malus System as a Markov Set-Chain. Małgorzata Niemiec Warsaw School of Economics Institute of Econometrics

A Bonus-Malus System as a Markov Set-Chain. Małgorzata Niemiec Warsaw School of Economics Institute of Econometrics A Bonus-Malus System as a Markov Set-Chain Małgorzata Niemiec Warsaw School of Economics Institute of Econometrics Contents 1. Markov set-chain 2. Model of bonus-malus system 3. Example 4. Conclusions

Διαβάστε περισσότερα

Αλγόριθμοι και πολυπλοκότητα NP-Completeness (2)

Αλγόριθμοι και πολυπλοκότητα NP-Completeness (2) ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Αλγόριθμοι και πολυπλοκότητα NP-Completeness (2) Ιωάννης Τόλλης Τμήμα Επιστήμης Υπολογιστών NP-Completeness (2) x 1 x 1 x 2 x 2 x 3 x 3 x 4 x 4 12 22 32 11 13 21

Διαβάστε περισσότερα

Partial Differential Equations in Biology The boundary element method. March 26, 2013

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

Διαβάστε περισσότερα

Homomorphism of Intuitionistic Fuzzy Groups

Homomorphism of Intuitionistic Fuzzy Groups International Mathematical Forum, Vol. 6, 20, no. 64, 369-378 Homomorphism o Intuitionistic Fuzz Groups P. K. Sharma Department o Mathematics, D..V. College Jalandhar Cit, Punjab, India pksharma@davjalandhar.com

Διαβάστε περισσότερα

3.2 Simple Roots and Weyl Group

3.2 Simple Roots and Weyl Group 44 CHAPTER 3. ROOT SYSTEMS 3.2 Simple Roots and Weyl Group In this section, we fix a root system Φ of rank l in a euclidean space E, with Weyl group W. 3.2.1 Bases and Weyl chambers Def. A subset of Φ

Διαβάστε περισσότερα

Chapter 2. Ordinals, well-founded relations.

Chapter 2. Ordinals, well-founded relations. Chapter 2. Ordinals, well-founded relations. 2.1. Well-founded Relations. We start with some definitions and rapidly reach the notion of a well-ordered set. Definition. For any X and any binary relation

Διαβάστε περισσότερα