Infinitely presented graphical small cancellation groups
|
|
- Coleen Hardy
- 5 years ago
- Views:
Transcription
1 Infinitely presented grphicl smll cncelltion groups Dominik Gruer Université de Neuchâtel Stevens Group Theory Interntionl Weinr Decemer 10, 2015
2 Dominik Gruer (Neuchâtel) 2/30 Motivtion Grphicl smll cncelltion theory (Gromov 2003) Tool for constructing finitely generted groups with prescried sugrphs in their Cyley grphs. Gromov s monsters (Gromov 03, Arzhntsev-Delznt 08, Osjd 14) Contin expnders (infinite sequences of sprse highly connected finite grphs) in good wy. Do not corsely emed into Hilert spce. Only known counterexmples to the Bum-Connes conjecture with coefficients. Tody: most generl comintoril interprettion of the theory!
3 Dominik Gruer (Neuchâtel) 3/30 Pln 1 Grphicl smll cncelltion theory 2 Corse emedding theorem 3 Acylindricl hyperolicity theorem
4 Group defined y lelled grph Lelled grph Grph Γ where every edge hs orienttion nd lel in S s Group defined y Γ G(Γ) := S lels of closed pths in Γ Exmple:,, c 2 c , 2 1 c 2 1 c 1,... c c c c Dominik Gruer (Neuchâtel) 4/30
5 Group defined y lelled grph Lelled grph Grph Γ where every edge hs orienttion nd lel in S s Group defined y Γ G(Γ) := S lels of closed pths in Γ Exmple:,, c 2 c , 2 1 c 2 1 c 1,... c c c c Dominik Gruer (Neuchâtel) 4/30
6 Dominik Gruer (Neuchâtel) 5/30 Group defined y lelled grph Lelled grph Grph Γ where every edge hs orienttion nd lel in S s Group defined y Γ G(Γ) := S lels of closed pths in Γ Lelling induces mp Γ Cy(G(Γ), S) Γ 0 connected component, choose imge of se vertex. Mp: Γ 0 Cy(G(Γ), S). Well-defined since closed pths re sent to closed pths. Cution! Mp is not necessrily injective, qusi-isometric,...
7 Piece Grphicl Gr(k) smll cncelltion condition Reduced pth p s.t. there exist pths p 1 nd p 2 in Γ with the sme lel s p s.t. for every utomorphism φ of Γ we hve φ(p 1 ) p 2. pieces: c c girth(γ) = 7 Γ stisfies Gr(7)-condition c c c Grphicl Gr(k)-condition No simple closed pth is conctention of fewer thn k pieces. s s s s The lelling is reduced (no:, ). Dominik Gruer (Neuchâtel) 6/30
8 Dominik Gruer (Neuchâtel) 7/30 Exmple: clssicl C(k)-presenttions Clssicl smll cncelltion = grphicl over cycle grphs S R presenttion, for r R, let γ r e cycle grph lelled y r. Γ R := r R S R clssicl C(k). Γ R grphicl Gr(k). γ r r 1 r 2 p p Clssicl pieces correspond to grphicl pieces!
9 Dominik Gruer (Neuchâtel) 8/30 Method: vn Kmpen digrms Vn Kmpen digrm D over S R Finite connected S-lelled grph emedded in R 2 s.t. every ounded region (fce) hs oundry word in R. Boundry word of D is the word on the oundry of the unounded region. Vn Kmpen s Lemm w is trivil in G. There exists D with oundry word w. S R =, 1 1 w =
10 Dominik Gruer (Neuchâtel) 9/30 Method: vn Kmpen digrms Vn Kmpen digrm D over S R Finite connected S-lelled grph emedded in R 2 s.t. every ounded region (fce) hs oundry word in R. Boundry word of D is the word on the oundry of the unounded region. Vn Kmpen s Lemm w is trivil in G. There exists D with oundry word w. Arc in digrm Pth where ll vertices except the endpoints hve degree 2.
11 Dominik Gruer (Neuchâtel) 10/30 Smll cncelltion digrms Grphicl vn Kmpen lemm (G 2012) Γ Gr(6)-grph, w trivil in G(Γ). Then, if D is digrm for w over S lels of simple closed pths in Γ with miniml numer of edges, then ll interior rcs of D re pieces. q 2 Π 2 p Π 1 q 1 Mps Π 1 p Π 2 Γ Γ If mps re distinct, then p is piece. If mps coincide, then q 1 q2 1 is imge of closed pth in Γ. Remove p nd fold edges in digrm to decompose into imges of simple closed pths.
12 Dominik Gruer (Neuchâtel) 10/30 Smll cncelltion digrms Grphicl vn Kmpen lemm (G 2012) Γ Gr(6)-grph, w trivil in G(Γ). Then, if D is digrm for w over S lels of simple closed pths in Γ with miniml numer of edges, then ll interior rcs of D re pieces. q 2 Π 2 p Π 1 q 1 Mps Π 1 p Π 2 Γ Γ If mps re distinct, then p is piece. If mps coincide, then q 1 q2 1 is imge of closed pth in Γ. Remove p nd fold edges in digrm to decompose into imges of simple closed pths.
13 Dominik Gruer (Neuchâtel) 10/30 Smll cncelltion digrms Grphicl vn Kmpen lemm (G 2012) Γ Gr(6)-grph, w trivil in G(Γ). Then, if D is digrm for w over S lels of simple closed pths in Γ with miniml numer of edges, then ll interior rcs of D re pieces. q 2 Π 2 p Π 1 q 1 Mps Π 1 p Π 2 Γ Γ If mps re distinct, then p is piece. If mps coincide, then q 1 q2 1 is imge of closed pth in Γ. Remove p nd fold edges in digrm to decompose into imges of simple closed pths.
14 Dominik Gruer (Neuchâtel) 11/30 Smll cncelltion digrms Grphicl vn Kmpen lemm (G 2012) Γ Gr(6)-grph, w trivil in G(Γ). Then, if D is digrm for w over S lels of simple closed pths in Γ with miniml numer of edges, then ll interior rcs of D re pieces. Γ Gr(k)-grph for k 6. Then every interior fce of D hs t lest k rcs.
15 Dominik Gruer (Neuchâtel) 12/30 Appliction: Gromov hyperolicity Theorem (G 2012) Γ finite Gr(7)-lelled grph, S finite. Then G(Γ) is hyperolic. Digrms where ll interior fces hve 7 rcs stisfy fces(d) 8 D. Thus, G(Γ) hs finite presenttion stisfying liner isoperimetric inequlity. Imge uthor: Tomruen (Wikipedi); colors hve een ltered
16 Dominik Gruer (Neuchâtel) 13/30 Appliction: sphericity Theorem (G 2012) Γ Gr(6)-lelled grph with no non-trivil lel-preserving utomorphisms. Then G(Γ) hs n sphericl presenttion complex nd, hence, is torsion-free. Ide: Digrms where ll fces hve 6 rcs cnnot tessellte the 2-sphere. Remrk. If Γ = Γ R with S R clssicl C(6), then no utomorphisms in Γ R no proper powers in R.
17 Dominik Gruer (Neuchâtel) 14/30 Finitely presented grphicl smll cncelltion groups New torsion-free hyperolic groups Property (T) groups (Gromov 03, Silermn 03, Ollivier-Wise 07). Non-unique product groups (Rips-Segev 87, Steenock 15, G-Mrtin-Steenock 15).
18 Dominik Gruer (Neuchâtel) 15/30 Pln 1 Grphicl smll cncelltion theory 2 Corse emedding theorem 3 Acylindricl hyperolicity theorem
19 Theorem (G 2012) Corse emedding theorem Γ = n N Γ n Gr(6)-grph, S finite, ech Γ n finite. Then Γ corsely emeds into Cy(G(Γ), S). Corse emedding A mp f : n N X n Y, where X n, Y re metric spces, is CE if for ll sequences (x k, x k ) n NX n X n we hve d(x k, x k ) d( f (x k ), f (x k )) Applictions F.g. group with CE expnder is counterexmple to Bum- Connes conjecture with coefficients, does not CE into H. F.g. group with CE lrge girth sequence of 3-regulr grphs is not corsely menle. Dominik Gruer (Neuchâtel) 16/30
20 Dominik Gruer (Neuchâtel) 17/30 Greendlinger s lemm Lemm D digrm with t lest 2 fces s.t. every interior fce hs t lest 6 rcs. Then D hs t lest 2 fces tht ech intersect D in (connected!) rc nd ech hve t most 3 interior rcs. Proof: rewrite Euler chrcteristic V E + F = 1.
21 Π fce with rc q = Π D supth of D. Mps q p Γ nd q Π Γ. If mps re distinct, q is piece. If mps coincide, remove q nd replce it y q in D nother pth p : x y, contrdicting minimlity. q piece & Π more thn 3 interior rcs. Dominik Gruer (Neuchâtel) 18/30 Lemm (G 2012) Step 1: ech component injects Let Γ 0 e connected component of Gr(6)-grph Γ. Then ny lel-preserving mp f : Γ 0 Cy(G(Γ), S) is injective. Assume x y with f (x) = f (y). Let p pth x y s.t. dig. D for l(p) whose numer of edges is miniml mong ll choices for p. x q Π y
22 Π fce with rc q = Π D supth of D. Mps q p Γ nd q Π Γ. If mps re distinct, q is piece. If mps coincide, remove q nd replce it y q in D nother pth p : x y, contrdicting minimlity. q piece & Π more thn 3 interior rcs. Dominik Gruer (Neuchâtel) 18/30 Lemm (G 2012) Step 1: ech component injects Let Γ 0 e connected component of Gr(6)-grph Γ. Then ny lel-preserving mp f : Γ 0 Cy(G(Γ), S) is injective. Assume x y with f (x) = f (y). Let p pth x y s.t. dig. D for l(p) whose numer of edges is miniml mong ll choices for p. x y q Π q
23 Dominik Gruer (Neuchâtel) 18/30 Lemm (G 2012) Step 1: ech component injects Let Γ 0 e connected component of Gr(6)-grph Γ. Then ny lel-preserving mp f : Γ 0 Cy(G(Γ), S) is injective. Assume x y with f (x) = f (y). Let p pth x y s.t. dig. D for l(p) whose numer of edges is miniml mong ll choices for p. D hs t lest 1 fce ecuse the lelling of Γ is reduced. Every fce with Π D connected hs more thn 3 interior rcs. (In prticulr, D hs more thn 1 fce.) Contrdiction to Greendlinger s lemm x nd y do not exist f is injective.
24 Dominik Gruer (Neuchâtel) 19/30 Step 2: prove corse emedding Theorem (G 2012) Γ = n N Γ n Gr(6)-grph, S finite, ech Γ n finite. Then Γ corsely emeds into Cy(G(Γ), S). Emedded does not necessrily imply corsely emedded: D Arguments s efore show tht digrms D hve no fces.
25 Dominik Gruer (Neuchâtel) 20/30 Theorem (Osjd 2014) Gr(k)-lellings exist Let k 0 nd (Γ i ) i N e sequence of finite connected grphs with vertex degree d such tht Γ i, dim(γ i )/ girth(γ i ) < C for some C < Then there exist finite set S nd n infinite susequence (Γ ji ) i N such tht i I Γ ji dmits Gr(k)-lelling y S. This produces Only known groups with corsely emedded expnders, some even isometriclly emedded (Ollivier 06). Only known non-corsely menle groups with the Hgerup property (Arzhntsev-Osjd 14).
26 Dominik Gruer (Neuchâtel) 21/30 Corse emedding theorem Theorem (G 2012) Γ = n N Γ n Gr(6)-grph, S finite, ech Γ n finite. Then Γ corsely emeds into Cy(G(Γ), S). Reserch directions. Gr(6)-condition wekest possile condition to get corse emedding explicit Gromov s monsters? New pproch: use grphs with mny utomorphisms, e.g. sequences of finite Cyley grphs.
27 Dominik Gruer (Neuchâtel) 22/30 Pln 1 Grphicl smll cncelltion theory 2 Corse emedding theorem 3 Acylindricl hyperolicity theorem
28 Dominik Gruer (Neuchâtel) 23/30 Acylindricl hyperolicity theorem Theorem (G-Sisto 2014) Let Γ e Gr(7)-lelled grph whose components re finite. Then G(Γ) is either cylindriclly hyperolic or virtully cyclic. Some consequences of cylindricl hyperolicity G is SQ-universl. All symptotic cones of G hve cut-points. Cred (G) is simple if G hs no finite norml sugroups. Acylindricl hyperolicity G is cylindriclly hyperolic if it is not virtully cyclic nd cts y isometries on Gromov hyperolic spce s.t. there exists WPD element g G.
29 Theorem (GS 2014) The hyperolic spce Y Γ Gr(7)-lelled grph, W = ll words red on Γ. Then Y := Cy(G(Γ), S W ) is Gromov hyperolic. Γ 0 in Cy(G(Γ), S): Γ 0 in Y : Proposition (GS 2014) G = S R, W = {suwords of elements of R}. If x F (S), let x S W lest k s.t. x = w 1 ±1 w 2 ±1... w ±1 k, w i S W. If C > 0: x F (S) representing 1 G : Are R (x) < C x S W, then Cy(G, S W ) is hyperolic. Dominik Gruer (Neuchâtel) 24/30
30 Dominik Gruer (Neuchâtel) 25/30 The WPD element WPD element g is WPD element for the ction of G on Y if: g is hyperolic, i.e. Z Y, z g z is QI-emedding. g stisfies the WPD condition, i.e. for every K > 0 there exists N 0 > 0 such tht for ll N N 0 : {h G d Y (h, 1) < K, d Y (g N hg N, 1) < K} is finite.
31 Dominik Gruer (Neuchâtel) 26/30 The WPD element: hyperolicity Sketch: definition of the WPD element g Γ 1 nd Γ 2 distinct components of Γ, p 1 pth in Γ 1 nd p 2 pth in Γ 2 such tht oth re not pieces. Define g := l(p 1 )l(p 2 ). Sketch: hyperolicity of g. l(p 1 )l(p 2 ) cnnot e red on ny component of Γ. A pth in Cy(G(Γ), S) lelled y ( l(p 1 )l(p 2 ) ) N is not contined in N emedded components of Γ. Metric in Y counts how mny emedded components of Γ one hs to go through. d(1, g N ) Y N.
32 Dominik Gruer (Neuchâtel) 27/30 The WPD condition To prove WPD condition, study qudrngulr digrms: g N h g N hg N g N
33 Dominik Gruer (Neuchâtel) 28/30 Acylindricl hyperolicity theorem Theorem (GS 2014) Let Γ e Gr(7)-lelled grph whose components re finite. Then G(Γ) is cylindriclly hyperolic or virtully cyclic. Reserch directions. Action of Gromov s monsters on cone-off spce positive result out Bum-Connes? Study cone-off spce for other limits of hyperolic groups. Use (grphicl) smll cncelltion groups to study clss of cylindriclly hyperolic groups.
34 Dominik Gruer (Neuchâtel) 29/30 Conclusion Grphicl smll cncelltion theory Generl tool for constructing groups with prescried (corsely) emedded infinite sugrphs nd, hence, extreme nlytic properties. Lets us study these groups through ctions on concrete hyperolic spces. Provides new exmples for studying the clss of cylindriclly hyperolic groups.
35 Dominik Gruer (Neuchâtel) 30/30 Further reding D. Gruer, Groups with grphicl C(6) nd C(7) smll cncelltion presenttions, Trns. Amer. Mth. Soc. 367 (2015), no. 3, D. Gruer, Infinitely presented C(6)-groups re SQ-universl, J. London Mth. Soc. 92 (2015), no. 1, D. Gruer, A. Mrtin, nd M. Steenock, Finite index sugroups without unique product in grphicl smll cncelltion groups, Bull. London Mth. Soc. 47 (2015), no. 4, D. Gruer nd A. Sisto, Infinitely presented grphicl smll cncelltion groups re cylindriclly hyperolic, rxiv: (2014).
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 informationRandom 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 informationInfinite monoids as geometric objects
Infinite monoids s geometric ojects Roert Gry (joint work with Mrk Kmites) Semigroups nd Applictions Novi Sd, June 2013 Groups, monoids, nd geometry Gromov - Infinite groups s geometric ojects Interntionl
More informationCoalgebra, 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 informationFarey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University
U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions
More informationSurface maps into free groups
Surfce mps into free groups lden Wlker Novemer 10, 2014 Free groups wedge X of two circles: Set F = π 1 (X ) =,. We write cpitl letters for inverse, so = 1. e.g. () 1 = Commuttors Let x nd y e loops. The
More informationCIRCULAR COLOURING THE PLANE
CIRCULAR COLOURING THE PLANE MATT DEVOS, JAVAD EBRAHIMI, MOHAMMAD GHEBLEH, LUIS GODDYN, BOJAN MOHAR, AND REZA NASERASR Astrct. The unit distnce grph R is the grph with vertex set R 2 in which two vertices
More informationHomework 4. 0 ε 0. (00) ε 0 ε 0 (00) (11) CS 341: Foundations of Computer Science II Prof. Marvin Nakayama
CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 4 1. UsetheproceduredescriedinLemm1.55toconverttheregulrexpression(((00) (11)) 01) into n NFA. Answer: 0 0 1 1 00 0 0 11 1 1 01 0 1 (00)
More informationNotes on length and conformal metrics
Notes on length nd conforml metrics We recll how to mesure the Eucliden distnce of n rc in the plne. Let α : [, b] R 2 be smooth (C ) rc. Tht is α(t) (x(t), y(t)) where x(t) nd y(t) re smooth rel vlued
More informationThe Modified Heinz s Inequality
Journl of Applied Mthemtics nd Physics, 03,, 65-70 Pulished Online Novemer 03 (http://wwwscirporg/journl/jmp) http://dxdoiorg/0436/jmp03500 The Modified Heinz s Inequlity Tkshi Yoshino Mthemticl Institute,
More informationCS 275 Automata and Formal Language Theory
CS 275 utomt nd Forml Lnguge Theory Course Notes Prt II: The Recognition Prolem (II) Chpter II.5.: Properties of Context Free Grmmrs (14) nton Setzer (Bsed on ook drft y J. V. Tucker nd K. Stephenson)
More informationHarvard University Computer Science 121 Midterm October 23, 2012
Hrvrd University Computer Science 121 Midterm Octoer 23, 2012 This is closed-ook exmintion. You my use ny result from lecture, Sipser, prolem sets, or section, s long s you quote it clerly. The lphet is
More information1 From NFA to regular expression
Note 1: How to convert DFA/NFA to regulr expression Version: 1.0 S/EE 374, Fll 2017 Septemer 11, 2017 In this note, we show tht ny DFA cn e converted into regulr expression. Our construction would work
More informationIntermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4
Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one
More informationOn the Hanna Neumann Conjecture
On the Hnn Neumnn Conjecture Toshiki Jitsukw Bill Khn Alexei G. Mysnikov Astrct The Hnn Neumnn conjecture sttes tht if F is free group, then for ll nontrivil finitely generted sugroups H, K F, rnk(h K)
More informationMath 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 informationTheory 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 informationThree termination problems. Patrick Dehornoy. Laboratoire de Mathématiques Nicolas Oresme, Université de Caen
Three termintion prolems Ptrick Dehornoy Lortoire de Mthémtiques Nicols Oresme, Université de Cen Three termintion prolems Ptrick Dehornoy Lortoire Preuves, Progrmmes, Systèmes Université Pris-Diderot
More information7.2 Riemann Integrable Functions
7.2 Riemnn Integrble Functions Theorem 1. If f : [, b] R is step function, then f R[, b]. Theorem 2. If f : [, b] R is continuous on [, b], then f R[, b]. Theorem 3. If f : [, b] R is bounded nd continuous
More informationFirst Midterm Examination
24-25 Fll Semester First Midterm Exmintion ) Give the stte digrm of DFA tht recognizes the lnguge A over lphet Σ = {, } where A = {w w contins or } 2) The following DFA recognizes the lnguge B over lphet
More informationMath 6455 Oct 10, Differential Geometry I Fall 2006, Georgia Tech
Mth 6455 Oct 10, 2006 1 Differentil Geometry I Fll 2006, Georgi Tech Lecture Notes 12 Riemnnin Metrics 0.1 Definition If M is smooth mnifold then by Riemnnin metric g on M we men smooth ssignment of n
More informationCAT(0) AND CAT(-1) DIMENSIONS OF TORSION FREE HYPERBOLIC GROUPS
CAT(0) AND CAT(-1) DIMENSIONS OF TORSION FREE HYPERBOLIC GROUPS NOEL BRADY 1 AND JOHN CRISP 2 Astrct. We show tht prticulr free-y-cyclic group G hs CAT(0) dimension equl to 2, ut CAT(-1) dimension equl
More informationFirst Midterm Examination
Çnky University Deprtment of Computer Engineering 203-204 Fll Semester First Midterm Exmintion ) Design DFA for ll strings over the lphet Σ = {,, c} in which there is no, no nd no cc. 2) Wht lnguge does
More informationTheory 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 informationUniversitaireWiskundeCompetitie. Problem 2005/4-A We have k=1. Show that for every q Q satisfying 0 < q < 1, there exists a finite subset K N so that
Problemen/UWC NAW 5/7 nr juni 006 47 Problemen/UWC UniversitireWiskundeCompetitie Edition 005/4 For Session 005/4 we received submissions from Peter Vndendriessche, Vldislv Frnk, Arne Smeets, Jn vn de
More informationThe Regulated and Riemann Integrals
Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue
More informationLecture 3: Curves in Calculus. Table of contents
Mth 348 Fll 7 Lecture 3: Curves in Clculus Disclimer. As we hve textook, this lecture note is for guidnce nd supplement only. It should not e relied on when prepring for exms. In this lecture we set up
More informationHamiltonian Cycle in Complete Multipartite Graphs
Annls of Pure nd Applied Mthemtics Vol 13, No 2, 2017, 223-228 ISSN: 2279-087X (P), 2279-0888(online) Pulished on 18 April 2017 wwwreserchmthsciorg DOI: http://dxdoiorg/1022457/pmv13n28 Annls of Hmiltonin
More information5. (±±) Λ = fw j w is string of even lengthg [ 00 = f11,00g 7. (11 [ 00)± Λ = fw j w egins with either 11 or 00g 8. (0 [ ffl)1 Λ = 01 Λ [ 1 Λ 9.
Regulr Expressions, Pumping Lemm, Right Liner Grmmrs Ling 106 Mrch 25, 2002 1 Regulr Expressions A regulr expression descries or genertes lnguge: it is kind of shorthnd for listing the memers of lnguge.
More informationLecture 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 informationTheoretical 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 informationMinimal 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 informationMTH 5102 Linear Algebra Practice Exam 1 - Solutions Feb. 9, 2016
Nme (Lst nme, First nme): MTH 502 Liner Algebr Prctice Exm - Solutions Feb 9, 206 Exm Instructions: You hve hour & 0 minutes to complete the exm There re totl of 6 problems You must show your work Prtil
More informationUNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3
UNIFORM CONVERGENCE Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 Suppose f n : Ω R or f n : Ω C is sequence of rel or complex functions, nd f n f s n in some sense. Furthermore,
More informationCHAPTER 1 Regular Languages. Contents. definitions, examples, designing, regular operations. Non-deterministic Finite Automata (NFA)
Finite Automt (FA or DFA) CHAPTER Regulr Lnguges Contents definitions, exmples, designing, regulr opertions Non-deterministic Finite Automt (NFA) definitions, equivlence of NFAs DFAs, closure under regulr
More informationLinear Inequalities. Work Sheet 1
Work Sheet 1 Liner Inequlities Rent--Hep, cr rentl compny,chrges $ 15 per week plus $ 0.0 per mile to rent one of their crs. Suppose you re limited y how much money you cn spend for the week : You cn spend
More informationModel Reduction of Finite State Machines by Contraction
Model Reduction of Finite Stte Mchines y Contrction Alessndro Giu Dip. di Ingegneri Elettric ed Elettronic, Università di Cgliri, Pizz d Armi, 09123 Cgliri, Itly Phone: +39-070-675-5892 Fx: +39-070-675-5900
More informationMath 4310 Solutions to homework 1 Due 9/1/16
Mth 4310 Solutions to homework 1 Due 9/1/16 1. Use the Eucliden lgorithm to find the following gretest common divisors. () gcd(252, 180) = 36 (b) gcd(513, 187) = 1 (c) gcd(7684, 4148) = 68 252 = 180 1
More informationTHE 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 informationMAA 4212 Improper Integrals
Notes by Dvid Groisser, Copyright c 1995; revised 2002, 2009, 2014 MAA 4212 Improper Integrls The Riemnn integrl, while perfectly well-defined, is too restrictive for mny purposes; there re functions which
More informationAutomaton groups and complete square complexes
rxiv:1707.00215v1 [mth.gr] 1 Jul 2017 Automton groups nd complete squre complexes Ievgen Bondrenko nd Bohdn Kivv July 4, 2017 Astrct The first exmple of non-residully finite group in the clsses of finitely
More informationGrammar. Languages. Content 5/10/16. Automata and Languages. Regular Languages. Regular Languages
5//6 Grmmr Automt nd Lnguges Regulr Grmmr Context-free Grmmr Context-sensitive Grmmr Prof. Mohmed Hmd Softwre Engineering L. The University of Aizu Jpn Regulr Lnguges Context Free Lnguges Context Sensitive
More information2.4 Linear Inequalities and Interval Notation
.4 Liner Inequlities nd Intervl Nottion We wnt to solve equtions tht hve n inequlity symol insted of n equl sign. There re four inequlity symols tht we will look t: Less thn , Less thn or
More informationOn the degree of regularity of generalized van der Waerden triples
On the degree of regulrity of generlized vn der Werden triples Jcob Fox Msschusetts Institute of Technology, Cmbridge, MA 02139, USA Rdoš Rdoičić Deprtment of Mthemtics, Rutgers, The Stte University of
More informationMATH 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 informationFinite 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 informationk ) and directrix x = h p is A focal chord is a line segment which passes through the focus of a parabola and has endpoints on the parabola.
Stndrd Eqution of Prol with vertex ( h, k ) nd directrix y = k p is ( x h) p ( y k ) = 4. Verticl xis of symmetry Stndrd Eqution of Prol with vertex ( h, k ) nd directrix x = h p is ( y k ) p( x h) = 4.
More informationGenerating finite transformation semigroups: SgpWin
Generting finite trnsformtion semigroups: SgpWin Donld B. McAlister ( don@mth.niu.edu ) Deprtment of Mthemticl Sciences Northern Illinois University nd C.A.U.L. Septemer 5, 2006 Donld B. McAlister ( don@mth.niu.edu
More informationNote 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 informationN 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 informationI. Theory of Automata II. Theory of Formal Languages III. Theory of Turing Machines
CI 3104 /Winter 2011: Introduction to Forml Lnguges Chpter 16: Non-Context-Free Lnguges Chpter 16: Non-Context-Free Lnguges I. Theory of utomt II. Theory of Forml Lnguges III. Theory of Turing Mchines
More informationBases 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 informationKRASNOSEL SKII TYPE FIXED POINT THEOREM FOR NONLINEAR EXPANSION
Fixed Point Theory, 13(2012), No. 1, 285-291 http://www.mth.ubbcluj.ro/ nodecj/sfptcj.html KRASNOSEL SKII TYPE FIXED POINT THEOREM FOR NONLINEAR EXPANSION FULI WANG AND FENG WANG School of Mthemtics nd
More informationComputing 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 informationx = a To determine the volume of the solid, we use a definite integral to sum the volumes of the slices as we let!x " 0 :
Clculus II MAT 146 Integrtion Applictions: Volumes of 3D Solids Our gol is to determine volumes of vrious shpes. Some of the shpes re the result of rotting curve out n xis nd other shpes re simply given
More informationHomework 3 Solutions
CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}.
More informationDefinite Integrals. The area under a curve can be approximated by adding up the areas of rectangles = 1 1 +
Definite Integrls --5 The re under curve cn e pproximted y dding up the res of rectngles. Exmple. Approximte the re under y = from x = to x = using equl suintervls nd + x evluting the function t the left-hnd
More informationClosure Properties of Regular Languages
Closure Properties of Regulr Lnguges Regulr lnguges re closed under mny set opertions. Let L 1 nd L 2 e regulr lnguges. (1) L 1 L 2 (the union) is regulr. (2) L 1 L 2 (the conctention) is regulr. (3) L
More informationResearch Article Cayley Graphs of Order 27p Are Hamiltonian
Interntionl Journl of Comintorics Volume 2011, Article ID 206930, 16 pges doi:10.1155/2011/206930 Reserch Article Cyley Grphs of Order 27p Are Hmiltonin Erhim Ghderpour nd Dve Witte Morris Deprtment of
More informationGraph 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 informationPavel 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 informationLifting curves simply. Jonah Gaster 1. 1 Introduction. Correspondence to be sent to:
Gster, J.. () Lifting curves simply, Interntionl Mthemtics Reserch Notices, Vol., Article ID, 6 pges. doi:10.1093/imrn/ Lifting curves simply Jonh Gster 1 1 Deprtment of Mthemtics, Boston College Correspondence
More informationad = 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 informationp-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 informationGlobal Types for Dynamic Checking of Protocol Conformance of Multi-Agent Systems
Globl Types for Dynmic Checking of Protocol Conformnce of Multi-Agent Systems (Extended Abstrct) Dvide Ancon, Mtteo Brbieri, nd Vivin Mscrdi DIBRIS, University of Genov, Itly emil: dvide@disi.unige.it,
More informationRecitation 3: More Applications of the Derivative
Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech
More informationLexical 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 informationAssignment 1 Automata, Languages, and Computability. 1 Finite State Automata and Regular Languages
Deprtment of Computer Science, Austrlin Ntionl University COMP2600 Forml Methods for Softwre Engineering Semester 2, 206 Assignment Automt, Lnguges, nd Computility Smple Solutions Finite Stte Automt nd
More information378 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 informationSTUDY 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 informationConvert 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 informationAnswers and Solutions to (Some Even Numbered) Suggested Exercises in Chapter 11 of Grimaldi s Discrete and Combinatorial Mathematics
Answers n Solutions to (Some Even Numere) Suggeste Exercises in Chpter 11 o Grimli s Discrete n Comintoril Mthemtics Section 11.1 11.1.4. κ(g) = 2. Let V e = {v : v hs even numer o 1 s} n V o = {v : v
More informationAT100 - Introductory Algebra. Section 2.7: Inequalities. x a. x a. x < a
Section 2.7: Inequlities In this section, we will Determine if given vlue is solution to n inequlity Solve given inequlity or compound inequlity; give the solution in intervl nottion nd the solution 2.7
More informationɛ-closure, Kleene s Theorem,
DEGefW5wiGH2XgYMEzUKjEmtCDUsRQ4d 1 A nice pper relevnt to this course is titled The Glory of the Pst 2 NICTA Resercher, Adjunct t the Austrlin Ntionl University nd Griffith University ɛ-closure, Kleene
More informationSOLUTIONS FOR ANALYSIS QUALIFYING EXAM, FALL (1 + µ(f n )) f(x) =. But we don t need the exact bound.) Set
SOLUTIONS FOR ANALYSIS QUALIFYING EXAM, FALL 28 Nottion: N {, 2, 3,...}. (Tht is, N.. Let (X, M be mesurble spce with σ-finite positive mesure µ. Prove tht there is finite positive mesure ν on (X, M such
More informationThe area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O
1 Section 5. The Definite Integrl Suppose tht function f is continuous nd positive over n intervl [, ]. y = f(x) x The re under the grph of f nd ove the x-xis etween nd is denoted y f(x) dx nd clled the
More informationEilenberg MacLane mapping algebras and higher distributivity up to homotopy
Eilenberg McLne mpping lgebrs nd higher distributivity up to homotopy Hns-Jochim Bues 1 Mrtin Frnklnd* 2 1 Mx-Plnck-Institut für Mthemtik 2 Universität Osnbrück Homotopy Theory: Tools nd Applictions University
More informationState 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 informationOptimal Network Design with End-to-End Service Requirements
ONLINE SUPPLEMENT for Optiml Networ Design with End-to-End Service Reuirements Anntrm Blrishnn University of Tes t Austin, Austin, TX Gng Li Bentley University, Wlthm, MA Prsh Mirchndni University of Pittsurgh,
More informationClassification of Spherical Quadrilaterals
Clssifiction of Sphericl Qudrilterls Alexndre Eremenko, Andrei Gbrielov, Vitly Trsov November 28, 2014 R 01 S 11 U 11 V 11 W 11 1 R 11 S 11 U 11 V 11 W 11 2 A sphericl polygon is surfce homeomorphic to
More information440-2 Geometry/Topology: Differentiable Manifolds Northwestern University Solutions of Practice Problems for Final Exam
440-2 Geometry/Topology: Differentible Mnifolds Northwestern University Solutions of Prctice Problems for Finl Exm 1) Using the cnonicl covering of RP n by {U α } 0 α n, where U α = {[x 0 : : x n ] RP
More informationResearch Article On Cayley Digraphs That Do Not Have Hamiltonian Paths
Hindwi Pulishing Corportion Interntionl Journl of Comintorics Volume 2013, Article ID 725809, 7 pges http://dx.doi.org/10.1155/2013/725809 Reserch Article On Cyley Digrphs Tht Do Not Hve Hmiltonin Pths
More informationMTH 505: Number Theory Spring 2017
MTH 505: Numer Theory Spring 207 Homework 2 Drew Armstrong The Froenius Coin Prolem. Consider the eqution x ` y c where,, c, x, y re nturl numers. We cn think of $ nd $ s two denomintions of coins nd $c
More informationCSCI 340: Computational Models. Transition Graphs. Department of Computer Science
CSCI 340: Computtionl Models Trnsition Grphs Chpter 6 Deprtment of Computer Science Relxing Restrints on Inputs We cn uild n FA tht ccepts only the word! 5 sttes ecuse n FA cn only process one letter t
More informationJian-yi Shi East China Normal University, Shanghai and Technische Universität Kaiserslautern
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 Jin-yi Shi 1. Preliminries. 1.1. V, n-dim spce/c.
More informationAutomata and Languages
Automt nd Lnguges Prof. Mohmed Hmd Softwre Engineering Lb. The University of Aizu Jpn Grmmr Regulr Grmmr Context-free Grmmr Context-sensitive Grmmr Regulr Lnguges Context Free Lnguges Context Sensitive
More informationCounting immersed surfaces in hyperbolic 3-manifolds
ISSN 1472-2739 (on-line) 1472-2747 (printed) 835 Algeric & Geometric Topology Volume 5 (2005) 835 864 Pulished: 24 July 2005 ATG Counting immersed surfces in hyperolic 3-mnifolds Joseph D. Msters Astrct
More informationCS 310 (sec 20) - Winter Final Exam (solutions) SOLUTIONS
CS 310 (sec 20) - Winter 2003 - Finl Exm (solutions) SOLUTIONS 1. (Logic) Use truth tles to prove the following logicl equivlences: () p q (p p) (q q) () p q (p q) (p q) () p q p q p p q q (q q) (p p)
More informationMath 1B, lecture 4: Error bounds for numerical methods
Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the
More informationUnit #9 : Definite Integral Properties; Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties; Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationImproper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows:
Improper Integrls The First Fundmentl Theorem of Clculus, s we ve discussed in clss, goes s follows: If f is continuous on the intervl [, ] nd F is function for which F t = ft, then ftdt = F F. An integrl
More informationCMPSCI 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 informationSpherical folding tessellations by kites and isosceles triangles IV
Also ille t http://mc-journl.eu ISSN - (printed edn.), ISSN - (electronic edn.) ARS MATHEMATICA CONTEMPORANEA (0) Sphericl folding tesselltions y kites nd isosceles tringles IV Ctrin P. Aelino, Altino
More informationIN GAUSSIAN INTEGERS X 3 + Y 3 = Z 3 HAS ONLY TRIVIAL SOLUTIONS A NEW APPROACH
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A2 IN GAUSSIAN INTEGERS X + Y = Z HAS ONLY TRIVIAL SOLUTIONS A NEW APPROACH Elis Lmpkis Lmpropoulou (Term), Kiprissi, T.K: 24500,
More informationLecture 09: Myhill-Nerode Theorem
CS 373: Theory of Computtion Mdhusudn Prthsrthy Lecture 09: Myhill-Nerode Theorem 16 Ferury 2010 In this lecture, we will see tht every lnguge hs unique miniml DFA We will see this fct from two perspectives
More informationCM10196 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 informationName Ima Sample ASU ID
Nme Im Smple ASU ID 2468024680 CSE 355 Test 1, Fll 2016 30 Septemer 2016, 8:35-9:25.m., LSA 191 Regrding of Midterms If you elieve tht your grde hs not een dded up correctly, return the entire pper to
More informationNUMERICAL CALCULATION OF THREE-POINT BRANCHED COVERS OF THE PROJECTIVE LINE
NUMERICAL CALCULATION OF THREE-POINT BRANCHED COVERS OF THE PROJECTIVE LINE MICHAEL KLUG, MICHAEL MUSTY, SAM SCHIAVONE AND JOHN VOIGHT Astrct. We exhiit numericl method to compute three-point rnched covers
More informationRegular Language. Nonregular Languages The Pumping Lemma. The pumping lemma. Regular Language. The pumping lemma. Infinitely long words 3/17/15
Regulr Lnguge Nonregulr Lnguges The Pumping Lemm Models of Comput=on Chpter 10 Recll, tht ny lnguge tht cn e descried y regulr expression is clled regulr lnguge In this lecture we will prove tht not ll
More informationLECTURE 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