Jian-yi Shi East China Normal University, Shanghai and Technische Universität Kaiserslautern

Size: px
Start display at page:

Download "Jian-yi Shi East China Normal University, Shanghai and Technische Universität Kaiserslautern"

Transcription

1 IMPRIMITIVE COMPLEX REFLECTION GROUPS G(m, p, n) Jin-yi Shi Est Chin Norml University, Shnghi nd Technische Universität Kiserslutern 1 Typeset by AMS-TEX

2 2 Jin-yi Shi 1. Preliminries V, n-dim spce/c. A reflection s on V : s GL(V ), o(s) <, codim V s = 1. A reflection group G on V is finite group generted by reflections on V A reflection group G in V is imprimitive, if (i) G cts on V irreducibly; (ii) V = V 1... V r with 0 V i V such tht G permutes {V i 1 i r}. For σ S n, denote by [( 1,..., n ) σ] the n n monomil mtrix with non-zero entries i in the (i,(i)σ)-positions.

3 Complex Reflection Groups 3 For p m (red p divides m ) in N, set { G(m,p,n) = [( 1,..., n ) σ] i C, m i =1,σ S n; ( j j) m/p = 1 } G(m,p,n) is the mtrix form of n imprimitive reflection group cting on V w.r.t. n orthonorml bsis e 1,e 2,...,e n.

4 4 Jin-yi Shi 1.3. Three tsks: (1) A reflection group G cn be presented by genertors nd reltions (not unique in generl). Clssify ll the presenttions for G (J. Shi). (2) Length function is n importnt tool in the study of reflection groups. Find explicit formule for the reflection length of elements of G (J. Shi). (3) Automorphisms of G is one of the min spects in the theory of reflection groups. Describe the utomorphism groups of G (J. Shi nd L. Wng). In this tlk, we only consider G = G(m,p,n).

5 Complex Reflection Groups For reflection group G, presenttion of G by genertors & reltions (or presenttion in short) is by definition pir (S,P), where (1) S is finite set of reflection genertors for G with miniml possible crdinlity. (2) P is finite reltion set on S, nd ny other reltion on S is consequence of the reltions in P Two presenttions (S,P) nd (S,P ) for G re congruent, if bijection η : S S such tht for ny s,t S, ( ) s,t = η(s),η(t) Congruence to complex reflection groups is n nlogue of isomorphism to Coxeter systems (only concerning reltions involving t most two genertors).

6 6 Jin-yi Shi 2. Grphs ssocited to reflection sets two kinds of reflections in G(m,1,n): i < j in [n], ith jth {}}{{}}{ (i) s(i,j;k)=[(1,...,1, ζm k,1,...,1, ζm k,1,...,1) (i,j)], where (i,j) is the trnsposition of i nd j, nd ζ m := exp ( ) 2πi m. Cll s(i,j;k) reflection of type I. set s(j,i;k) = s(i,j; k). (ii) s(i;k) = [(1,...,1, k Z, m k. jth {}}{ ζ k m,1,...,1) 1] for some Cll s(i; k) reflection of type II, hving order m/gcd(m, k). All the reflections of type I lie in the subgroup G(m,m,n).

7 Complex Reflection Groups To ny set X = {s(i h,j h ;k h ) h J} of reflections of G(m,1,n) of type I, we ssocite digrph Γ X = (V,E) s follows. Its node set is V = [n], nd its rrow set E consists of ll the pirs {i,j} with lbels k for ny s(i,j;k) X. Denote by Γ X the underlying grph of Γ X (replcing lbelled rrows by unlbelled edges). Γ X hs no loop but my hve multi-edges. Let Y = X {s(i;k)}. we define nother kind of grph Γ r Y, which is obtined from Γ X by rooting the node i, i.e., Γ r Y is rooted grph with the rooted node i. Sometimes we denote Γ r Y by ([n],e,i). Use nottion Γ Y for Γ X.

8 8 Jin-yi Shi Exmples 2.3. Let n = 6. (1) X = {s(1,2;4),s(3,4;2),s(4,6;0),s(3,4;3)}. Then Γ X is Γ X is (2) Let Y = X {s(6;3)}. Then Γ r Y is Note: reflections of type I re represented by edges, rther thn nodes.

9 Complex Reflection Groups We described the congruence clsses of presenttions (c.c.p. in short) for two specil fmilies of imprimitive complex reflection groups G(m,1,n) nd G(m,m,n) in terms of grphs. Theorem 2.5. The mp (S,P) Γ r S induces bijection from the set of c.c.p. s of G(m,1,n) to the set of isom. clsses of rooted trees with n nodes. Theorem 2.6. The mp (S,P) Γ S induces bijection from the set of c.c.p. s of G(m,m,n) to the set of isom. clsses of connected grphs with n nodes nd n edges (or equivlently with n nodes nd exctly one circle).

10 10 Jin-yi Shi Exmples 2.7. Let n = 4. (1) There re 4 isomorphic clsses of rooted trees of 4 nodes: Hence G(m,1,4) hs 4 congruence clsses of presenttions. (2) There re 5 isomorphic clsses of connected grphs with 4 nodes nd exctly one circle: === === Hence G(m,m,4) hs 5 congruence clsses of presenttions.

11 Complex Reflection Groups 11 Now we consider the imprimitive complex reflection group G(m,p,n) for ny m,p,n N with p m (red p divides m ) nd 1 < p < m. Lemm 2.8. The genertor set S in presenttion (S,P) of the group G(m,p,n) consists of n reflections of type I nd one reflection of order m/p nd type II. Moreover, the grph Γ S is connected with exctly one circle Assume tht X is reflection set of G(m,p,n) with Γ X connected nd contining exctly one circle, sy the edges of the circle re { h, h+1 }, 1 h r (the subscripts re modulo r) for some integer 2 r n. Then X contins the reflections s( h, h+1 ;k h ) with some integers k h for ny 1 h r (the subscripts re modulo r). Denote by δ(x) := r h=1 k h.

12 12 Jin-yi Shi Now we cn chrcterize reflection set of G(m,p,n) to be the genertor set of presenttion s follows. Theorem Let X be subset of G(m,p,n) consisting of n reflections of type I nd one reflection of order m/p nd type II such tht the grph Γ X is connected. Then X is the genertor set in presenttion of G(m, p, n) if nd only if gcd{p,δ(x)} = 1.

13 Complex Reflection Groups Define the following sets: Σ(m,p,n): the set of ll S which form the genertor set in some presenttion of G(m,p,n). Λ(m,p): the set of ll d N such tht d m nd gcd{d,p} = 1. Γ(m,p,n): the set of ll the connected rooted grphs with n nodes nd n edges. Γ 1 (m,p,n): the set of ll the rooted grphs in Γ(m,p,n) ech contins two-nodes circle. Γ 2 (m,p,n): the complement of Γ 1 (m,p,n) in Γ(m,p,n). Γ(m,p,n), resp., Γ i (m,p,n): the set of the isomorphism clsses in the set Γ(m,p,n), resp., Γ i (m,p,n) for i = 1,2. Σ(m,p,n): set of congruence clsses in Σ(m,p,n).

14 14 Jin-yi Shi Now we describe ll the congruence clsses of presenttions for G(m,p,n) in terms of rooted grphs. Theorem (1) The mp ψ : S Γ r S from Σ(m, p, n) to Γ(m, p, n) induces surjection ψ: Σ(m,p,n) Γ(m,p,n). (2) Let Σ i (m,p,n) = ψ 1 ( Γ i (m,p,n)) for i = 1,2. Then the mp ψ gives rise to bijection: Σ 2 (m,p,n) Γ 2 (m,p,n); lso, S (Γ r S,gcd{m,δ(S)}) induces bijection: Σ 1 (m,p,n) Γ 1 (m,p,n) Λ(m,p).

15 Complex Reflection Groups 15 Exmple Let n = 4, m = 6 nd p = 2. Then Λ(6, 2) = {1, 3}. 13 isomorphic clsses of rooted connected grphs with 4 nodes nd exctly one circle, 9 of them contin twonodes circle. So G(6,2,4) hs 22 = congruence clsses of presenttions. === === === === === ===

16 16 Jin-yi Shi 3. The reltion set of presenttion for G(m,p,n) Let S = {s,t h 1 h n} be in Σ(m,p,n), where s = s(;k); ll the t h s re of type I; is the rooted node of Γ r S.

17 Complex Reflection Groups The following reltions hold: (A) s m/p = 1; (B) t 2 i = 1 for 1 i n; (C) t i t j = t j t i if the edges e(t i ) nd e(t j ) hve no common end node; (D) t i t j t i = t j t i t j if the edges e(t i ) nd e(t j ) hve exctly one common end node; (E) st i st i = t i st i s if is n end node of e(t i ); (F) st i = t i s if is not n end node of e(t i ); (G) (t i t j ) m/d = 1 if t i t j with e(t i ) nd e(t j ) hving two common end nodes, where d = gcd{m,δ(s)}; (H) t i t j t l t j = t j t l t j t i for ny triple X = {t i,t j,t l } S with Γ X hving brnching node (I) s t i t j t i = t i t j t i s, if e(t i ) nd e(t j ) hve exctly one common end node ;

18 18 Jin-yi Shi Cll s hj := t h t h+1...t j 1 t j t j 1...t h pth reflection in Γ r S : (J) (s 1j s j+1,r ) t h t h+1 t j x= t t m gcd{m,δ(s)} = 1 for p < j < q r r r 1 p q t t p+1 j 1 p+1 t j q q 1 (K) ss 1j s j+1,r = s 1j s j+1,r s for p < j < q j+1 t j+1 (L) (s j+1,r s 1j ) p 1 = s δ(s) s 1j s δ(s) s j+1,r for j p < j < q. x= t t r r r 1 p q t t p+1 j 1 p+1 t j q q 1 j+1 t j+1 j

19 Complex Reflection Groups 19 (M) For p < j < q () us 1j u vs j+1,r v = vs j+1,r v us 1j u, (b) us 1j s j+1,r us 1j s j+1,r =s 1j s j+1,r us 1j s j+1,r u, (c) vs 1j s j+1,r vs 1j s j+1,r =s 1j s j+1,r vs 1j s j+1,r v, x= t u t r r r 1 q t t p+1 j 1 p+1 t j Cll ll the reltions (A)-(M) bove the bsic reltions on S. p q q 1 j+1 t j+1 j v

20 20 Jin-yi Shi Then we hve. Theorem 3.3. Let S Σ(m,p,n) nd let P S be the set of ll the bsic reltions on S. Then (S,P S ) forms presenttion of G(m,p,n). Remrk 3.4. There re too much bsic reltions on S in generl. We cn get much smller subset P S from P S such tht (S,P S ) still forms presenttion of G(m,p,n). Under the ssumption of reltions (A) (F), we cn reduce the size of reltion set (J) by replcing it by (J ), the ltter consists of ny single reltion in (J). Similr for (K), (L) nd (M). The size of the reltion sets (I) nd (J) cn lso be reduced.

21 Complex Reflection Groups Two kinds of presenttions hve simpler reltion sets: (i) Γ r S is string: === (ii) Γ S is circle:

22 22 Jin-yi Shi 4. Reflection length T, the set of ll the reflections in G(m,p,n). Any w G(m,p,n) hs n expression w = s 1 s 2 s r with s i T. Denote by l T (w) the smllest possible r mong ll such expressions. Cll l T (w) the reflection length of w. l T (w) on G(m,p,n) is presenttion-free. We hve l T (w) l S (w) for ny presenttion (S,P) of G(m, p, n). Except for the cse of G(m,1,n) with one specil presenttion (see 5.1), so fr we hve no close formul of the length function l S (w) on G(m,p,n) with 1 < p m, where (S,P) is ny presenttion of G(m,p,n).

23 Complex Reflection Groups Given m,p,r P with p m. Let C = [[c 1,c 2,...,c r ]] be multi-set of r integers. P = {P 1,...,P l } prtition of [r]. Cll E [r] (C,m)-perfect if h E c h 0 (mod m); nd (C,m,p)-semi-perfect, if h E c h 0 (mod p) nd h E c h 0 (mod m). Cll P (C,m)-dmissible if P j is (C,m)-perfect for ny j [l]; nd (C,m,p)-semi-dmissible if P j is either (C,m)- perfect or (C,m,p)-semi-perfect for ny j [l].

24 24 Jin-yi Shi Let Λ(C;m) (resp., Λ(C;m,p)) be the set of ll the (C, m)-dmissible (resp., (C, m, p)-semidmissible) prtitions of [r]. When Λ(C;m) (resp., Λ(C;m,p) ), denote by t(p) (resp., u(p)) the number of (C,m)-perfect (resp., (C, m, p)-semi-perfect) blocks of P for ny P Λ(C;m) (resp., P Λ(C;m,p)), nd define t(c,m) = mx{t(p) P Λ(C;m)}. Define v(p) = 2t(P) + u(p) for ny P Λ(C;m,p). Define v(c,m,p) = mx{v(p) P Λ(C;m,p)} if Λ(C;m,p).

25 Complex Reflection Groups For w = [ζ 1 m,...,ζ n m σ] G(m,p,n), write: σ = (i 11,i 12,...,i 1m1 )...(i r1,i r2,...,i rmr ) with j [r] m j = n. Denote (i) r(w) = r. Let I j = {i j1,i j2,...,i jmj } for j [r]. Then I(w) = {I 1,...,I r } is prtition of [n] determined by w. Let c j = k I j k nd let C(w) = [[c 1,c 2,...,c r ]]. Denote Λ(w;m,p) := Λ(C(w);m,p). For w G(m,p,n), we lwys hve Λ(w;m,p). Denote (ii) t(w) := t(c(w),m) if p = m nd (iii) v(w) = v(c(w), m, p) if p m. (iv) t 0 (w) = #{j [r] c j 0 (mod m)}.

26 26 Jin-yi Shi Theorem 4.4. l T (w) = n t 0 (w). for ny w G(m,1,n). Theorem 4.5. l T (w) = n + r(w) 2t(w) for ny w G(m,m,n). Theorem 4.6. Let m,p,n P be with p m. Then l T (w) = n + r(w) v(w) for ny w G(m,p,n). When w G(m, 1, n), we hve t 0 (w) = v(w) r(w); when w G(m, m, n), we hve v(w) = 2t(w). So Theorems re specil cses of Theorem 4.6.

27 Complex Reflection Groups For ny y,w G(m,p,n), denote by y w nd cll w covers y (or y is covered by w), if yw 1 is reflection with l T (w) = l T (y) + 1. The reflection order on G(m,p,n) is the trnsitive closure of the covering reltions.

28 28 Jin-yi Shi 4.8. For ny cyclic permuttion σ S n, the set B(σ) = {τ S n τ σ} cn be described in terms of circle non-intersecting prtitions. Put the nodes 1,2,...,k on circle clockwise. Prtition these k nodes into h blocks X 1,...,X h with X j, j [h], such tht the convex hulls X j, j [h], of these blocks re pirwise disjoint. The prtition X = {X 1,...,X h } is clled circle non-intersecting prtition of [k]. Reding the nodes of ech X j clockwise long the boundry of X j, we get cyclic permuttion τ j. Then set τ(x) = τ 1 τ 2 τ h.

29 Complex Reflection Groups 29 Exmple 4.9. Let σ = (1,2,3,4,5,6,7,8,9,10,11) S n. Tke prtition X of [11] s in Figure 1. Then τ(x) B(σ) is (1,2,9,10)(4,5,8)(6,7)(3)(11) Figure 1. 6 τ σ if nd only if τ = τ(x) for some circle non-intersecting prtition X of [11].

30 30 Jin-yi Shi The reltion x y cn lso be described combintorilly in the group G(m,1,n). Theorem Let w = [ζ 1 m,...,ζ n m σ] G(m,1,n) be with σ = (1,2,...,r) cyclic permuttion nd j = 0 for j > r. C r. (1) If j [r] j 0 (mod m), then B(w) = (2) If j [r] j 0 (mod m), then B(w) = (r + 1) C r, where C r = 1 r+1 ( 2r r ), the rth Ctln number.

31 Complex Reflection Groups Auto. group Aut(m,p,n) of G(m,p,n). Assume m > 2 nd (p,n) (m,2) (i.e. G(m,p,n) is not Coxeter) G(m,p,n) hs genertor set S 0 : (i) {s 0,s 1,s i i [n 1]} if 1 < p < m; (ii) {s 0,s i i [n 1]} if p = 1; (iii) {s 1,s i i [n 1]} if p = m, where s 0 = s(1;p), s 1 = s(1,2; 1) nd s i = s(i,i + 1;0). G(m,1,n) s s s s n 1 G(m,m,n) s 1 s 1 s 2 n 1 s G(m,p,n) s s s 1 2 n 1 s 0 s 1

32 32 Jin-yi Shi 5.2. By n utomorphism φ of reflection group G, it mens tht φ is n utomorphism of the group G s n bstrct group which sends reflections of G to reflections Two presenttions (S,P), (S,P ) of G(m,p,n) re clled strongly congruent, if there exists bijective mp η : S S such tht P = η(p), where η(p) is obtined from P by substituting ny s S by η(s). strongly congruent = = congruent. A strongly congruent mp η cn be extended uniquely to n utomorphism of G.

33 Complex Reflection Groups Let τ g : h ghg 1 be the inner utomorphism of G(m, p, n). Let Int(m,p,n) = {τ g g G(m,p,n)} Set Φ(m) := {i [m 1] gcd(i,m) = 1}. For ny k Φ(m) nd ny mtrix w = ( ij ), define If then ψ k (w) = ( k ij ). w = [ζ 1 m,...,ζ n m σ] G(m,p,n), ψ k (w) = [ζ k 1 m,...,ζk n m σ] G(m,p,n). We hve ψ k Aut(m,p,n). Define Ψ(m) := {ψ k k Φ(m)}.

34 34 Jin-yi Shi 5.6. Let λ Aut(m,p,n), 1 < p m, be determined by λ(s 0 ) = s 1 0, λ(s 1) = s 1, λ(s 1 ) = s 1 nd λ(s i ) = s i for 1 < i < n s 1 s s 2 3 n 1 n s n 1 s 1 λ s 1 1 s s 1 s 2 3 n 1 n s n 1

35 Complex Reflection Groups 35 Let λ Aut(3,3,3) be determined by λ (s 1 ) = s(2,3; 1), λ (s i ) = s i for i = 1,2. s s 2 3 s 1 λ s 1 s(2,3; 1) s 2

36 36 Jin-yi Shi Let η Aut(4,2,2) be determined by (η(s 0 ),η(s 1 ),η(s 1 )) = (s 1,s 0,s 1 ). s 0 s η s 1 s s 1 s0

37 Complex Reflection Groups 37 Theorem 5.7. (1) If gcd(p,n) = 1, then Aut(m,p,n) = Int(m,p,n) Ψ(m); (2) If gcd(p,n) > 1 nd (m,p,n) (3,3,3),(4,2,2), then Aut(m,p,n) = Int(m,p,n),Ψ(m),λ ; (3) Aut(3,3,3) = τ s1,λ,λ. (4) Aut(4,2,2) = ψ 3,λ,η. Theorem 5.8. The order of Aut(m,p,n) is m n 1 n!φ(m) if (m,p,n) (3,3,3),(4,2,2), 432 if (m,p,n) = (3,3,3), 48 if (m,p,n) = (4,2,2).

38 38 Jin-yi Shi Some structurl properties of Aut(m, p, n) re studied. For exmple, we show tht the center Z(Aut(m,p,n)) of Aut(m,p,n) is trivil if n > 2; while Z(Aut(m,p,2)) contins 2 gcd(m,2) elements.

THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS. Circa 1870, G. Zolotarev observed that the Legendre symbol ( a p

THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS. Circa 1870, G. Zolotarev observed that the Legendre symbol ( a p THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS PETE L CLARK Circ 1870, Zolotrev observed tht the Legendre symbol ( p ) cn be interpreted s the sign of multipliction by viewed s permuttion of the set Z/pZ

More information

Lecture 3: Equivalence Relations

Lecture 3: Equivalence Relations Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts

More information

Coalgebra, Lecture 15: Equations for Deterministic Automata

Coalgebra, Lecture 15: Equations for Deterministic Automata Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined

More information

CM10196 Topic 4: Functions and Relations

CM10196 Topic 4: Functions and Relations CM096 Topic 4: Functions nd Reltions Guy McCusker W. Functions nd reltions Perhps the most widely used notion in ll of mthemtics is tht of function. Informlly, function is n opertion which tkes n input

More information

Lecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar)

Lecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar) Lecture 3 (5.3.2018) (trnslted nd slightly dpted from lecture notes by Mrtin Klzr) Riemnn integrl Now we define precisely the concept of the re, in prticulr, the re of figure U(, b, f) under the grph of

More information

N 0 completions on partial matrices

N 0 completions on partial matrices N 0 completions on prtil mtrices C. Jordán C. Mendes Arújo Jun R. Torregros Instituto de Mtemátic Multidisciplinr / Centro de Mtemátic Universidd Politécnic de Vlenci / Universidde do Minho Cmino de Ver

More information

378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A.

378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A. 378 Reltions 16.7 Solutions for Chpter 16 Section 16.1 Exercises 1. Let A = {0,1,2,3,4,5}. Write out the reltion R tht expresses > on A. Then illustrte it with digrm. 2 1 R = { (5,4),(5,3),(5,2),(5,1),(5,0),(4,3),(4,2),(4,1),

More information

AUTOMATA AND LANGUAGES. Definition 1.5: Finite Automaton

AUTOMATA AND LANGUAGES. Definition 1.5: Finite Automaton 25. Finite Automt AUTOMATA AND LANGUAGES A system of computtion tht only hs finite numer of possile sttes cn e modeled using finite utomton A finite utomton is often illustrted s stte digrm d d d. d q

More information

Spanning tree congestion of some product graphs

Spanning tree congestion of some product graphs Spnning tree congestion of some product grphs Hiu-Fi Lw Mthemticl Institute Oxford University 4-9 St Giles Oxford, OX1 3LB, United Kingdom e-mil: lwh@mths.ox.c.uk nd Mikhil I. Ostrovskii Deprtment of Mthemtics

More information

Computing with finite semigroups: part I

Computing with finite semigroups: part I Computing with finite semigroups: prt I J. D. Mitchell School of Mthemtics nd Sttistics, University of St Andrews Novemer 20th, 2015 J. D. Mitchell (St Andrews) Novemer 20th, 2015 1 / 34 Wht is this tlk

More information

Math 520 Final Exam Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008

Math 520 Final Exam Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008 Mth 520 Finl Exm Topic Outline Sections 1 3 (Xio/Dums/Liw) Spring 2008 The finl exm will be held on Tuesdy, My 13, 2-5pm in 117 McMilln Wht will be covered The finl exm will cover the mteril from ll of

More information

Free groups, Lecture 2, part 1

Free groups, Lecture 2, part 1 Free groups, Lecture 2, prt 1 Olg Khrlmpovich NYC, Sep. 2 1 / 22 Theorem Every sugroup H F of free group F is free. Given finite numer of genertors of H we cn compute its sis. 2 / 22 Schreir s grph The

More information

CMPSCI 250: Introduction to Computation. Lecture #31: What DFA s Can and Can t Do David Mix Barrington 9 April 2014

CMPSCI 250: Introduction to Computation. Lecture #31: What DFA s Can and Can t Do David Mix Barrington 9 April 2014 CMPSCI 250: Introduction to Computtion Lecture #31: Wht DFA s Cn nd Cn t Do Dvid Mix Brrington 9 April 2014 Wht DFA s Cn nd Cn t Do Deterministic Finite Automt Forml Definition of DFA s Exmples of DFA

More information

Random subgroups of a free group

Random subgroups of a free group Rndom sugroups of free group Frédérique Bssino LIPN - Lortoire d Informtique de Pris Nord, Université Pris 13 - CNRS Joint work with Armndo Mrtino, Cyril Nicud, Enric Ventur et Pscl Weil LIX My, 2015 Introduction

More information

Convert the NFA into DFA

Convert the NFA into DFA Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:

More information

Advanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004

Advanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004 Advnced Clculus: MATH 410 Notes on Integrls nd Integrbility Professor Dvid Levermore 17 October 2004 1. Definite Integrls In this section we revisit the definite integrl tht you were introduced to when

More information

MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35

MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 9. Modules over PID This week we re proving the fundmentl theorem for finitely generted modules over PID, nmely tht they re ll direct sums of cyclic modules.

More information

Minimal DFA. minimal DFA for L starting from any other

Minimal DFA. minimal DFA for L starting from any other Miniml DFA Among the mny DFAs ccepting the sme regulr lnguge L, there is exctly one (up to renming of sttes) which hs the smllest possile numer of sttes. Moreover, it is possile to otin tht miniml DFA

More information

Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018

Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018 Finite Automt Theory nd Forml Lnguges TMV027/DIT321 LP4 2018 Lecture 10 An Bove April 23rd 2018 Recp: Regulr Lnguges We cn convert between FA nd RE; Hence both FA nd RE ccept/generte regulr lnguges; More

More information

Simple Gamma Rings With Involutions.

Simple Gamma Rings With Involutions. IOSR Journl of Mthemtics (IOSR-JM) ISSN: 2278-5728. Volume 4, Issue (Nov. - Dec. 2012), PP 40-48 Simple Gmm Rings With Involutions. 1 A.C. Pul nd 2 Md. Sbur Uddin 1 Deprtment of Mthemtics University of

More information

The Perron-Frobenius operators, invariant measures and representations of the Cuntz-Krieger algebras

The Perron-Frobenius operators, invariant measures and representations of the Cuntz-Krieger algebras The Perron-Frobenius opertors, invrint mesures nd representtions of the Cuntz-Krieger lgebrs Ktsunori Kwmur Reserch Institute for Mthemticl Sciences Kyoto University, Kyoto 606-8502, Jpn For trnsformtion

More information

Diophantine Steiner Triples and Pythagorean-Type Triangles

Diophantine Steiner Triples and Pythagorean-Type Triangles Forum Geometricorum Volume 10 (2010) 93 97. FORUM GEOM ISSN 1534-1178 Diophntine Steiner Triples nd Pythgoren-Type Tringles ojn Hvl bstrct. We present connection between Diophntine Steiner triples (integer

More information

ON THE NILPOTENCY INDEX OF THE RADICAL OF A GROUP ALGEBRA. XI

ON THE NILPOTENCY INDEX OF THE RADICAL OF A GROUP ALGEBRA. XI Mth. J. Okym Univ. 44(2002), 51 56 ON THE NILPOTENCY INDEX OF THE RADICAL OF A GROUP ALGEBRA. XI Koru MOTOSE Let t(g) be the nilpotency index of the rdicl J(KG) of group lgebr KG of finite p-solvble group

More information

Graph Theory. Dr. Saad El-Zanati, Faculty Mentor Ryan Bunge Graduate Assistant Illinois State University REU. Graph Theory

Graph Theory. Dr. Saad El-Zanati, Faculty Mentor Ryan Bunge Graduate Assistant Illinois State University REU. Graph Theory Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Grph Theory Dniel Gibson, Concordi University Jckelyn Ngel, Dominicn University Benjmin Stnley, New Mexico Stte University Allison

More information

REPRESENTATION THEORY OF PSL 2 (q)

REPRESENTATION THEORY OF PSL 2 (q) REPRESENTATION THEORY OF PSL (q) YAQIAO LI Following re notes from book [1]. The im is to show the qusirndomness of PSL (q), i.e., the group hs no low dimensionl representtion. 1. Representtion Theory

More information

Theory of Computation Regular Languages

Theory of Computation Regular Languages Theory of Computtion Regulr Lnguges Bow-Yw Wng Acdemi Sinic Spring 2012 Bow-Yw Wng (Acdemi Sinic) Regulr Lnguges Spring 2012 1 / 38 Schemtic of Finite Automt control 0 0 1 0 1 1 1 0 Figure: Schemtic of

More information

arxiv: v1 [math.ra] 1 Nov 2014

arxiv: v1 [math.ra] 1 Nov 2014 CLASSIFICATION OF COMPLEX CYCLIC LEIBNIZ ALGEBRAS DANIEL SCOFIELD AND S MCKAY SULLIVAN rxiv:14110170v1 [mthra] 1 Nov 2014 Abstrct Since Leibniz lgebrs were introduced by Lody s generliztion of Lie lgebrs,

More information

DISCRETE MATHEMATICS HOMEWORK 3 SOLUTIONS

DISCRETE MATHEMATICS HOMEWORK 3 SOLUTIONS DISCRETE MATHEMATICS 21228 HOMEWORK 3 SOLUTIONS JC Due in clss Wednesdy September 17. You my collborte but must write up your solutions by yourself. Lte homework will not be ccepted. Homework must either

More information

1.9 C 2 inner variations

1.9 C 2 inner variations 46 CHAPTER 1. INDIRECT METHODS 1.9 C 2 inner vritions So fr, we hve restricted ttention to liner vritions. These re vritions of the form vx; ǫ = ux + ǫφx where φ is in some liner perturbtion clss P, for

More information

Introduction to Group Theory

Introduction to Group Theory Introduction to Group Theory Let G be n rbitrry set of elements, typiclly denoted s, b, c,, tht is, let G = {, b, c, }. A binry opertion in G is rule tht ssocites with ech ordered pir (,b) of elements

More information

Bases for Vector Spaces

Bases for Vector Spaces Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything

More information

Self-similarity and symmetries of Pascal s triangles and simplices mod p

Self-similarity and symmetries of Pascal s triangles and simplices mod p Sn Jose Stte University SJSU ScholrWorks Fculty Publictions Mthemtics nd Sttistics Februry 2004 Self-similrity nd symmetries of Pscl s tringles nd simplices mod p Richrd P. Kubelk Sn Jose Stte University,

More information

ad = cb (1) cf = ed (2) adf = cbf (3) cf b = edb (4)

ad = cb (1) cf = ed (2) adf = cbf (3) cf b = edb (4) 10 Most proofs re left s reding exercises. Definition 10.1. Z = Z {0}. Definition 10.2. Let be the binry reltion defined on Z Z by, b c, d iff d = cb. Theorem 10.3. is n equivlence reltion on Z Z. Proof.

More information

Theoretical foundations of Gaussian quadrature

Theoretical foundations of Gaussian quadrature Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of

More information

LECTURE 2: ARTIN SYMBOL, ARTIN MAP, ARTIN RECIPROCITY LAW AND FINITENESS OF GENERALIZED IDEAL CLASS GROUP

LECTURE 2: ARTIN SYMBOL, ARTIN MAP, ARTIN RECIPROCITY LAW AND FINITENESS OF GENERALIZED IDEAL CLASS GROUP Clss Field Theory Study Seminr Jnury 25 2017 LECTURE 2: ARTIN SYMBOL, ARTIN MAP, ARTIN RECIPROCITY LAW AND FINITENESS OF GENERALIZED IDEAL CLASS GROUP YIFAN WU Plese send typos nd comments to wuyifn@umich.edu

More information

Math Lecture 23

Math Lecture 23 Mth 8 - Lecture 3 Dyln Zwick Fll 3 In our lst lecture we delt with solutions to the system: x = Ax where A is n n n mtrix with n distinct eigenvlues. As promised, tody we will del with the question of

More information

CS 275 Automata and Formal Language Theory

CS 275 Automata and Formal Language Theory CS 275 Automt nd Forml Lnguge Theory Course Notes Prt II: The Recognition Problem (II) Chpter II.5.: Properties of Context Free Grmmrs (14) Anton Setzer (Bsed on book drft by J. V. Tucker nd K. Stephenson)

More information

Strong Bisimulation. Overview. References. Actions Labeled transition system Transition semantics Simulation Bisimulation

Strong Bisimulation. Overview. References. Actions Labeled transition system Transition semantics Simulation Bisimulation Strong Bisimultion Overview Actions Lbeled trnsition system Trnsition semntics Simultion Bisimultion References Robin Milner, Communiction nd Concurrency Robin Milner, Communicting nd Mobil Systems 32

More information

20 MATHEMATICS POLYNOMIALS

20 MATHEMATICS POLYNOMIALS 0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of

More information

Matrix Algebra. Matrix Addition, Scalar Multiplication and Transposition. Linear Algebra I 24

Matrix Algebra. Matrix Addition, Scalar Multiplication and Transposition. Linear Algebra I 24 Mtrix lger Mtrix ddition, Sclr Multipliction nd rnsposition Mtrix lger Section.. Mtrix ddition, Sclr Multipliction nd rnsposition rectngulr rry of numers is clled mtrix ( the plurl is mtrices ) nd the

More information

Best Approximation in the 2-norm

Best Approximation in the 2-norm Jim Lmbers MAT 77 Fll Semester 1-11 Lecture 1 Notes These notes correspond to Sections 9. nd 9.3 in the text. Best Approximtion in the -norm Suppose tht we wish to obtin function f n (x) tht is liner combintion

More information

set is not closed under matrix [ multiplication, ] and does not form a group.

set is not closed under matrix [ multiplication, ] and does not form a group. Prolem 2.3: Which of the following collections of 2 2 mtrices with rel entries form groups under [ mtrix ] multipliction? i) Those of the form for which c d 2 Answer: The set of such mtrices is not closed

More information

Theory of Computation Regular Languages. (NTU EE) Regular Languages Fall / 38

Theory of Computation Regular Languages. (NTU EE) Regular Languages Fall / 38 Theory of Computtion Regulr Lnguges (NTU EE) Regulr Lnguges Fll 2017 1 / 38 Schemtic of Finite Automt control 0 0 1 0 1 1 1 0 Figure: Schemtic of Finite Automt A finite utomton hs finite set of control

More information

II. Integration and Cauchy s Theorem

II. Integration and Cauchy s Theorem MTH6111 Complex Anlysis 2009-10 Lecture Notes c Shun Bullett QMUL 2009 II. Integrtion nd Cuchy s Theorem 1. Pths nd integrtion Wrning Different uthors hve different definitions for terms like pth nd curve.

More information

On the free product of ordered groups

On the free product of ordered groups rxiv:703.0578v [mth.gr] 6 Mr 207 On the free product of ordered groups A. A. Vinogrdov One of the fundmentl questions of the theory of ordered groups is wht bstrct groups re orderble. E. P. Shimbirev [2]

More information

Symbolic enumeration methods for unlabelled structures

Symbolic enumeration methods for unlabelled structures Go & Šjn, Comintoril Enumertion Notes 4 Symolic enumertion methods for unlelled structures Definition A comintoril clss is finite or denumerle set on which size function is defined, stisfying the following

More information

Quadratic Residues. Chapter Quadratic residues

Quadratic Residues. Chapter Quadratic residues Chter 8 Qudrtic Residues 8. Qudrtic residues Let n>be given ositive integer, nd gcd, n. We sy tht Z n is qudrtic residue mod n if the congruence x mod n is solvble. Otherwise, is clled qudrtic nonresidue

More information

Quadratic Forms. Quadratic Forms

Quadratic Forms. Quadratic Forms Qudrtic Forms Recll the Simon & Blume excerpt from n erlier lecture which sid tht the min tsk of clculus is to pproximte nonliner functions with liner functions. It s ctully more ccurte to sy tht we pproximte

More information

Note 16. Stokes theorem Differential Geometry, 2005

Note 16. Stokes theorem Differential Geometry, 2005 Note 16. Stokes theorem ifferentil Geometry, 2005 Stokes theorem is the centrl result in the theory of integrtion on mnifolds. It gives the reltion between exterior differentition (see Note 14) nd integrtion

More information

Riemann is the Mann! (But Lebesgue may besgue to differ.)

Riemann is the Mann! (But Lebesgue may besgue to differ.) Riemnn is the Mnn! (But Lebesgue my besgue to differ.) Leo Livshits My 2, 2008 1 For finite intervls in R We hve seen in clss tht every continuous function f : [, b] R hs the property tht for every ɛ >

More information

Section 14.3 Arc Length and Curvature

Section 14.3 Arc Length and Curvature Section 4.3 Arc Length nd Curvture Clculus on Curves in Spce In this section, we ly the foundtions for describing the movement of n object in spce.. Vector Function Bsics In Clc, formul for rc length in

More information

Math 61CM - Solutions to homework 9

Math 61CM - Solutions to homework 9 Mth 61CM - Solutions to homework 9 Cédric De Groote November 30 th, 2018 Problem 1: Recll tht the left limit of function f t point c is defined s follows: lim f(x) = l x c if for ny > 0 there exists δ

More information

1. Gauss-Jacobi quadrature and Legendre polynomials. p(t)w(t)dt, p {p(x 0 ),...p(x n )} p(t)w(t)dt = w k p(x k ),

1. Gauss-Jacobi quadrature and Legendre polynomials. p(t)w(t)dt, p {p(x 0 ),...p(x n )} p(t)w(t)dt = w k p(x k ), 1. Guss-Jcobi qudrture nd Legendre polynomils Simpson s rule for evluting n integrl f(t)dt gives the correct nswer with error of bout O(n 4 ) (with constnt tht depends on f, in prticulr, it depends on

More information

Finite Automata. Informatics 2A: Lecture 3. John Longley. 22 September School of Informatics University of Edinburgh

Finite Automata. Informatics 2A: Lecture 3. John Longley. 22 September School of Informatics University of Edinburgh Lnguges nd Automt Finite Automt Informtics 2A: Lecture 3 John Longley School of Informtics University of Edinburgh jrl@inf.ed.c.uk 22 September 2017 1 / 30 Lnguges nd Automt 1 Lnguges nd Automt Wht is

More information

Infinite Geometric Series

Infinite Geometric Series Infinite Geometric Series Finite Geometric Series ( finite SUM) Let 0 < r < 1, nd let n be positive integer. Consider the finite sum It turns out there is simple lgebric expression tht is equivlent to

More information

State space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies

State space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies Stte spce systems nlysis (continued) Stbility A. Definitions A system is sid to be Asymptoticlly Stble (AS) when it stisfies ut () = 0, t > 0 lim xt () 0. t A system is AS if nd only if the impulse response

More information

STUDY GUIDE FOR BASIC EXAM

STUDY GUIDE FOR BASIC EXAM STUDY GUIDE FOR BASIC EXAM BRYON ARAGAM This is prtil list of theorems tht frequently show up on the bsic exm. In mny cses, you my be sked to directly prove one of these theorems or these vrints. There

More information

Pavel Rytí. November 22, 2011 Discrete Math Seminar - Simon Fraser University

Pavel Rytí. November 22, 2011 Discrete Math Seminar - Simon Fraser University Geometric representtions of liner codes Pvel Rytí Deprtment of Applied Mthemtics Chrles University in Prgue Advisor: Mrtin Loebl November, 011 Discrete Mth Seminr - Simon Frser University Bckground Liner

More information

Convex Sets and Functions

Convex Sets and Functions B Convex Sets nd Functions Definition B1 Let L, +, ) be rel liner spce nd let C be subset of L The set C is convex if, for ll x,y C nd ll [, 1], we hve 1 )x+y C In other words, every point on the line

More information

1.3 Regular Expressions

1.3 Regular Expressions 56 1.3 Regulr xpressions These hve n importnt role in describing ptterns in serching for strings in mny pplictions (e.g. wk, grep, Perl,...) All regulr expressions of lphbet re 1.Ønd re regulr expressions,

More information

Chapter 3 Polynomials

Chapter 3 Polynomials Dr M DRAIEF As described in the introduction of Chpter 1, pplictions of solving liner equtions rise in number of different settings In prticulr, we will in this chpter focus on the problem of modelling

More information

Finite Automata. Informatics 2A: Lecture 3. Mary Cryan. 21 September School of Informatics University of Edinburgh

Finite Automata. Informatics 2A: Lecture 3. Mary Cryan. 21 September School of Informatics University of Edinburgh Finite Automt Informtics 2A: Lecture 3 Mry Cryn School of Informtics University of Edinburgh mcryn@inf.ed.c.uk 21 September 2018 1 / 30 Lnguges nd Automt Wht is lnguge? Finite utomt: recp Some forml definitions

More information

HW3, Math 307. CSUF. Spring 2007.

HW3, Math 307. CSUF. Spring 2007. HW, Mth 7. CSUF. Spring 7. Nsser M. Abbsi Spring 7 Compiled on November 5, 8 t 8:8m public Contents Section.6, problem Section.6, problem Section.6, problem 5 Section.6, problem 7 6 5 Section.6, problem

More information

4.5 JACOBI ITERATION FOR FINDING EIGENVALUES OF A REAL SYMMETRIC MATRIX. be a real symmetric matrix. ; (where we choose θ π for.

4.5 JACOBI ITERATION FOR FINDING EIGENVALUES OF A REAL SYMMETRIC MATRIX. be a real symmetric matrix. ; (where we choose θ π for. 4.5 JACOBI ITERATION FOR FINDING EIGENVALUES OF A REAL SYMMETRIC MATRIX Some reliminries: Let A be rel symmetric mtrix. Let Cos θ ; (where we choose θ π for Cos θ 4 purposes of convergence of the scheme)

More information

ON THE EXCEPTIONAL SET IN THE PROBLEM OF DIOPHANTUS AND DAVENPORT

ON THE EXCEPTIONAL SET IN THE PROBLEM OF DIOPHANTUS AND DAVENPORT ON THE EXCEPTIONAL SET IN THE PROBLEM OF DIOPHANTUS AND DAVENPORT Andrej Dujell Deprtment of Mthemtics, University of Zgreb, 10000 Zgreb, CROATIA The Greek mthemticin Diophntus of Alexndri noted tht the

More information

Energy Bands Energy Bands and Band Gap. Phys463.nb Phenomenon

Energy Bands Energy Bands and Band Gap. Phys463.nb Phenomenon Phys463.nb 49 7 Energy Bnds Ref: textbook, Chpter 7 Q: Why re there insultors nd conductors? Q: Wht will hppen when n electron moves in crystl? In the previous chpter, we discussed free electron gses,

More information

On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach

On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach On Computing the Distinguishing Numbers of Plnr Grphs nd Beyond: Counting Approch V. Arvind The Institute of Mthemticl Sciences Chenni 600 113, Indi rvind@imsc.res.in Christine T. Cheng Deprtment of Electricl

More information

Generalized Fano and non-fano networks

Generalized Fano and non-fano networks Generlized Fno nd non-fno networks Nildri Ds nd Brijesh Kumr Ri Deprtment of Electronics nd Electricl Engineering Indin Institute of Technology Guwhti, Guwhti, Assm, Indi Emil: {d.nildri, bkri}@iitg.ernet.in

More information

Left Cells in the Affine Weyl Group of Type C 4

Left Cells in the Affine Weyl Group of Type C 4 Ž JOURNAL OF ALGEBRA 202, 745 776 1998 ARTICLE NO JA977282 Left Cells in the Affine Weyl Group of Type C 4 Jin-yi Shi* Deprtment of Mthemtics, Est Chin Norml Uni ersity, Shnghi, 200062, People s Republic

More information

Frobenius numbers of generalized Fibonacci semigroups

Frobenius numbers of generalized Fibonacci semigroups Frobenius numbers of generlized Fiboncci semigroups Gretchen L. Mtthews 1 Deprtment of Mthemticl Sciences, Clemson University, Clemson, SC 29634-0975, USA gmtthe@clemson.edu Received:, Accepted:, Published:

More information

Appendix to Notes 8 (a)

Appendix to Notes 8 (a) Appendix to Notes 8 () 13 Comprison of the Riemnn nd Lebesgue integrls. Recll Let f : [, b] R be bounded. Let D be prtition of [, b] such tht Let D = { = x 0 < x 1

More information

Speech Recognition Lecture 2: Finite Automata and Finite-State Transducers. Mehryar Mohri Courant Institute and Google Research

Speech Recognition Lecture 2: Finite Automata and Finite-State Transducers. Mehryar Mohri Courant Institute and Google Research Speech Recognition Lecture 2: Finite Automt nd Finite-Stte Trnsducers Mehryr Mohri Cournt Institute nd Google Reserch mohri@cims.nyu.com Preliminries Finite lphet Σ, empty string. Set of ll strings over

More information

A New Solution to the Intersection Problem of Mendelsohn Triple Systems. Rachel Watson

A New Solution to the Intersection Problem of Mendelsohn Triple Systems. Rachel Watson A New Solution to the Intersection Prolem of Mendelsohn Triple Systems y Rchel Wtson A thesis sumitted to the Grdute Fculty of Auurn University in prtil fulfillment of the requirements for the Degree of

More information

Geometric Sequences. Geometric Sequence a sequence whose consecutive terms have a common ratio.

Geometric Sequences. Geometric Sequence a sequence whose consecutive terms have a common ratio. Geometric Sequences Geometric Sequence sequence whose consecutive terms hve common rtio. Geometric Sequence A sequence is geometric if the rtios of consecutive terms re the sme. 2 3 4... 2 3 The number

More information

Myhill-Nerode Theorem

Myhill-Nerode Theorem Overview Myhill-Nerode Theorem Correspondence etween DA s nd MN reltions Cnonicl DA for L Computing cnonicl DFA Myhill-Nerode Theorem Deepk D Souz Deprtment of Computer Science nd Automtion Indin Institute

More information

Well Centered Spherical Quadrangles

Well Centered Spherical Quadrangles Beiträge zur Algebr und Geometrie Contributions to Algebr nd Geometry Volume 44 (003), No, 539-549 Well Centered Sphericl Qudrngles An M d Azevedo Bred 1 Altino F Sntos Deprtment of Mthemtics, University

More information

a,b a 1 a 2 a 3 a,b 1 a,b a,b 2 3 a,b a,b a 2 a,b CS Determinisitic Finite Automata 1

a,b a 1 a 2 a 3 a,b 1 a,b a,b 2 3 a,b a,b a 2 a,b CS Determinisitic Finite Automata 1 CS4 45- Determinisitic Finite Automt -: Genertors vs. Checkers Regulr expressions re one wy to specify forml lnguge String Genertor Genertes strings in the lnguge Deterministic Finite Automt (DFA) re nother

More information

Lecture 08: Feb. 08, 2019

Lecture 08: Feb. 08, 2019 4CS4-6:Theory of Computtion(Closure on Reg. Lngs., regex to NDFA, DFA to regex) Prof. K.R. Chowdhry Lecture 08: Fe. 08, 2019 : Professor of CS Disclimer: These notes hve not een sujected to the usul scrutiny

More information

Review of Riemann Integral

Review of Riemann Integral 1 Review of Riemnn Integrl In this chpter we review the definition of Riemnn integrl of bounded function f : [, b] R, nd point out its limittions so s to be convinced of the necessity of more generl integrl.

More information

Lexical Analysis Finite Automate

Lexical Analysis Finite Automate Lexicl Anlysis Finite Automte CMPSC 470 Lecture 04 Topics: Deterministic Finite Automt (DFA) Nondeterministic Finite Automt (NFA) Regulr Expression NFA DFA A. Finite Automt (FA) FA re grph, like trnsition

More information

CS375: Logic and Theory of Computing

CS375: Logic and Theory of Computing CS375: Logic nd Theory of Computing Fuhu (Frnk) Cheng Deprtment of Computer Science University of Kentucky 1 Tble of Contents: Week 1: Preliminries (set lgebr, reltions, functions) (red Chpters 1-4) Weeks

More information

Finite Automata-cont d

Finite Automata-cont d Automt Theory nd Forml Lnguges Professor Leslie Lnder Lecture # 6 Finite Automt-cont d The Pumping Lemm WEB SITE: http://ingwe.inghmton.edu/ ~lnder/cs573.html Septemer 18, 2000 Exmple 1 Consider L = {ww

More information

1 The Lagrange interpolation formula

1 The Lagrange interpolation formula Notes on Qudrture 1 The Lgrnge interpoltion formul We briefly recll the Lgrnge interpoltion formul. The strting point is collection of N + 1 rel points (x 0, y 0 ), (x 1, y 1 ),..., (x N, y N ), with x

More information

We partition C into n small arcs by forming a partition of [a, b] by picking s i as follows: a = s 0 < s 1 < < s n = b.

We partition C into n small arcs by forming a partition of [a, b] by picking s i as follows: a = s 0 < s 1 < < s n = b. Mth 255 - Vector lculus II Notes 4.2 Pth nd Line Integrls We begin with discussion of pth integrls (the book clls them sclr line integrls). We will do this for function of two vribles, but these ides cn

More information

Intuitionistic Fuzzy Lattices and Intuitionistic Fuzzy Boolean Algebras

Intuitionistic Fuzzy Lattices and Intuitionistic Fuzzy Boolean Algebras Intuitionistic Fuzzy Lttices nd Intuitionistic Fuzzy oolen Algebrs.K. Tripthy #1, M.K. Stpthy *2 nd P.K.Choudhury ##3 # School of Computing Science nd Engineering VIT University Vellore-632014, TN, Indi

More information

SPACES DOMINATED BY METRIC SUBSETS

SPACES DOMINATED BY METRIC SUBSETS Volume 9, 1984 Pges 149 163 http://topology.uburn.edu/tp/ SPACES DOMINATED BY METRIC SUBSETS by Yoshio Tnk nd Zhou Ho-xun Topology Proceedings Web: http://topology.uburn.edu/tp/ Mil: Topology Proceedings

More information

arxiv: v3 [math.co] 11 Jan 2018

arxiv: v3 [math.co] 11 Jan 2018 Semi-Bxter nd strong-bxter: two reltives of the Bxter sequence Mthilde Bouvel, Veronic Guerrini, Andrew Rechnitzer, nd Simone Rinldi Jnury 12, 2018 rxiv:1702.04529v3 [mth.co] 11 Jn 2018 Abstrct In this

More information

Infinitely presented graphical small cancellation groups

Infinitely presented graphical small cancellation groups Infinitely presented grphicl smll cncelltion groups Dominik Gruer Université de Neuchâtel Stevens Group Theory Interntionl Weinr Decemer 10, 2015 Dominik Gruer (Neuchâtel) 2/30 Motivtion Grphicl smll cncelltion

More information

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn

More information

The Dirac distribution

The Dirac distribution A DIRAC DISTRIBUTION A The Dirc distribution A Definition of the Dirc distribution The Dirc distribution δx cn be introduced by three equivlent wys Dirc [] defined it by reltions δx dx, δx if x The distribution

More information

(e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer

(e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer Divisibility In this note we introduce the notion of divisibility for two integers nd b then we discuss the division lgorithm. First we give forml definition nd note some properties of the division opertion.

More information

1 2-D Second Order Equations: Separation of Variables

1 2-D Second Order Equations: Separation of Variables Chpter 12 PDEs in Rectngles 1 2-D Second Order Equtions: Seprtion of Vribles 1. A second order liner prtil differentil eqution in two vribles x nd y is A 2 u x + B 2 u 2 x y + C 2 u y + D u 2 x + E u +

More information

f(x)dx . Show that there 1, 0 < x 1 does not exist a differentiable function g : [ 1, 1] R such that g (x) = f(x) for all

f(x)dx . Show that there 1, 0 < x 1 does not exist a differentiable function g : [ 1, 1] R such that g (x) = f(x) for all 3 Definite Integrl 3.1 Introduction In school one comes cross the definition of the integrl of rel vlued function defined on closed nd bounded intervl [, b] between the limits nd b, i.e., f(x)dx s the

More information

Formal Languages and Automata

Formal Languages and Automata Moile Computing nd Softwre Engineering p. 1/5 Forml Lnguges nd Automt Chpter 2 Finite Automt Chun-Ming Liu cmliu@csie.ntut.edu.tw Deprtment of Computer Science nd Informtion Engineering Ntionl Tipei University

More information

Left Cells in the Affine Weyl Group of Type F 4

Left Cells in the Affine Weyl Group of Type F 4 Ž. JOURNA OF AGEBRA 200, 173206 1998 ARTICE NO. JA977043 eft Cells in the Affine Weyl Group of Type F 4 Jin-yi Shi* Mx-Plnck-Institut fur Mthemtik, 53225 Bonn, Germny; nd Deprtment of Mthemtics, Est Chin

More information

Bernoulli Numbers Jeff Morton

Bernoulli Numbers Jeff Morton Bernoulli Numbers Jeff Morton. We re interested in the opertor e t k d k t k, which is to sy k tk. Applying this to some function f E to get e t f d k k tk d k f f + d k k tk dk f, we note tht since f

More information

Lesson 1: Quadratic Equations

Lesson 1: Quadratic Equations Lesson 1: Qudrtic Equtions Qudrtic Eqution: The qudrtic eqution in form is. In this section, we will review 4 methods of qudrtic equtions, nd when it is most to use ech method. 1. 3.. 4. Method 1: Fctoring

More information

Theory of the Integral

Theory of the Integral Spring 2012 Theory of the Integrl Author: Todd Gugler Professor: Dr. Drgomir Sric My 10, 2012 2 Contents 1 Introduction 5 1.0.1 Office Hours nd Contct Informtion..................... 5 1.1 Set Theory:

More information

1.4 Nonregular Languages

1.4 Nonregular Languages 74 1.4 Nonregulr Lnguges The number of forml lnguges over ny lphbet (= decision/recognition problems) is uncountble On the other hnd, the number of regulr expressions (= strings) is countble Hence, ll

More information

p-adic Egyptian Fractions

p-adic Egyptian Fractions p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction

More information