Christine Bessenrodt. Fakultät für Mathematik und Physik, Leibniz Universität Hannover, Welfengarten 1, Hannover, Germany

Size: px
Start display at page:

Download "Christine Bessenrodt. Fakultät für Mathematik und Physik, Leibniz Universität Hannover, Welfengarten 1, Hannover, Germany"

Transcription

1 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, Welfengrten 1, Hnnover, Germny Astrct. Finite directed grphs with reltions define finite-dimensionl lgers given s fctor lgers of the corresponding pth lgers. In joint work with T. Holm, we studied invrints of n ssocited generlized Crtn mtrix for certin types of lgers where the Crtn invrints siclly count nonzero pths; the min motivtion for this cme from the context of derived module ctegories nd derived invrints. For the so-clled (skewed) gentle lgers we computed explicit comintoril formule for the invrint fctors of the Crtn mtrices. Bsed on the tlk t the FPSAC 05 conference in Tormin, some of this work is surveyed here, nd some further results on lgers of different type re presented in the finl section. 1. Introduction Finite directed grphs ply n importnt rôle in the representtion theory of finite-dimensionl lgers, where they re clled quivers. For given quiver Q nd field K one otins n lger KQ y tking ll pths in Q, including the trivil pths of length 0 t ech vertex, s K-sis, nd defines multipliction s induced y conctention of pths; this is clled the pth lger to the quiver Q. The importnce of the pth lgers lies in fmous result y Griel tht ny finite-dimensionl K-lger over n lgericlly closed field K is Morit equivlent to fctor lger KQ/I, where I is n dmissile idel of KQ (i.e., contined in the squre of the idel of KQ generted y the rrows). Thus such fctor lgers KQ/I re centrl ojects of study in the representtion theory of lgers; this sitution is referred to s quiver with reltions. There re mny interesting representtion theoretic properties of such lgers for which one tries to find comintoril methods for computing them. It is of prticulr importnce to consider representtion theoretic prmeters of the lger which re invrints for pproprite equivlence clsses of lgers. In recent yers focus in the representtion theory of lgers hs een the investigtion

2 2 CHRISTINE BESSENRODT of derived equivlences of lgers; this is homologicl notion: two lgers re derived equivlent if their derived module ctegories re equivlent. A lot of progress hs recently een mde in this very ctive re. It is difficult prolem to find invrints of lgers preserved y derived equivlences; only few importnt representtion theoretic prmeters re known to e indeed invrints under derived equivlence, such s the numer of simple modules, the dimension of the center of the lger or the dimension of its Hochschild cohomology groups. Here, we will discuss invrints of the Crtn mtrix of finite-dimensionl lger A = KQ/I. Crtn mtrices contin crucil structurl informtion on the lger, s their entries re the multiplicities of simple A-modules s composition fctors of projective indecomposle A-modules. It is in generl difficult to compute the entries of the Crtn mtrix nd some fmous conjectures re relted to their properties. The min point to note here is tht the unimodulr equivlence clss of the Crtn mtrix of finite dimensionl lger is invrint under derived equivlence. From comintoril point of view it is importnt tht for finite-dimensionl lger A = KQ/I given y quiver with reltions, the entries of the Crtn mtrix cn e computed y considering pths in the quiver Q which re non-zero in the lger A. The lgers we study here re the (skewed-) gentle lgers which re defined comintorilly y conditions on the quiver nd reltions. Gentle lgers occur nturlly in mny plces in the representtion theory of finite dimensionl lgers, in prticulr in connection with derived ctegories. They mde their first ppernce in 1981 [1] when it ws shown tht the lgers which re derived equivlent to hereditry lgers of type A re precisely the gentle lgers whose underlying undirected grph is tree. The lgers which re derived equivlent to hereditry lgers of type à re certin gentle lgers whose underlying grph hs exctly one cycle [2]. Only recently it ws proved tht the clss of gentle lgers hs the remrkle property of eing closed under derived equivlence [10]. For more ckground on the lgeric context the reder is referred to [5]. In joint work with T. Holm [5] we hve studied the Crtn mtrices of (skewed- )gentle lgers nd some refinements nd generliztion of this notion; the strting point of our investigtion ws recent result y T. Holm [8] giving n explicit comintoril formul for the Crtn determinnts of gentle lgers. In [5], these results re improved to determintion of the invrint fctors of the Crtn mtrix C A of gentle lger A = KQ/I, nd the formule re lso extended to skewed-gentle lgers. Sections 2 nd 3 survey some of these results, nd (s in the tlk t FPSAC 05) we tke the opportunity to include n lterntive proof for the fct tht the numer of oriented cycles with full zero reltions in such quiver is ounded y the numer of vertices. The key to the refinement of the

3 ALGEBRA INVARIANTS FOR FINITE DIRECTED GRAPHS WITH RELATIONS 3 comintoril nlysis of the quiver is to put weight on the pths ccording to their lengths insted of just counting them; in our context, this mkes good sense s the reltions on the quiver re homogeneous (in fct, they re even more specil). Tking n indeterminte q corresponding to the weight of n rrow, this gives us q-crtn mtrix C A (q) for the lger; this my lso e considered s so-clled filtered Crtn mtrix, counting the multiplicities of the simple modules in the rdicl lyers of the lger. Setting q = 1 gives the ordinry Crtn mtrix C A. We hve lredy pointed out tht the unimodulr equivlence clss of the Crtn mtrix of finite-dimensionl lger is invrint under derived equivlence. But unfortuntely, not even the determinnt of the q-crtn mtrix is in generl n invrint under derived equivlence. There re further finite-dimensionl lgers given y quivers nd reltions for which it is possile to determine the q-crtn mtrices nd otin nice formule for their invrints or t lest their determinnt. A further fmily of lgers ssocited with cyclic quivers is considered in the finl section 4; here, the q- Crtn mtrices re specil circulnt mtrices nd we compute their determinnts nd invrints explicitly. Finlly, in more recent joint work with T. Holm [6] we hve lso delt with clss of infinite-dimensionl lgers which we termed loclly gentle lgers; this clss is gin defined comintorilly y relxing the conditions on the gentle quiver. Also, in this context it is then well motivted to study more generl weights on the quiver. The comintoril point of view dds further interest to these quivers, s for exmple secnt configurtions in regulr 2n-polygons my e viewed s exmples of loclly gentle quivers. For detils the reder is referred to [6]. 2. Gentle lgers In this section, we wnt to descrie n extension nd refinement of the result on the determinnt of the Crtn mtrix of gentle lger from [8] otined in [5] (see [5] for detils). First we hve to give the definition of gentle lgers. They form n importnt suclss of the clss of specil iseril lgers which we now define. Let K e n lgericlly closed field. Let Q e quiver, i.e., finite directed grph, with set of vertices Q 0. Let I e n dmissile idel of the pth lger KQ, i.e., I J 2, where J is the idel of KQ generted y the rrows. For pth p in Q we denote y s(p) its strt vertex nd t(p) its end vertex. The pir (Q, I) is clled specil iseril if the following holds: (i) For ny vertex v Q 0 the set of lengths of the pths strting in v nd not eing in I is finite. (ii) Ech vertex v Q is the end point of t most two rrows nd the strting

4 4 CHRISTINE BESSENRODT point of t most two rrows. (iii) For every rrow α there is t most one rrow β with t(α) = s(β) nd αβ I, nd there is t most one rrow γ with t(γ) = s(α) nd γα I. A specil iseril pir (Q, I) is clled gentle, if furthermore: (iv) There is generting set of I (s idel) consisting of pths of lengths 2. (v) For ny rrow α there is t most one rrow β with t(α) = s(β) nd αβ I, nd there is t most one rrow γ with t(γ) = s(α) nd γα I. A K-lger A is clled gentle (resp. specil iseril) if it is Morit equivlent to n lger KQ/I, for (Q, I) gentle (resp. specil iseril). As we ssume tht the set of vertices Q 0 of Q is finite, condition (i) implies tht the lger KQ/I is finite-dimensionl. As mentioned in the introduction, in [6] the notion of gentle quivers is generlized to loclly gentle quivers; for these quivers, condition (i) need not e stisfied, nd thus the corresponding lgers cn e infinite-dimensionl. By condition (iv), the reltions for gentle quiver re homogeneous, so the length of non-zero pth in KQ/I is well-defined. Then we define the q-crtn mtrix of A = KQ/I s C A (q) = (c ij (q)) i,j Q0, where for i, j Q 0 c ij (q) = n 0 n (i, j)q n with n (i, j) the numer of pths from i to j which re non-zero in A (nd different in A). Exmple. In the following picture, the dotted lines (or rcs) etween two rrows or in loop correspond to the generting reltions for the quiver, i.e., they indicte tht composing the corresponding rrows is zero in the lger A = KQ/I Here is the q-crtn mtrix for this gentle quiver with reltions: 1 + q 5 q + q 2 + q 7 q + q 4 + q 6 + q 9 q 3 + q 4 + q 8 q 2 + q 3 q q 6 q 2 + q 5 + q 8 q + q 3 + q 7 q + q 2 C A (q) = 0 q 1 + q 3 q 2 0 q q 3 q + q 2 + q q 4 0 q 2 + q 3 q 4 + q 5 q 3 + q 4 + q 6 + q 7 q + q 2 + q 5 + q q 3

5 ALGEBRA INVARIANTS FOR FINITE DIRECTED GRAPHS WITH RELATIONS 5 The following property does not only hold for gentle lgers ut for those where we hve dropped the finl condition (v) in the definition of gentle pirs; in [5], it is useful reduction tool in the proof of the min result. Lemm 2.1. Let A = KQ/I e specil iseril lger, where I is generted y pths of length 2. Let α e n rrow in Q, not loop, such tht there is no rrow β with s(α) = t(β) nd βα I, or there is no rrow γ with t(α) = s(γ) nd αγ I. Let Q e the quiver otined from Q y removing the rrow α, I the corresponding reltion idel nd A = KQ /I. Then the q-crtn mtrices C A (q) nd C A (q) re unimodulrly equivlent (over Z[q]). For the comintorilly defined gentle lgers we cn provide n explicit comintoril description for very nice norml form of its q-crtn mtrix; elow, we sy tht mtrix C is unimodulrly equivlent (over Z[q]) to mtrix D, if there re mtrices S, T with entries in Z[q] nd determinnt 1 such tht SCT = D. Theorem 2.2. [5] Let A = KQ/I e gentle lger, defined y gentle pir (Q, I). Denote y c k the numer of oriented k-cycles in Q with full zero reltions. Then the q-crtn mtrix C A (q) is unimodulrly equivlent (over Z[q]) to digonl mtrix with entries (1 ( q) k ), with multiplicity c k, k 1, nd ll further digonl entries eing 1. This result hs some immedite nice consequences. Corollry 2.3. Let A = KQ/I e gentle lger, nd denote y c k the numer of oriented k-cycles in Q with full zero reltions. Then the q-crtn mtrix C A (q) hs determinnt det C A (q) = k 1(1 ( q) k ) c k. Exmple. In the exmple given efore, the q-crtn mtrix hs determinnt det C A (q) = 1 + q + q 3 q 5 q 7 q 8 = (1 + q)(1 + q 3 )(1 q 4 ). Indeed, the quiver hs loop t vertex 5 (which is 1-cycle with zero reltion), 3-cycle with full zero reltions from vertex 1 to 2 to 4 nd ck to 1, nd 4-cycle with full zero reltions running over 2,5,4,3 nd ck to 2. For n lger A = KQ/I s ove, let ec(a) nd oc(a) e the numer of oriented cycles in Q with full zero reltions of even nd odd length, respectively. Setting q = 1, the corollry ove immeditely implies the min result from [8] which ws in fct the strting point of our investigtions in [5]. Corollry 2.4. Let A = KQ/I e gentle lger. Then for the determinnt of its ordinry Crtn mtrix C A the following holds. { 0 if ec(a) > 0 det C A = 2 oc(a) else

6 6 CHRISTINE BESSENRODT The Theorem lso gives the following corollry. Corollry 2.5. Let A = KQ/I e gentle lger. Then there re t most Q 0 oriented cycles with full zero reltions in the quiver Q. Insted of deriving this from the min result (s done in [5]), this my e proved directly. As n illustrtion, we give this lterntive proof here. Clerly the result holds when Q 0 = 1. So we ssume now tht Q 0 > 1, nd we prove the result y induction. We my remove ll rrows going in or out of vertex nd not hving zero reltion t this vertex, without losing the property of the quiver with reltions eing gentle nd without chnging the numer of vertices nd the numer of oriented cycles with full reltions. After this removl, ll vertices re of degree 0, 2 or 4, nd there is zero reltion t ll vertices of degree 2. By induction, we my ssume tht there is no vertex of degree 0 nd tht the quiver is connected. If ll vertices re of degree 4, then there re pths of ritrry lengths, contrdicting the property of eing gentle. Hence there is vertex of degree 2, which then elongs to unique oriented cycle with full zero reltions. Removing this vertex nd the rrows incident to it reduces the numer of vertices s well s the numer of oriented cycles with full zero reltions y 1 (note tht ny rrow in gentle quiver elongs to t most one oriented cycle with full zero reltions). Hence the result follows y induction. Remrk 2.6. Note tht in our context Q 0 is the numer l(a) of simple A- modules, which is lso invrint under derived equivlence. Hence this implies tht the Crtn determinnt of gentle lger A is t most 2 l(a). Recll tht the property of n lger eing gentle is invrint under derived equivlence [10]. Also, we hve pointed out erlier tht the invrint fctors of the ordinry Crtn mtrix C A = C A (1) re invrints of the derived equivlence clss of the lger A = KQ/I. Thus we now hve some esily computle invrints for gentle lgers to distinguish the derived equivlence clsses. Corollry 2.7. Let A = KQ/I nd A = KQ /I e gentle lgers s ove. If A is derived equivlent to A, then ec(a) = ec(a ) nd oc(a) = oc(a ). Our new invrints re quite powerful tool for distinguishing gentle lgers up to derived equivlence which cnnot e seprted y the more clssicl invrints. An illustrtion on how to use the invrints to tell non-equivlent gentle lgers prt is given in [5], where the 9 gentle lgers with two simples nd the 18 gentle lgers with three simples nd vnishing Crtn determinnt re discussed in detil.

7 ALGEBRA INVARIANTS FOR FINITE DIRECTED GRAPHS WITH RELATIONS 7 3. Skewed-gentle lgers Also skewed-gentle lgers re defined comintorilly. They were introduced in [7]; for the nottion nd definition we follow here mostly [4], ut we try to explin how the construction works rther thn stting the technicl definitions. We strt with gentle pir (Q, I). A set Sp of vertices of the quiver Q is n dmissile set of specil vertices if the quiver with reltions otined from Q y dding loops with squre zero t these vertices is gin gentle; we denote this gentle pir y (Q sp, I sp ). The triple (Q, Sp, I) is then clled skewed-gentle. We wnt to point out tht the dmissiility of the set Sp of specil vertices is oth locl s well s glol condition. Let v e vertex in the gentle quiver (Q, I); then we cn only dd loop t v if v is of degree 1 or 0 or if it is of degree 2 with non-loop zero reltion. Hence only vertices of this type re potentil specil vertices. But for the choice of n dmissile set of specil vertices we lso hve to tke cre of the glol condition tht fter dding ll loops, the pir (Q sp, I sp ) still does not hve pths of ritrry lengths. Given skewed-gentle triple (Q, Sp, I), we now construct new quiver with reltions ( ˆQ, Î) y douling the specil vertices, introducing rrows to nd from these vertices corresponding to the previous such rrows nd replcing previous zero reltion t the vertices y mesh reltion. More precisely, we proceed s follows. The non-specil vertices in Q re lso vertices in the new quiver; ny rrow etween non-specil vertices s well s corresponding reltions re lso kept. Any specil vertex v Sp is replced y two vertices v + nd v in the new quiver. An rrow in Q from non-specil vertex w to v (or from v to w) will e douled to rrows ± : w v ± (or ± : v ± w, resp.) in the new quiver; n rrow etween two specil vertices v, w will correspondingly give four rrows etween the pirs v ± nd w ±. We sy tht these new rrows lie over the rrow. Any reltion = 0 where t() = s() is non-specil gives corresponding zero reltion for pths of length 2 with the sme strt nd end points lying over. If v is specil vertex of degree 2 in Q, then the corresponding zero reltion t v, sy = 0 with t() = v = s(), is replced y mesh commuttion reltions sying tht ny two pths of length 2 lying over, hving the sme strt nd end points ut running over v + nd v, respectively, coincide in the fctor lger to the new quiver with reltions ( ˆQ, Î). We will spek of ( ˆQ, Î) s skewed-gentle quiver covering the gentle pir (Q, I). Note tht lso here the generting reltions re homogeneous. A K-lger is then clled skewed-gentle if it is Morit equivlent to fctor lger K ˆQ/Î, where ( ˆQ, Î) comes from skewed-gentle triple (Q, Sp, I) s descried ove.

8 8 CHRISTINE BESSENRODT Exmples. (1) We tke the gentle quiver Q s shown elow, with reltion idel I generted y nd. Then we cn tke Sp = {2}, i.e., only the vertex 2 is specified s specil vertex. This gives the skewed-gentle quiver ˆQ shown elow, with reltion idel Î generted y + +, ± ±, ±. Q Q^ + (2) We tke the gentle quiver Q s shown elow, with reltion idel generted y. This time we tke Sp = Q 0, i.e., ll vertices re chosen to e specil. This gives the skewed-gentle quiver ˆQ shown elow, where for simplicity ll rrows lying over or, respectively, re lso mrked or, respectively, ut for writing down the reltions generting the reltion idel Î we will put signs on, so tht e.g. + denotes the rrow going from 1 + to 2. In this nottion the generting reltions re given y , , , + +. Q Q^ Our result on gentle lgers generlizes nicely to skewed-gentle lgers (see [5] for detils) s follows. Theorem 3.1. [5] Let (Q, I) e gentle quiver, ( ˆQ, Î) covering skewed-gentle quiver. Let  = K ˆQ/Î e the corresponding skewed-gentle lger. Denote y c k the numer of oriented k-cycles in (Q, I) with full zero reltions. Then the q-crtn mtrix CÂ(q) is unimodulrly equivlent (over Z[q]) to digonl mtrix with entries 1 ( q) k, with multiplicity c k, k 1, nd ll further digonl entries eing 1. Remrk 3.2. Thus, the q-crtn mtrix C A (q) for the gentle lger A to (Q, I), nd the q-crtn mtrix CÂ(q) for skewed-gentle cover  re unimodulrly equivlent to digonl mtrices which only differ y dding s mny further 1 s on the digonl s there re specil vertices chosen in Q; in prticulr, with nottion s ove, det CÂ(q) = det C A (q) = k 1(1 ( q) k ) c k nd thus lso for the ordinry Crtn mtrices det C A = det CÂ.

9 ALGEBRA INVARIANTS FOR FINITE DIRECTED GRAPHS WITH RELATIONS 9 4. Cycles nd circulnts There re some more types of lgers for which one cn determine the unimodulr equivlence clss of their q-crtn mtrices. As n exmple, we consider q-crtn mtrices to cyclic quivers with reltions which occur in other interesting contexts. In this sitution, circulnts mke n ppernce, nd we first define the relevnt nottion. For x = (x 1,..., x n ) the circulnt mtrix to x is C = x 1 x 2... x n 1 x n x n x 1... x n 2 x n 1. x 2 x 3... x n x 1. Let ω e primitive n-th root of unity in C. Then C hs the eigenvlues n x k (ω j ) k 1, j = 1,..., n. k=1 Specil circulnts pper s q-crtn mtrices for cyclic quivers with monomil reltions nd commuttion reltions which re homogeneous of degree 2. Exmple. Here is the corresponding cyclic quiver for the cse of 6 vertices: where we tke s generting reltions: 2, 2, (t ech vertex of the quiver). The q-crtn mtrix for such cyclic quiver is just the circulnt to v = (1 + q 2, q, 0..., 0, q). We will descrie more precise result on these q-crtn mtrices elow, ut s it is esy to do we compute here the determinnt. Note tht s in the cse of gentle quivers we hve contriution 1 ( q) n for ech of the two oriented cycles with full zero reltions in the quiver. Theorem 4.1. Let q e n indeterminte, v = (1 + q 2, q, 0..., 0, q) (of length n), nd C(q) the circulnt to v. Then we hve det C(q) = (1 ( q) n ) 2.

10 10 CHRISTINE BESSENRODT Proof. By the ove, we hve n det C(q) = (1 + q 2 + qω j + q(ω j ) n 1 ) = = j=1 j=1 n (1 + q 2 + q(ω j + ω j )) n n. (q + ω j )(q + ω j ) = ( (q + ω j )) 2 Now ω j is zero of q n 1, if n is even nd zero of q n + 1, if n is odd, for ll j, hence we hve the ssertion. In fct, it is not hrd to trnsform the circulnt C(q) to v = (1 + q 2, q, 0..., 0, q) into etter form: Theorem 4.2. Assume n 3, nd let C(q) e s ove. (i) Over Z[q], we cn trnsform C(q) unimodulrly into the form E n ( n ( q) n q 2j 1) ( q) n 1 j=1 j=1 j= ( q) n where E n 2 is the identity mtrix of type n 2. (ii) Over Q[q], we hve the following unimodulr equivlences: n 1 For n odd, C(q) dig(1 n 2, ( q) j, q n+1 + q n + q + 1). (n 2)/2 For n even, C(q) dig(1 n 2, q 2j, q n+2 q n q 2 + 1). j=0 j=0 References [1] I. Assem, D. Hppel, Generlized tilted lgers of type A n, Comm. Alger 9 (1981), no. 20, [2] I. Assem, A. Skowroński, Iterted tilted lgers of type Ãn, Mth. Z. 195 (1987), [3] V. Bekkert, H. Merklen, Indecomposles in derived ctegories of gentle lgers, Algers nd Representtion Theory 6 (2003), no. 3, [4] V. Bekkert, E. N. Mrcos, H. A. Merklen, Indecomposles in derived ctegories of skewedgentle lgers, Comm. in Alger 31 (2003), no. 6, [5] C. Bessenrodt, T. Holm, q-crtn mtrices nd comintoril invrints of derived ctegories for skewed-gentle lgers, to pper in: Pcific J. Mth. [6] C. Bessenrodt, T. Holm, Weighted loclly gentle quivers nd Crtn mtrices, preprint [7] C. Geiss, J. A. de l Peñ, Auslnder Reiten components for clns, Boll. Soc. Mt. Mexicn 5 (1999), [8] T. Holm, Crtn determinnts for gentle lgers, Archiv Mth. 85 (2005),

11 ALGEBRA INVARIANTS FOR FINITE DIRECTED GRAPHS WITH RELATIONS 11 [9] J. Rickrd, Morit theory for derived ctegories, J. London Mth. Soc. (2) 39 (1989), [10] J. Schröer, A. Zimmermnn, Stle endomorphism lgers of modules over specil iseril lgers, Mth. Z. 244 (2003),

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

Lecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.

Lecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations. Lecture 3 3 Solving liner equtions In this lecture we will discuss lgorithms for solving systems of liner equtions Multiplictive identity Let us restrict ourselves to considering squre mtrices since one

More information

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University

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

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

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

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique? XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=

More information

Things to Memorize: A Partial List. January 27, 2017

Things to Memorize: A Partial List. January 27, 2017 Things to Memorize: A Prtil List Jnury 27, 2017 Chpter 2 Vectors - Bsic Fcts A vector hs mgnitude (lso clled size/length/norm) nd direction. It does not hve fixed position, so the sme vector cn e moved

More information

Chapter 14. Matrix Representations of Linear Transformations

Chapter 14. Matrix Representations of Linear Transformations Chpter 4 Mtrix Representtions of Liner Trnsformtions When considering the Het Stte Evolution, we found tht we could describe this process using multipliction by mtrix. This ws nice becuse computers cn

More information

First Midterm Examination

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

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

Parse trees, ambiguity, and Chomsky normal form

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

dx dt dy = G(t, x, y), dt where the functions are defined on I Ω, and are locally Lipschitz w.r.t. variable (x, y) Ω.

dx dt dy = G(t, x, y), dt where the functions are defined on I Ω, and are locally Lipschitz w.r.t. variable (x, y) Ω. Chpter 8 Stility theory We discuss properties of solutions of first order two dimensionl system, nd stility theory for specil clss of liner systems. We denote the independent vrile y t in plce of x, nd

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

Analytically, vectors will be represented by lowercase bold-face Latin letters, e.g. a, r, q.

Analytically, vectors will be represented by lowercase bold-face Latin letters, e.g. a, r, q. 1.1 Vector Alger 1.1.1 Sclrs A physicl quntity which is completely descried y single rel numer is clled sclr. Physiclly, it is something which hs mgnitude, nd is completely descried y this mgnitude. Exmples

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

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

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

First Midterm Examination

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

Here we study square linear systems and properties of their coefficient matrices as they relate to the solution set of the linear system.

Here we study square linear systems and properties of their coefficient matrices as they relate to the solution set of the linear system. Section 24 Nonsingulr Liner Systems Here we study squre liner systems nd properties of their coefficient mtrices s they relte to the solution set of the liner system Let A be n n Then we know from previous

More information

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4

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

Review of Gaussian Quadrature method

Review of Gaussian Quadrature method Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge

More information

MTH 505: Number Theory Spring 2017

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

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

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

1 From NFA to regular expression

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

Lecture Solution of a System of Linear Equation

Lecture Solution of a System of Linear Equation ChE Lecture Notes, Dept. of Chemicl Engineering, Univ. of TN, Knoville - D. Keffer, 5/9/98 (updted /) Lecture 8- - Solution of System of Liner Eqution 8. Why is it importnt to e le to solve system of liner

More information

Torsion in Groups of Integral Triangles

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

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique? XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk bout solving systems of liner equtions. These re problems tht give couple of equtions with couple of unknowns, like: 6 2 3 7 4

More information

September 13 Homework Solutions

September 13 Homework Solutions College of Engineering nd Computer Science Mechnicl Engineering Deprtment Mechnicl Engineering 5A Seminr in Engineering Anlysis Fll Ticket: 5966 Instructor: Lrry Cretto Septemer Homework Solutions. Are

More information

Improper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows:

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

Lecture 2e Orthogonal Complement (pages )

Lecture 2e Orthogonal Complement (pages ) Lecture 2e Orthogonl Complement (pges -) We hve now seen tht n orthonorml sis is nice wy to descrie suspce, ut knowing tht we wnt n orthonorml sis doesn t mke one fll into our lp. In theory, the process

More information

Regular expressions, Finite Automata, transition graphs are all the same!!

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

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

Homework 4. 0 ε 0. (00) ε 0 ε 0 (00) (11) CS 341: Foundations of Computer Science II Prof. Marvin Nakayama

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

Vectors , (0,0). 5. A vector is commonly denoted by putting an arrow above its symbol, as in the picture above. Here are some 3-dimensional vectors:

Vectors , (0,0). 5. A vector is commonly denoted by putting an arrow above its symbol, as in the picture above. Here are some 3-dimensional vectors: Vectors 1-23-2018 I ll look t vectors from n lgeric point of view nd geometric point of view. Algericlly, vector is n ordered list of (usully) rel numers. Here re some 2-dimensionl vectors: (2, 3), ( )

More information

Surface maps into free groups

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

A negative answer to a question of Wilke on varieties of!-languages

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

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

Decomposition of terms in Lucas sequences

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

State Minimization for DFAs

State Minimization for DFAs Stte Minimiztion for DFAs Red K & S 2.7 Do Homework 10. Consider: Stte Minimiztion 4 5 Is this miniml mchine? Step (1): Get rid of unrechle sttes. Stte Minimiztion 6, Stte is unrechle. Step (2): Get rid

More information

ɛ-closure, Kleene s Theorem,

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

Lecture 09: Myhill-Nerode Theorem

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

2. VECTORS AND MATRICES IN 3 DIMENSIONS

2. VECTORS AND MATRICES IN 3 DIMENSIONS 2 VECTORS AND MATRICES IN 3 DIMENSIONS 21 Extending the Theory of 2-dimensionl Vectors x A point in 3-dimensionl spce cn e represented y column vector of the form y z z-xis y-xis z x y x-xis Most of the

More information

1 Nondeterministic Finite Automata

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

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.

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

1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true.

1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true. York University CSE 2 Unit 3. DFA Clsses Converting etween DFA, NFA, Regulr Expressions, nd Extended Regulr Expressions Instructor: Jeff Edmonds Don t chet y looking t these nswers premturely.. For ech

More information

Lecture 3: Curves in Calculus. Table of contents

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

Unit #9 : Definite Integral Properties; Fundamental Theorem of Calculus

Unit #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 information

Rudimentary Matrix Algebra

Rudimentary Matrix Algebra Rudimentry Mtrix Alger Mrk Sullivn Decemer 4, 217 i Contents 1 Preliminries 1 1.1 Why does this document exist?.................... 1 1.2 Why does nyone cre out mtrices?................ 1 1.3 Wht is mtrix?...........................

More information

Homework 3 Solutions

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

Linear Systems with Constant Coefficients

Linear Systems with Constant Coefficients Liner Systems with Constnt Coefficients 4-3-05 Here is system of n differentil equtions in n unknowns: x x + + n x n, x x + + n x n, x n n x + + nn x n This is constnt coefficient liner homogeneous system

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

List all of the possible rational roots of each equation. Then find all solutions (both real and imaginary) of the equation. 1.

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

Closure Properties of Regular Languages

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

SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics

SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics SCHOOL OF ENGINEERING & BUIL ENVIRONMEN Mthemtics An Introduction to Mtrices Definition of Mtri Size of Mtri Rows nd Columns of Mtri Mtri Addition Sclr Multipliction of Mtri Mtri Multipliction 7 rnspose

More information

1B40 Practical Skills

1B40 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 information

The Algebra (al-jabr) of Matrices

The Algebra (al-jabr) of Matrices Section : Mtri lgebr nd Clculus Wshkewicz College of Engineering he lgebr (l-jbr) of Mtrices lgebr s brnch of mthemtics is much broder thn elementry lgebr ll of us studied in our high school dys. In sense

More information

PART 2. REGULAR LANGUAGES, GRAMMARS AND AUTOMATA

PART 2. REGULAR LANGUAGES, GRAMMARS AND AUTOMATA PART 2. REGULAR LANGUAGES, GRAMMARS AND AUTOMATA RIGHT LINEAR LANGUAGES. Right Liner Grmmr: Rules of the form: A α B, A α A,B V N, α V T + Left Liner Grmmr: Rules of the form: A Bα, A α A,B V N, α V T

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

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

Homework Solution - Set 5 Due: Friday 10/03/08

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

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

CHAPTER 1 PROGRAM OF MATRICES

CHAPTER 1 PROGRAM OF MATRICES CHPTER PROGRM OF MTRICES -- INTRODUCTION definition of engineering is the science y which the properties of mtter nd sources of energy in nture re mde useful to mn. Thus n engineer will hve to study the

More information

4 VECTORS. 4.0 Introduction. Objectives. Activity 1

4 VECTORS. 4.0 Introduction. Objectives. Activity 1 4 VECTRS Chpter 4 Vectors jectives fter studying this chpter you should understnd the difference etween vectors nd sclrs; e le to find the mgnitude nd direction of vector; e le to dd vectors, nd multiply

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

Chapter 0. What is the Lebesgue integral about?

Chapter 0. What is the Lebesgue integral about? Chpter 0. Wht is the Lebesgue integrl bout? The pln is to hve tutoril sheet ech week, most often on Fridy, (to be done during the clss) where you will try to get used to the ides introduced in the previous

More information

7.2 The Definite Integral

7.2 The Definite Integral 7.2 The Definite Integrl the definite integrl In the previous section, it ws found tht if function f is continuous nd nonnegtive, then the re under the grph of f on [, b] is given by F (b) F (), where

More information

Hamiltonian Cycle in Complete Multipartite Graphs

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

Suppose we want to find the area under the parabola and above the x axis, between the lines x = 2 and x = -2.

Suppose we want to find the area under the parabola and above the x axis, between the lines x = 2 and x = -2. Mth 43 Section 6. Section 6.: Definite Integrl Suppose we wnt to find the re of region tht is not so nicely shped. For exmple, consider the function shown elow. The re elow the curve nd ove the x xis cnnot

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

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

CS 275 Automata and Formal Language Theory

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

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3

I1 = 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 information

Physics 116C Solution of inhomogeneous ordinary differential equations using Green s functions

Physics 116C Solution of inhomogeneous ordinary differential equations using Green s functions Physics 6C Solution of inhomogeneous ordinry differentil equtions using Green s functions Peter Young November 5, 29 Homogeneous Equtions We hve studied, especilly in long HW problem, second order liner

More information

CSCI 340: Computational Models. Kleene s Theorem. Department of Computer Science

CSCI 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

Exercises with (Some) Solutions

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

2.4 Linear Inequalities and Interval Notation

2.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 information

Separating Regular Languages with First-Order Logic

Separating Regular Languages with First-Order Logic Seprting Regulr Lnguges with First-Order Logic Thoms Plce Mrc Zeitoun LBRI, Bordeux University, Frnce firstnme.lstnme@lri.fr Astrct Given two lnguges, seprtor is third lnguge tht contins the first one

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

Is there an easy way to find examples of such triples? Why yes! Just look at an ordinary multiplication table to find them!

Is there an easy way to find examples of such triples? Why yes! Just look at an ordinary multiplication table to find them! PUSHING PYTHAGORAS 009 Jmes Tnton A triple of integers ( bc,, ) is clled Pythgoren triple if exmple, some clssic triples re ( 3,4,5 ), ( 5,1,13 ), ( ) fond of ( 0,1,9 ) nd ( 119,10,169 ). + b = c. For

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

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

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

CHAPTER 1 Regular Languages. Contents

CHAPTER 1 Regular Languages. Contents Finite Automt (FA or DFA) CHAPTE 1 egulr Lnguges Contents definitions, exmples, designing, regulr opertions Non-deterministic Finite Automt (NFA) definitions, euivlence of NFAs nd DFAs, closure under regulr

More information

ODE: Existence and Uniqueness of a Solution

ODE: Existence and Uniqueness of a Solution Mth 22 Fll 213 Jerry Kzdn ODE: Existence nd Uniqueness of Solution The Fundmentl Theorem of Clculus tells us how to solve the ordinry differentil eqution (ODE) du = f(t) dt with initil condition u() =

More information

SCHOOL OF ENGINEERING & BUILT ENVIRONMENT

SCHOOL OF ENGINEERING & BUILT ENVIRONMENT SCHOOL OF ENGINEERING & BUIL ENVIRONMEN MARICES FOR ENGINEERING Dr Clum Mcdonld Contents Introduction Definitions Wht is mtri? Rows nd columns of mtri Order of mtri Element of mtri Equlity of mtrices Opertions

More information

Linear Inequalities. Work Sheet 1

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

Recitation 3: More Applications of the Derivative

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

Section 6.1 Definite Integral

Section 6.1 Definite Integral Section 6.1 Definite Integrl Suppose we wnt to find the re of region tht is not so nicely shped. For exmple, consider the function shown elow. The re elow the curve nd ove the x xis cnnot e determined

More information