On the Hanna Neumann Conjecture
|
|
- Abraham Norman
- 6 years ago
- Views:
Transcription
1 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) 1 [rnk(h) 1] [rnk(k) 1] Where most ppers to dte hve considered direct grph theoretic interprettion of the conjecture, here we consider the use of monomorphisms. We illustrte the effectiveness of this pproch with two results. First, we show tht for ny finitely generted groups H, K F either the pir H, K or the pir H, K stisfy the Hnn Neumnn conjecture; here denotes the utomorphism which sends ech genertor of F to its inverse. Next, using prticulr monomorphisms from F to F 2, we otin tht if the Hnn Neumnn conjecture is flse then there is counterexmple H, K F 2 hving the dditionl property tht ll the rnch vertices in the foldings of H nd K re of degree 3, nd ll degree 3 vertices hve the sme locl structure or type. 1 Introduction H. Neumnn proved in [12] tht ny nontrivil sugroups H, K f.g. F (finitely generted) must stisfy rnk(h K) 1 2[rnk(H) 1][rnk(K) 1], (1) nd so improved Howson s erlier result [5] tht H K is finitely generted. The stronger ssertion otined y omitting the fctor of 2 in (1) hs come to e known s the Hnn Neumnn conjecture. In [1], R. Burns improved H. Neumnn s ound y showing tht rnk(h K) 1 2[rnk(H) 1][rnk(K) 1] min(rnk(h) 1, rnk(k) 1). In 1983, J. Stllings introduced the notion of folding nd showed how to pply these ojects to the study of sugroups of free groups [16]. Stllings s pproch ws pplied y S. Gersten in [4] to solve certin specil cses of the conjecture, nd similr techniques were developed over sequence of ppers y W. Imrich [7, 6], P. Nickols [14], nd B. Servtius [15] who gve lternte 1
2 proofs of Burns ound nd resolved specil cses of the conjecture. In 1989, W. Neumnn showed tht the conjecture is true with proility 1 for rndomly chosen sugroups of free groups [13], nd proposed strengthened form of the conjecture which ounds the quntity r(h, K) def = r(h g K) g X where X F is set of doule coset representtives for the doule cosets HgK, nd r is the reduced rnk, defined s r(g) = mx(rnk(g) 1, 0) for sugroups G F. Specificlly, the strengthened Hnn Neumnn conjecture sserts: r(h, K) r(h) r(k) In 1992, G. Trdos proved in [17] tht the strengthened conjecture is true if one of the two sugroups hs rnk 2. Then, in 1994, W. Dicks showed tht the strengthened Hnn Neumnn conjecture is equivlent to conjecture on iprtite grphs, which he termed the Amlgmted Grph conjecture [2]. In 1996, G. Trdos used Dicks method to give the first new ound for the generl cse in [18], where he proved tht for ny H, K F with rnk(h), rnk(k) t lest 2, r(h, K) 2 r(h) r(k) r(h) r(k) + 1 Since then, W. Dicks nd E. Formnek [3] resolved the conjecture for the cse when one of the sugroups hs rnk t most 3, y proving tht r(h, K) r(h) r(k) + r 3 (H) r 3 (H), where r k (G) def = mx(rnk(g) k, 0) for sugroups G F nd k N. The strengthened conjecture ws lso recently solved in the specil cse when one of the two groups, sy H, hs generting set consisting of positive words (i.e. set of words in which no genertor of F hs negtive exponent). Specificlly, it ws shown y J. Mekin nd P. Weil [11], nd independently y B. Khn [9] tht if there is some utomorphism of F which crries generting set of H to set of positive words, then the conjecture holds for H nd ny nontrivil K f.g. F. Recll tht n utomorphism σ of F (X) is clled length-preserving if u F, u σ = u, i.e. (X ± ) σ = X ± where X ± = X X 1. In section 3, we shll prove the following two theorems: Theorem 1. Let F 2 = F (, ). Tke σ Aut(F 2 ) to e ny length-preserving utomorphism hving no non-trivil fixed points, nd let τ e ny monomorphism τ : w w, 2
3 where w, w F 2 re ritrry elements for which the words w nd w re reduced s written. Then for ll nontrivil H, K f.g. F 2, either the pir H, K or the pir H τσ, K stisfy the strengthened Hnn Neumnn conjecture. Theorem 2. Let F = F (X) nd e the utomorphism given y x x 1 (for ech x X). Then for ll nontrivil H, K f.g. F, either the pir H, K or the pir H, K stisfy the strengthened Hnn Neumnn conjecture. Note tht in the spcil cse when X = 2, Theorem 2 follows immeditely from Theorem 1 y considering τ to e the identity utomorphism, nd σ to e the utomorphism sending x x 1 for every x in X. Recll tht given H = w 1,, w n F, one my determine the ssocited Stllings folding Γ H = (V H, E H ), y the following constructive procedure (see [16]): Construct n directed cycles c 1 = (V 1, E 1 ),..., c n = (V n, E n ), where V i = w i. Then pick one vertex from ech of the cycles, nd identify this suset of vertices, denoting the resulting vertex s the identity vertex 1 H. Lel the edges of cycle c i y successive letters of w i, strting t vertex 1 H. Finlly, repetedly identify pirs of edges e, e for which lel(e) = lel(e ) [hed(e) = hed(e ) til(e) = til(e )]. Ech such identifiction is clled n edge-folding nd we sy tht the edge e (s well s e ) ws folded. Figure 1 illustrtes the process, which termintes in finitely mny steps yielding the folding Γ H. It is esy to verify tht the folding so otined is well-defined, nd moreover, is independent of the choice of generting set for H. It is not hrd to see tht the rnk of H is precisely E H V H + 1. w n w 1 u Γ H u 1 H folding process 1 H w 2 v w 4 v w 3 Figure 1: Contructing folding from rose. Now we consider sugroups of F 2 : If H f.g. F 2 then Γ H hs vertices of undirected degree 4, where y undirected degree d = d H (v) of vertex v we men the sum of the numer of outgoing nd incoming edges t v. Put d i (Γ H ) = {v V H d H (v) = i}, for i = 1, 2, 3, 4. Vertices of degree 3 my e 3
4 clssified into 4 types, denoted C, C, C 1, C 1, sed on the lels of the incident edges (see figure 2). For ech x { ±, ± }, we define C x (Γ H ) to e the numer of degree 3 vertices of type C x in Γ H. The rnk of H cn e computed y the formul rnk(h) = d 4 (Γ H ) + d 3(Γ H ) 2 d 1(Γ H ) C C C C 1 1 Figure 2: Locl structure of vertex lels in folding. The grph-theoretic pproch to the Hnn Neumnn conjecture is sed on the following key oservtions [16, 8]. Consider the product utomton Γ H Γ K, whose vertex set is V H V K nd two vertices (u 1, v 1 ) nd (u 2, v 2 ) re connected y n edge lelled x iff oth (u 1, v 1 ) E H nd (u 2, v 2 ) E K hve lel x. Given folding Γ, its core is defined to e the grph otined y repeted deletion of non-identity degree 1 vertices. We denote this grph s Γ. Let (1 H, 1 K ) ply the role of identity vertex in Γ H Γ K. Then it is not hrd to see tht the components of (Γ H Γ K ) re in one to one correspondence with {Γ H g K} where g vries over suitly chosen set of doule coset representtives for the doule cosets HgK. More specificlly, the connected component of (Γ H Γ K ) which contins (1 H, 1 K ), is isomorphic to Γ H K. Mny proofs of prtil results towrds the Hnn Neumnn conjecture require cse-y-cse nlysis sed on the numers nd types of degree 3 vertices present in the foldings of H, K. The next theorem hs implictions on the numer of cses which need to e considered in such rguments; it is proved in section 3. Theorem 3. Let F = F (X) e non-elin free group. There is monomorphism φ 0 : F F 2 into the free group of rnk 2 such tht: for ny groups H, K F, the foldings of H φ 0, K φ 0 f.g. F 2 hve the property tht ll their rnch vertices re of degree 3, nd ll degree 3 vertices hve the sme type. The previous theorem hs the following immedite corollry: Corollry 1. If the Hnn Neumnn conjecture is flse then there is counterexmple H, K f.g. F 2 hving the dditionl property tht ll the rnch vertices in the foldings of H nd K re of degree 3, nd ll degree 3 vertices hve the sme type. 4
5 2 Preliminries The numers C x (Γ H ) nd C x (Γ K ) llow one to compute upper ounds on the numers of vertices of degree 3 in Γ H Γ K nd hence in Γ H K. By considering suitle conjugte of H nd K we cn ssume d 1 (Γ H ) = d 1 (Γ K ) = 0. Remrk 1. It follows from the definition og the product folding tht d 4 (Γ H K ) d 4 (Γ H Γ K ) = d 4 (Γ H )d 4 (Γ K ), nd d 3 (Γ H K ) d 3 (Γ H Γ K ) = d 4 (Γ H )d 3 (Γ K ) + d 3 (Γ H )d 4 (Γ K ) + x {,} ± C x (Γ H )C x (Γ K ) Definition 1. Given two sugroups H, K f.g. F 2 nd x {, } ±, we define { Cx (Γ H ) δ x (H, K) = min d 3 (Γ H ), C } x(γ K ) d 3 (Γ K ) δ(h, K) = mx δ x (H, K) x { ±, ± } nd put µ(h, K) to e ny x { ±, ± } for which δ x (H, K) = δ(h, K). Remrk 2. Wlter Neumnn [13] showed tht if H, K f.g. F 2 re counterexmple to the strengthened conjecture, then δ(h, K) > 1 2. We outline his rgument here, in grph-theoretic nottion. Using simple nd eutiful rgument from convexity theory, he showed tht if δ(h, K) 1 2 then C x (Γ H )C x (Γ K ) 1 2 d 3(Γ H )d 3 (Γ K ). x {,} ± Since the components of (Γ H Γ K ) re in one to one correspondence with {Γ H g K} (where g vries over suitly chosen set of doule coset representtives for the doule cosets HgK), we see tht r(h, K) = d 4 ((Γ H Γ K ) ) + d 3 ((Γ H Γ K ) )/2 d 1 ((Γ H Γ K ) )/2 which is t most d 4 (Γ H Γ K ) + d 3 (Γ H Γ K )/2. By Remrk 1 then, r(h, K) d 4 (Γ H Γ K ) + d 3 (Γ H Γ K )/2 d 4 (Γ H )d 4 (Γ K ) + 1 d 4 (Γ H )d 3 (Γ K ) + d 3 (Γ H )d 4 (Γ K ) 2 + C x (Γ H )C x (Γ K ) x {,} ± d 4 (Γ H )d 4 (Γ K ) + d 4 (Γ H )d 3 (Γ K )/2 + d 3 (Γ H )d 4 (Γ K )/2 r(h) r(k). nd thus the strengthened conjecture holds. + d 3 (Γ H )d 3 (Γ K )/4 5
6 3 Results Remrk 3. Given n endomorphism φ : F 2 F 2, the folding Γ H φ cn e otined from Γ H s follows. First construct lelled directed grph φ(γ H ) y replcing ech edge with lel x in Γ H y sequence of edges lelled y the successive letters of x φ (for x =, ). Then, pply the previously descried folding procedure to trnsform the grph φ(γ H ) Γ H φ. One my verify tht this yields folding which is isomorphic to the one otined y constructing Γ H φ directly from the set {w φ 1,, wφ n}. For exmple, if φ is length-preserving utomorphism, then Γ H φ cn e otined from Γ H y replcing every lel x y x φ nd chnging the orienttion of the edges if necessry. Lemm 1. Let Γ H e the folding of sugroup H f.g. F 2, nd φ : F 2 F 2 n endomorphism. If two edges e, f from φ(γ H ) get folded during the folding process φ(γ H ) Γ H φ, then there must exist pth p in φ(γ H ) eginning t e nd ending t f with the property tht every edge in p ws folded during the folding process. Proof. The lemm is proved y induction on the numer n of edge-foldings which tke plce during the folding process note tht this numer does not depend on the folding process since it is equl to E φ(γh ) E ΓH nd the φ resultnt folded grph Γ H φ is unique). For n = 1, the pth p consists of just edges e, f. Now suppose the first edge-folding occurs when edges d 1 nd d 2 re merged into n edge d, nd denote the folding otined fter this identifiction s Γ. By induction, there exists pth p in Γ connecting e nd f. There re two cses to consider: either d ppers in p, or it does not. In the first cse, let p 1 (resp. p 2 ) e the pth otined y replcing d with d 1 (resp d 2 ) in p. It is cler tht either p 1 or p 2 must fulfill the requirements of the lemm. In the second cse, we simply tke p = p. Lemm 2. Let H, K f.g. F 2 e sugroups which stisfy δ(h, K) > 1 2 (nd hence re potentil counterexmple to the strengthened Hnn Neumnn conjecture) nd tke, to e two length-preserving utomorphisms of F 2 whose vlues differ on µ(h, K), i.e. µ(h, K) µ(h, K). Then the groups H, K must stisfy the strengthened Hnn Neumnn conjecture. Proof. Set x 0 = µ(h, K). Since δ(h, K) > 1 2, it follows tht C x0 (Γ H ) > 1 2 d 3(Γ H ) C x0 (Γ K ) > 1 2 d 3(Γ K ). In light of Remrk 3, Γ K is the sme grph s Γ K, except tht ll edges hve een relelled s, nd edges hve een relelled s, nd n 6
7 nlogous sttement is true out the reltionship etween Γ H nd Γ H. So for ll x { ±, ± }. It follows tht C x (Γ K ) = C x (Γ K ) C x (Γ H ) = C x (Γ H ) C x 0 (Γ K ) = C x0 (Γ K ) > 1 2 d 3(Γ K ) = 1 2 d 3(Γ K ), (2) C x 0 (Γ H ) = C x0 (Γ H ) > 1 2 d 3(Γ H ) = 1 2 d 3(Γ H ). (3) Since x 0 x 0, it follows tht δ x (H, K ) < 1 2 for every x {, }±. Thus, δ(h, K ) < 1 2, nd hence y Remrk 2 the groups H, K cnnot e counterexmple to the strengthened Hnn Neumnn conjecture. The proofs of Theorems 1 nd 2 (see pge 2) now follow from Lemm 2. Proof. (Theorem 1) Suppose H, K do not stisfy the strengthened conjecture. By remrk 2 we hve δ(h, K) > 1 2. By definition of τ we hve δ(hτ, K) = δ(h, K). We pply Lemm 2 to H τ, K, tking to e the fixed-point-free length-preserving utomorphism σ, nd to e the identity utomorphism. The theorem follows. Proof. (Theorem 2) Suppose X = { 1,..., n }. We consider the emedding ψ : F (X) F 2 = F ( 1, 2 ) defined y ψ : i i 1 2 i 1. If H, K f.g. F (X) re counterexmple to the strengthened conjecture, then so re H ψ, K ψ f.g. F 2. Let e the utomorphism of F (X) given y i 1 i (for ech i X). Restricting to F 2 nd pplying the previous lemm, we see tht either H ψ, K ψ or (H ψ ), K ψ must stisfy the strengthened conjecture. But (H ) ψ = (H ψ ) ; here we think of H ψ s sugroup of F (X) under the cnonicl inclusion of F 2 into F (X). It follows tht either H ψ, K ψ or (H ) ψ, K ψ must stisfy the strengthened conjecture. Since ψ is monomorphism, this implies tht either H, K or H, K must stisfy the strengthened conjecture. Now towrds the proof of Theorem 3, we introduce the following definition: Definition 2. We sy φ : F 2 (, ) F 2 (, ) is N-endomorphism if it hs the property tht U φ = { φ, φ } is N-reduced [10, pp.6], which is to sy tht every triple v 1, v 2, v 3 in U ± φ stisfies (N0) v 1 1, (N1) v 1 v 2 1 implies v 1 v 2 v 1, v 2, (N2) v 1 v 2, v 2 v 3 1 implies v 1 v 2 v 3 > v 1 v 2 + v 3. 7
8 Remrk 4. It is well-known [10, pp.7] tht if suset U of free group F stisfies N0-N2, then one my ssocite with ech u U words (u), m(u) F with m(u) 1 such tht u = (u)m(u)(u 1 ) 1 in F nd hving the property tht for ny w = u 1 u t, t 0, u i U ± where u i u i+1 1, the suwords m(u 1 ),..., m(u t ) remin uncncelled in the reduced form of w. Lemm 3. Every N-endomorphism of F 2 is monomorphism. Proof. Tke w F 2, with w 1. By (N2), (w φ ) 3 > 0, hence (w φ ) 3 1. It follows tht w φ 1. Lemm 4. Given H f.g. F 2 nd n N-endomorphism φ of F 2, then for every edge e in Γ H, t lest one edge from the imge of e under φ does not get folded during the folding process φ(γ H ) Γ H φ. Proof. Let e = (u, v) e ny edge of Γ H ; suppose e is lelled y x {, } ±. Consider the pth φ(e) in φ(γ H ); this pth consists of sequence of edges lelled y successive letters of x φ. Since φ is n N-endomorphism, { φ, φ } is N-reduced nd Remrk 4 pplies. Accordingly, let ē e the edge in φ(e) which corresponds to the first letter of m(x φ ) inside x φ. We clim tht ē does not get folded during the folding process φ(γ H ) Γ H φ. Suppose towrds contrdiction, tht ē gets folded with some edge f during the folding process φ(γ H ) Γ H φ. Then y Lemm 1, there must exist noncktrcking pth p in φ(γ H ) eginning t ē nd ending t f, with the property tht every edge in p ws folded during the folding process. Since p is noncktrcking pth in φ(γ H ), it is supth of φ(q) for some non-cktrcking pth q in Γ H. It follows tht the lels long φ(q) re word u 1 u t, t 0, u i { φ, φ } ± nd u i u i+1 1. Since ē is lelled y the first letter of m(x φ ), y Remrk 4 the edge ē ws not folded during the folding process; this is contrdiction. We introduce the following nottions: let Γ H = (V H, E H ) e the folding of H. Tke ny vertex v V H, nd let E v e the edges incident to v. Define Γ v to e the tree sugrph of Γ H induced y edges E v. Then φ(γ v ) is lso tree. By Lemm 4, we my ssocite to ech edge e E v, n edge m(e) E φ(γh ) which does not get folded during the folding process φ(γ H ) Γ H φ. We define trφ(γ v ) to e the grph otined y truncting the rnches of φ(γ v ) so tht they terminte with edges m(e), e E v. Clerly, for ll v V H, trφ(γ v ) is sugrph of φ(γ H ). The next lemm shows tht N-endomorphisms do not cuse lrge-scle disturnces in the neighorhood of rnch vertices. Lemm 5. Given H f.g. F 2 nd n N-endomorphism φ of F 2, then during the folding process φ(γ H ) Γ H φ, no edge from trφ(γ v ) gets folded with n edge from outside trφ(γ v ). Proof. Suppose, towrds contrdiction, tht n edge e inside trφ(γ v ) nd n edge f outside trφ(γ v ) get folded during the folding process φ(γ H ) Γ H φ. 8
9 Then y Lemm 1, there exists pth p eginning t e nd ending t f with the property tht every edge in p ws folded during the folding process. Then p must pss through some edge m(e), e E v. This contrdicts the properties of m(e) s determined in Lemm 4. It follows tht no edge inside trφ(γ v ) gets folded with n edge outside trφ(γ v ). Informlly stted, the previous lemm implies tht for n N-endomorphism φ nd sugroup H f.g. F 2, the 5-tuple of vlues C (Γ H φ), C (Γ H φ), C 1(Γ H φ), C 1(Γ H φ), d 4 (Γ H φ) is completely determinle from the 5-tuple of vlues C (Γ H ), C (Γ H ), C 1(Γ H ), C 1(Γ H ), d 4 (Γ H ), without knowledge of ny further structure (e.g. the generting set) of H. Lemm 6. Let φ 0 : F 2 F 2 e the endomorphism defined y φ 0 = 2 nd φ 0 = [, ]. Then for ny finitely generted sugroup H f.g. F 2, C 1(Γ H φ 0 ) = d 3 (Γ H φ 0 ), nd rnk(h φ0 ) = rnk(h). Proof. It is strightforwrd to check tht { 2, [, ]} is N-reduced, nd hence φ 0 is n N-endomorphism. By Lemm 5 it suffices to consider the effect of φ 0 on the vrious types of rnch vertices in Γ H. Figure 3 depicts how φ 0 trnsforms φ 0 Figure 3: The effect of φ 0 on vertex of degree 4. the neighorhood of degree 4 vertex v to produce two vertices of type C 1. The effect of φ 0 on ech of the four types of degree 3 vertices my e determined simply y restricting our considertion to pproprite sugrphs of the depicted neighorhood. It follows tht φ 0 trnsforms ny degree 3 vertex in Γ H into vertex of type C 1 in Γ H φ 0. Thus, C 1(Γ H φ 0 ) = d 3 (Γ H ) + 2d 4 (Γ H ). Since ll rnch vertices of Γ H re seen to produce vertices of type C 1, we get tht C 1(Γ H φ 0 ) = d 3 (Γ H φ 0 ). Finlly, y Lemm 3, φ 0 is monomorphism, so rnk(h φ 0 ) = rnk(h). The proof of Theorem 3 (see pge 4) now follows from Lemm 6. 9
10 Proof. (Theorem 3) Fix the emedding ψ : F (X) F 2 = F (, ) defined y ψ : i i i. Put H = (H ψ ) φ 0 nd K = (K ψ ) φ 0, where φ 0 is the endomorphism of F (, ) defined y φ0 = 2 nd φ0 = [, ]. Then y Lemm 6, nd hence δ(h, K ) = 1. C 1(Γ H ) = d 3 (Γ H ) C 1(Γ K ) = d 3 (Γ K ), Remrk 5. The following somewht simpler proof for Theorem 3 ws communicted to us y W. Neumnn: Consider n N-endomorphism φ 1 : F 2 F 2 with the dditionl property tht the grph for φ 1 (F 2 ) hs only type vertices (e.g. 1 nd 1 1. If H is ny sugroup of F 2 then the grph for φ 1 (H) is sugrph of covering grph of the grph for φ 1 (F 2 ), so it lso hs only type vertices, hence H = (H ψ ) φ 1 nd K = (K ψ ) φ 1 stisfy δ(h, K ) = 1 for ll H, K F (X). Corollry 1 follows immeditely from Theorem 3, since φ 0, φ 1 nd ψ re monomorphisms nd hence rnk(h) = rnk(h ), rnk(k) = rnk(k ). 4 Acknowledgements We re grteful to thnk W. Neumnn nd A. Mgidin for their insightful comments nd suggestions. The first two uthors re grteful to the Mthemtics deprtment t the City University of New York Grdute Center for funding this work s prt of the their ongoing doctorl reserch. The second uthor thnks oth the Center for Computtionl Sciences t the Nvl Reserch Lortory in Wshington DC, nd the Advnced Engineering nd Sciences division of ITT Industries for their support of these endevors. References [1] R. G. Burns. On the intersection of finitely generted sugroups of free group. Mthe. Z., 119: , [2] Wrren Dicks. Equivlence of the strengthened Hnn Neumnn conjecture nd the mlgmted grph conjecture. Invent. Mth., 117: , [3] Edwrd Formnek nd Wrren Dicks. The rnk three cse of the Hnn Neumnn conjecture. J. Group Theory, 4: , [4] S. M. Gersten. Intersections of finitely generted sugroups of free groups nd resolutions of grphs. Invent. Mth., 71: ,
11 [5] A. G. Howson. On the intersection of finitely generted free groups. J. London Mth. Soc., 29: , [6] W. Imrich. On finitely generted sugroups of free groups. Arch. Mth., 28:21 24, [7] W. Imrich. Sugroup theorems nd grphs. Comintoril Mthemtics V, Lecture notes in mthemtics, vol. 622:1 27, Melourne, [8] Ily Kpovich nd Alexei Misnikov. Stllings foldings nd the sugroup structure of free groups. J. Alger, 248 no 2: , [9] Bill Khn. Positively generted sugroups of free groups nd the Hnn Neumnn conjecture. In Contemporry Mthemtics, volume 296. R. Gilmn et l. Americn Mthemticl Society, [10] Roger C. Lyndon nd Pul E. Schupp. Comintoril Group Theory. Springer-Verlg, New York, [11] John Mekin nd Pscl Weil. Sugroups of free groups: contriution to the Hnn Neumnn conjecture. Geom. Dedict, to pper. [12] H. Neumnn. On intersections of finitely generted sugroups of free groups. Pul. Mth., Derecen, 5: , [13] W. Neumnn. On the intersection of finitely generted free groups. In Cnerr 1989 (Lecture notes in Mth., vol. 1456, pp ). Springer- Verlg, [14] P. Nickols. Intersections of finitely generted free groups. Bull. of the Austrlin Mth. Soc., 34: , [15] B. Servtius. A short proof of theorem of Burns. Mthe. Z., 184: , [16] J. R. Stllings. Topology of finite grphs. Invent. Mth., 71: , [17] G. Trdos. On the intersection of sugroups of free group. Invent. Mth., 108:29 36, [18] G. Trdos. Towrd the Hnn Neumnn Conjecture using Dicks method. Invent. Mth., 123:95 104,
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 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 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 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 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 informationInfinitely 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 informationQuadratic 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 informationFrobenius 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 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 informationHomework Solution - Set 5 Due: Friday 10/03/08
CE 96 Introduction to the Theory of Computtion ll 2008 Homework olution - et 5 Due: ridy 10/0/08 1. Textook, Pge 86, Exercise 1.21. () 1 2 Add new strt stte nd finl stte. Mke originl finl stte non-finl.
More informationAdvanced 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 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 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 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 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 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 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 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 informationTorsion in Groups of Integral Triangles
Advnces in Pure Mthemtics, 01,, 116-10 http://dxdoiorg/1046/pm011015 Pulished Online Jnury 01 (http://wwwscirporg/journl/pm) Torsion in Groups of Integrl Tringles Will Murry Deprtment of Mthemtics nd Sttistics,
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 informationLecture 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 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 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 informationParse trees, ambiguity, and Chomsky normal form
Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for context-free grmmrs
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 informationI1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3
2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is
More informationSelf-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 informationAN INEQUALITY OF OSTROWSKI TYPE AND ITS APPLICATIONS FOR SIMPSON S RULE AND SPECIAL MEANS. I. Fedotov and S. S. Dragomir
RGMIA Reserch Report Collection, Vol., No., 999 http://sci.vu.edu.u/ rgmi AN INEQUALITY OF OSTROWSKI TYPE AND ITS APPLICATIONS FOR SIMPSON S RULE AND SPECIAL MEANS I. Fedotov nd S. S. Drgomir Astrct. An
More informationDecomposition of terms in Lucas sequences
Journl of Logic & Anlysis 1:4 009 1 3 ISSN 1759-9008 1 Decomposition of terms in Lucs sequences ABDELMADJID BOUDAOUD Let P, Q be non-zero integers such tht D = P 4Q is different from zero. The sequences
More informationReview 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 informationWENJUN LIU AND QUÔ C ANH NGÔ
AN OSTROWSKI-GRÜSS TYPE INEQUALITY ON TIME SCALES WENJUN LIU AND QUÔ C ANH NGÔ Astrct. In this pper we derive new inequlity of Ostrowski-Grüss type on time scles nd thus unify corresponding continuous
More informationEhrenfeucht-Fraïssé Games: Applications and Complexity. Department of Mathematics and Computer Science University of Udine, Italy ESSLLI 2010 CPH
Ehrenfeucht-Frïssé Gmes: Applictions nd Complexity Angelo Montnri Nicol Vitcolonn Deprtment of Mthemtics nd Computer Science University of Udine, Itly ESSLLI 2010 CPH Outline Introduction to EF-gmes Inexpressivity
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 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 informationOn the complexity of the Whitehead minimization problem
rxiv:mth/0608779v2 [mth.gr] 3 Nov 2006 On the complexity of the Whitehed minimiztion prolem Adó Roig (do.roig@upc.edu) Universitt Politècnic de Ctluny Enric Ventur (enric.ventur@upc.edu) Universitt Politècnic
More information1B40 Practical Skills
B40 Prcticl Skills Comining uncertinties from severl quntities error propgtion We usully encounter situtions where the result of n experiment is given in terms of two (or more) quntities. We then need
More informationTalen en Automaten Test 1, Mon 7 th Dec, h45 17h30
Tlen en Automten Test 1, Mon 7 th Dec, 2015 15h45 17h30 This test consists of four exercises over 5 pges. Explin your pproch, nd write your nswer to ech exercise on seprte pge. You cn score mximum of 100
More informationExercises with (Some) Solutions
Exercises with (Some) Solutions Techer: Luc Tesei Mster of Science in Computer Science - University of Cmerino Contents 1 Strong Bisimultion nd HML 2 2 Wek Bisimultion 31 3 Complete Lttices nd Fix Points
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 informationCS 330 Formal Methods and Models
CS 330 Forml Methods nd Models Dn Richrds, George Mson University, Spring 2017 Quiz Solutions Quiz 1, Propositionl Logic Dte: Ferury 2 1. Prove ((( p q) q) p) is tutology () (3pts) y truth tle. p q p q
More informationA product convergence theorem for Henstock Kurzweil integrals
A product convergence theorem for Henstock Kurzweil integrls Prsr Mohnty Erik Tlvil 1 Deprtment of Mthemticl nd Sttisticl Sciences University of Albert Edmonton AB Cnd T6G 2G1 pmohnty@mth.ulbert.c etlvil@mth.ulbert.c
More informationRegular expressions, Finite Automata, transition graphs are all the same!!
CSI 3104 /Winter 2011: Introduction to Forml Lnguges Chpter 7: Kleene s Theorem Chpter 7: Kleene s Theorem Regulr expressions, Finite Automt, trnsition grphs re ll the sme!! Dr. Neji Zgui CSI3104-W11 1
More informationUSA Mathematical Talent Search Round 1 Solutions Year 21 Academic Year
1/1/21. Fill in the circles in the picture t right with the digits 1-8, one digit in ech circle with no digit repeted, so tht no two circles tht re connected by line segment contin consecutive digits.
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 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 informationA NOTE ON PREPARACOMPACTNESS
Volume 1, 1976 Pges 253 260 http://topology.uburn.edu/tp/ A NOTE ON PREPARACOMPACTNE by J. C. mith Topology Proceedings Web: http://topology.uburn.edu/tp/ Mil: Topology Proceedings Deprtment of Mthemtics
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 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 informationSpanning 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 informationConvex 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 informationFormal 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 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 informationAdvanced Calculus: MATH 410 Uniform Convergence of Functions Professor David Levermore 11 December 2015
Advnced Clculus: MATH 410 Uniform Convergence of Functions Professor Dvid Levermore 11 December 2015 12. Sequences of Functions We now explore two notions of wht it mens for sequence of functions {f n
More informationNondeterminism and Nodeterministic Automata
Nondeterminism nd Nodeterministic Automt 61 Nondeterminism nd Nondeterministic Automt The computtionl mchine models tht we lerned in the clss re deterministic in the sense tht the next move is uniquely
More informationGeneralized 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 informationA PROOF OF THE FUNDAMENTAL THEOREM OF CALCULUS USING HAUSDORFF MEASURES
INROADS Rel Anlysis Exchnge Vol. 26(1), 2000/2001, pp. 381 390 Constntin Volintiru, Deprtment of Mthemtics, University of Buchrest, Buchrest, Romni. e-mil: cosv@mt.cs.unibuc.ro A PROOF OF THE FUNDAMENTAL
More informationTHE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.
THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrd-lindelof-theorem/ This document is proof of the existence-uniqueness theorem
More information12.1 Nondeterminism Nondeterministic Finite Automata. a a b ε. CS125 Lecture 12 Fall 2016
CS125 Lecture 12 Fll 2016 12.1 Nondeterminism The ide of nondeterministic computtions is to llow our lgorithms to mke guesses, nd only require tht they ccept when the guesses re correct. For exmple, simple
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 informationON ALTERNATING POWER SUMS OF ARITHMETIC PROGRESSIONS
ON ALTERNATING POWER SUMS OF ARITHMETIC PROGRESSIONS A. BAZSÓ Astrct. Depending on the prity of the positive integer n the lternting power sum T k n = k + k + + k...+ 1 n 1 n 1 + k. cn e extended to polynomil
More informationFUNDAMENTALS OF REAL ANALYSIS by. III.1. Measurable functions. f 1 (
FUNDAMNTALS OF RAL ANALYSIS by Doğn Çömez III. MASURABL FUNCTIONS AND LBSGU INTGRAL III.. Mesurble functions Hving the Lebesgue mesure define, in this chpter, we will identify the collection of functions
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 informationList all of the possible rational roots of each equation. Then find all solutions (both real and imaginary) of the equation. 1.
Mth Anlysis CP WS 4.X- Section 4.-4.4 Review Complete ech question without the use of grphing clcultor.. Compre the mening of the words: roots, zeros nd fctors.. Determine whether - is root of 0. Show
More informationMATH1050 Cauchy-Schwarz Inequality and Triangle Inequality
MATH050 Cuchy-Schwrz Inequlity nd Tringle Inequlity 0 Refer to the Hndout Qudrtic polynomils Definition (Asolute extrem for rel-vlued functions of one rel vrile) Let I e n intervl, nd h : D R e rel-vlued
More informationset 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 informationThe Riemann-Lebesgue Lemma
Physics 215 Winter 218 The Riemnn-Lebesgue Lemm The Riemnn Lebesgue Lemm is one of the most importnt results of Fourier nlysis nd symptotic nlysis. It hs mny physics pplictions, especilly in studies of
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 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 informationarxiv: 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 informationChristine Bessenrodt. Fakultät für Mathematik und Physik, Leibniz Universität Hannover, Welfengarten 1, Hannover, Germany
Séminire Lothringien de Comintoire 54A (2006), Article B54Ag ALGEBRA INVARIANTS FOR FINITE DIRECTED GRAPHS WITH RELATIONS Christine Bessenrodt Fkultät für Mthemtik und Physik, Leiniz Universität Hnnover,
More informationRectangular group congruences on an epigroup
cholrs Journl of Engineering nd Technology (JET) ch J Eng Tech, 015; 3(9):73-736 cholrs Acdemic nd cientific Pulisher (An Interntionl Pulisher for Acdemic nd cientific Resources) wwwsspulishercom IN 31-435X
More informationCS 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 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 information1 Nondeterministic Finite Automata
1 Nondeterministic Finite Automt Suppose in life, whenever you hd choice, you could try oth possiilities nd live your life. At the end, you would go ck nd choose the one tht worked out the est. Then you
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 informationBoolean Algebra. Boolean Algebra
Boolen Alger Boolen Alger A Boolen lger is set B of vlues together with: - two inry opertions, commonly denoted y + nd, - unry opertion, usully denoted y ˉ or ~ or, - two elements usully clled zero nd
More informationII. 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 informationReview of Calculus, cont d
Jim Lmbers MAT 460 Fll Semester 2009-10 Lecture 3 Notes These notes correspond to Section 1.1 in the text. Review of Clculus, cont d Riemnn Sums nd the Definite Integrl There re mny cses in which some
More informationA 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 informationOn the Continuous Dependence of Solutions of Boundary Value Problems for Delay Differential Equations
Journl of Computtions & Modelling, vol.3, no.4, 2013, 1-10 ISSN: 1792-7625 (print), 1792-8850 (online) Scienpress Ltd, 2013 On the Continuous Dependence of Solutions of Boundry Vlue Problems for Dely Differentil
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 informationW. We shall do so one by one, starting with I 1, and we shall do it greedily, trying
Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)
More informationQuantum Nonlocality Pt. 2: No-Signaling and Local Hidden Variables May 1, / 16
Quntum Nonloclity Pt. 2: No-Signling nd Locl Hidden Vriles My 1, 2018 Quntum Nonloclity Pt. 2: No-Signling nd Locl Hidden Vriles My 1, 2018 1 / 16 Non-Signling Boxes The primry lesson from lst lecture
More information4 7x =250; 5 3x =500; Read section 3.3, 3.4 Announcements: Bell Ringer: Use your calculator to solve
Dte: 3/14/13 Objective: SWBAT pply properties of exponentil functions nd will pply properties of rithms. Bell Ringer: Use your clcultor to solve 4 7x =250; 5 3x =500; HW Requests: Properties of Log Equtions
More informationSOLUTIONS FOR ADMISSIONS TEST IN MATHEMATICS, COMPUTER SCIENCE AND JOINT SCHOOLS WEDNESDAY 5 NOVEMBER 2014
SOLUTIONS FOR ADMISSIONS TEST IN MATHEMATICS, COMPUTER SCIENCE AND JOINT SCHOOLS WEDNESDAY 5 NOVEMBER 014 Mrk Scheme: Ech prt of Question 1 is worth four mrks which re wrded solely for the correct nswer.
More informationLinearly Similar Polynomials
Linerly Similr Polynomils rthur Holshouser 3600 Bullrd St. Chrlotte, NC, US Hrold Reiter Deprtment of Mthemticl Sciences University of North Crolin Chrlotte, Chrlotte, NC 28223, US hbreiter@uncc.edu stndrd
More informationResistive Network Analysis
C H A P T E R 3 Resistive Network Anlysis his chpter will illustrte the fundmentl techniques for the nlysis of resistive circuits. The methods introduced re sed on the circuit lws presented in Chpter 2:
More informationDomino Recognizability of Triangular Picture Languages
Interntionl Journl of Computer Applictions (0975 8887) Volume 57 No.5 Novemer 0 Domino Recognizility of ringulr icture Lnguges V. Devi Rjselvi Reserch Scholr Sthym University Chenni 600 9. Klyni Hed of
More information7.8 Improper Integrals
7.8 7.8 Improper Integrls The Completeness Axiom of the Rel Numers Roughly speking, the rel numers re clled complete ecuse they hve no holes. The completeness of the rel numers hs numer of importnt consequences.
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 informationA negative answer to a question of Wilke on varieties of!-languages
A negtive nswer to question of Wilke on vrieties of!-lnguges Jen-Eric Pin () Astrct. In recent pper, Wilke sked whether the oolen comintions of!-lnguges of the form! L, for L in given +-vriety of lnguges,
More informationarxiv: v1 [math.co] 8 Sep 2015
Accepted for puliction in Mthemtic Slovc ZERO-DIVISOR GRAPHS OF LOWER DISMANTLABLE LATTICES-I AVINASH PATIL*, B. N. WAPHARE**, V. V. JOSHI** AND H. Y. POURALI** Dedicted to Professor N. K. Thkre on his
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 informationf(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 informationLower Bounds on the Area Requirements of Series-Parallel Graphs
Discrete Mthemtics nd Theoreticl Computer Science DMTCS vol. 12:5, 2010, 139 174 Lower Bounds on the Are Requirements of Series-Prllel Grphs Frizio Frti Università Rom Tre, Itly, nd École Polytechnique
More informationSemigroup of generalized inverses of matrices
Semigroup of generlized inverses of mtrices Hnif Zekroui nd Sid Guedjib Abstrct. The pper is divided into two principl prts. In the first one, we give the set of generlized inverses of mtrix A structure
More information1. A refinement of a classical class number relation We give a refinement, and a new proof, of the following classical result [1, 2, 3].
A COMBINATORIAL REFINEMENT OF THE KRONECKER-HURWITZ CLASS NUMBER RELATION rxiv:604.08v [mth.nt] Apr 06 ALEXANDRU A. POPA AND DON ZAGIER Astrct. We give refinement of the Kronecker-Hurwitz clss numer reltion,
More informationCSCI 340: Computational Models. Kleene s Theorem. Department of Computer Science
CSCI 340: Computtionl Models Kleene s Theorem Chpter 7 Deprtment of Computer Science Unifiction In 1954, Kleene presented (nd proved) theorem which (in our version) sttes tht if lnguge cn e defined y ny
More information