F-Rational Rings and the Integral Closures of Ideals
|
|
- Marjorie Barber
- 7 years ago
- Views:
Transcription
1 Mchgan Math. J. 49 (2001) F-Ratonal Rngs and the Integral Closures of Ideals Ian M. Aberbach & Crag Huneke 1. Introducton The hstory of the Brançon Skoda theorem and ts ensung avatars n commutatve algebra have been well documented n many papers (see e.g. [AH1; LS]). We wll therefore only brefly revew the relevant concepts and theorems. Frst recall the defntons of the ntegral closure of an deal. Defnton 1.1. Let R be a rng and let I be an deal of R. An element x R s ntegral over I f x satsfes an equaton of the form x n + a 1 x n 1 + +a n = 0, where a j I j for 1 j n. The ntegral closure of I, denoted by I,s the set of all elements ntegral over I. Ths set s an deal. Let R o be the set of all elements of R not n a mnmal prme. An equvalent though less standard (but for our purposes a more useful) defnton of ntegral closure s the followng. Equvalent Defnton 1.1. Let R be a Noetheran rng and let I be an deal of R. An element x R s ntegral over I f there exsts an element c R o such that cx n I n for all n 0. A theorem proved by Brançon and Skoda [BS] for convergent power seres over the complex numbers and generalzed to arbtrary regular local rngs by Lpman and Sathaye states as follows. Theorem 1.2 [BS; LS]. Let R be a regular local rng and let I be an deal generated by l elements. Then, for all n l, I n I n l+1. Ths was partally extended to the class of pseudo-ratonal rngs by Lpman and Tesser [LT]. However, they were unable to recover the full strength of Theorem 1.2. Theorem 1.3 [LT, (2.2)]. Let R be a Noetheran local rng and assume that the localzaton R P s pseudo-ratonal for every prme deal P n R. Suppose that I has a reducton J such that dm R P δ for every assocated prme P of J n. Then Receved February 22, Revson receved October 10, Both authors were partally supported by the NSF. 3
2 4 Ian M. Aberbach & Crag Huneke I n+δ 1 J n. In partcular, f J can be generated by a regular sequence of length δ, then the above contanment holds for all n 1. The present two authors, as well as Lpman, have pushed the orgnal theorem further by ntroducng coeffcents ; see [AH1; AH2; AHT; L]. The methods used by the present authors have reled on the theory of tght closure. These mprovements, however, have been vald only n regular rngs, and the queston of whether the statement of Theorem 1.2 remans vald n arbtrary pseudo-ratonal rngs has remaned open snce Recent progress was made by Hyry and Vllamayor [HyV], who proved (among other thngs) that f R s local Gorensten and essentally of fnte type over a feld of characterstc 0, then I n+l 1 I n for an arbtrary deal I wth l generators. In ths paper we wll use tght closure methods to prove that Theorem 1.2 s vald for F-ratonal rngs (the defnton s n Secton 2). In characterstc p, Smth [Sm] proved that F-ratonal mples pseudo-ratonal, but t can be stronger n general. However, for affne algebras n equcharacterstc 0, the concepts of ratonal sngularty, pseudo-ratonal sngularty, and F-ratonal type all agree, owng to work of Lpman and Tesser [LT] for the equvalence of ratonal sngularty and pseudo-ratonal sngularty, and of Smth [Sm] and Hara [Ha] and ndependently Mehta and Srnvas [MS] for the equvalence of ratonal sngularty and F-ratonal type (Smth proved that ratonal mples F-ratonal type and the other authors have just recently proved the converse). It follows from these equvalences that, n equcharacterstc 0, we are able to prove Theorem 1.2 for ratonal sngulartes. The basc dea of ths paper s nspred by the proof of a cancellaton theorem (see [Hu1]). The key dea s to relate an arbtrary deal I to a system of parameters n a manner that closely approxmates the structure of the powers of I. We do ths by usng frst a basc constructon and then a theorem that relates the ntegral closure of powers of I wth the tght closure of the system of parameters. In the next secton we brefly dscuss tght closure; see [HH1; Hu2] for more references and nformaton. We begn wth the defnton. 2. Tght Closure Defnton 2.1. Let R be a Noetheran rng of characterstc p>0. Let I be an deal of R. An element x R s sad to be n the tght closure of I f there exsts an element c R o such that cx q I [q] for all large q = p e, where I [q] s the deal generated by the qth powers of all elements of I. Every deal n a regular rng s tghtly closed. We say that elements x 1,...,x n n R are parameters f the heght of the deal generated by them s at least n (we allow them to be the whole rng, n whch case the heght s sad to be ). If the deal they generate s proper, then the Krull heght theorem says that the heght s exactly n.
3 F-Ratonal Rngs and the Integral Closures of Ideals 5 Defnton 2.2. A Noetheran rng R of characterstc p>0 s sad to be F- ratonal f the deals generated by parameters are tghtly closed. Ths defnton arose from the work of Fedder and Watanabe [FW] because of the apparent connecton to the concept of ratonal sngulartes. The concept of pseudo-ratonalty was ntroduced n [LT], partly as a substtute for the noton of ratonal sngulartes n postve and mxed characterstc, where desngularzatons are not known to exst n general. Ther defnton s as follows (see [LT, Sec. 2]). Defnton 2.3. Let (R, m) be a d-dmensonal local Noetheran rng. The rng R s sad to be pseudo-ratonal f t s normal, Cohen Macaulay, and analytcally unramfed and f, for every proper bratonal map π : W X = Spec(R) wth W normal and closed fber E = π 1 (m), the canoncal map Hm d (π (O W )) = Hm d (R) H E d (O W) s njectve. In [LT] t s proved that, for a local rng essentally of fnte type over a feld of characterstc 0, the notons of pseudo-ratonal and ratonal sngularty agree. In [Sm] t s shown that, n postve characterstc, F-ratonal mples pseudo-ratonal. Smth uses ths to prove that rngs of fnte type over a feld of characterstc 0 that are F-ratonal type have ratonal sngulartes. Here F-ratonal type essentally means that characterstc-p models of the varety are F-ratonal. More precsely, we next ntroduce the dea of a model. Let R be a rng that s fntely generated over a feld of characterstc 0, say R = k[x 1,...,X n ]/I. Then we can choose generators for the deal I and, by collectng coeffcents of those generators, fnd a fntely generated Z-algebra A k such that defnng R A = A[X 1,...,X n ]/(I A[X 1,...,X n ]) yelds R = k A R A. We call the map A R A a famly of models of R. We sometmes nsst that the map A R A be flat, whch one can always obtan by expandng A by localzng at a sngle element. A typcal closed fber of R A over A s a characterstc-p model of R. Defnton 2.5. Let R be a fntely generated algebra over a feld of characterstc 0. Then R s sad to have F-ratonal type f R admts a famly of models A R A n whch a Zarsk dense set of closed fbers are F-ratonal. (Ths does not depend on the choce of models.) The theorem n [Sm] states that, f X s a scheme of fnte type over a feld of characterstc 0, then f X has F-ratonal type t has only ratonal sngulartes. Recently, the converse has been proved by Hara [Ha] and ndependently by Mehta and Srnvas [MS]. 3. F-Ratonal Rngs and Tght Closure In ths secton we frst dscuss a basc constructon that wll play a crucal role n the paper. Gven an deal I n a Noetheran local rng (R, m), a mnmal reducton
4 6 Ian M. Aberbach & Crag Huneke J of I say, J = (a 1,...,a l ) and an nteger N, we wsh to construct an deal A generated by parameters such that J A modulo m N and such that A s closely related to I and ts powers. For example, one would lke I A, but ths s n general not possble snce I may not be contaned n any deal generated by parameters. We record what we need n Proposton 3.2. We need the followng lemma from [AHT]. Lemma 3.1. Let (R, m) be a local rng wth nfnte resdue feld and let I R be an deal of analytc spread l. Let J I be a mnmal reducton of I. Then there exsts a basc generatng set a 1,...,a l for J such that (1) f P s a prme deal contanng I and ht P = l then (a 1,...,a ) P s a reducton of I P, and (2) ht((a 1,...,a )I n : I n+1 + I) + 1 for all n 0. (3) If c a modulo I 2, then (1) and (2) hold wth c replacng a. Proof. The frst two statements are found n [AHT, Lemma 7.2]. The last statement follows from the proof of Lemma 7.2 n [AHT]. The choce of a basc generatng set depends only on the mages of the a n the assocated graded rng G = R/I I/I 2. In partcular, snce c and a have the same leadng forms n G, (3) follows. Proposton 3.2. Let (R, m) be an equdmensonal and catenary local rng wth nfnte resdue feld and let I R be an deal of analytc spread l. Let J I be a mnmal reducton of I. We assume that ht I = g and J = (a 1,...,a l ), a basc generatng set for J as n Lemma 3.1. Let N and w be fxed ntegers, and suppose that for g + 1 l we are gven fnte sets of prmes ={Q j } all contanng I and of heght. Then there exst elements a 1,...,a l and t g+1,...,t l such that the followng hold (we set t = 0 for g for convenence): (1) a a modulo I 2 ; (2) for g + 1 l, t m N ; (3) b 1,...,b g,b g+1,...,b l are parameters, where b = a + t ; (4) f R/I s equdmensonal then the mages of t g+1,...,t l n R/I are parameters; (5) there s an nteger M such that t +1 (J ti M : I M+t ) for all 0 t w + l, where J = (a 1,...,a ); (6) t +1 / j Q j, where the unon s over the prmes n. Proof. We choose the a and t nductvely. We frst modfy a 1,...,a g to a 1,...,a g n such a way that these elements form parameters. We can do ths wth a a modulo I 2 for 1 g. Suppose we have chosen a 1,...,a and t 1,...,t so that all sx of the lsted statements are true for these elements. Fx the mnmal prmes P 1,...,P k (all necessarly of heght ) above B = (b 1,...,b ). Dvde them nto two sets: let P 1,...,P n be the ones that contan I, and let P n+1,...,p k be those that don t contan I. We frst change a +1 to an element a +1 a +1 modulo J 2 such that a +1 / k j=n+1 P j. Ths choce s possble because the nlradcal of J s
5 F-Ratonal Rngs and the Integral Closures of Ideals 7 the same as the nlradcal of I. Next choose M such that the heght of I +(J I M : I M+1 ) s at least + 1, and choose M to be the maxmum of the M. (Ths s possble by Lemma 3.1.) Ths choce forces all (J ti M : I M+t ) + I to be of heght at least + 1 for all t 0. For suppose that (J ti M : I M+t ) + I Q, where Q s a prme of heght at most. Snce I Q, ths forces (J I M : I M+1 ) Q, and after localzaton at Q we have (I M+1 ) Q = (J I M ) Q. But ths forces (I M+t ) Q = (J ti M ) Q for all ntegers t, and so (J ti M : I M+t ) Q, a contradcton. Usng prme avodance, choose t +1 w+l t=0 (J ti M : I M+t ) m N ( k j=n+1 P ) j and t +1 / ( n j=1 P ) ( j j Q j). Ths s possble because I s contaned n each of the prmes n the second lne and all these prmes have heght, whle the heght of I +(J ti M : I M+t ) s at least +1. We set b +1 = a +1 + t +1. We clam ths choce proves (1) (6) for these new elements. Our choce of a +1 and t +1 make statements (1), (2), (5), and (6) trval. To prove (3) we need only prove b +1 / k j=1 P j. If j n, then a +1 I P j whle t +1 / P j. Hence b +1 / P j. If j n + 1, then a +1 / P j whle t +1 P j. Agan b +1 / P j, provng (3). Statement (4) follows from (3). Clearly the heght of (I, b g+1,...,b +1 ) s at least that of b 1,...,b +1 and hence at least + 1. But (I, b g+1,...,b +1 ) = (I, t g+1,...,t +1 ). Snce R s equdmensonal and catenary, t follows that the mages of the t j n R/I form parameters. Theorem 3.3. Let (R, m) be an equdmensonal and catenary local rng of characterstc p havng nfnte resdue feld. Let I be an deal of analytc spread l and postve heght g. Let J be a mnmal reducton of I. Fx w, N 0. Choose a and t as n Proposton 3.2. Set A = B l = (b 1,...,b g,...,b l ). Then I l+w (A w+1 ). Proof. Our choce of elements means that a 1,...,a g,a g+1 + t g+1,...,a +1 + t +1 s part of a system of parameters. Fx the notaton as n Proposton 3.2. By our choce of the t j we have that t j I M+k Jj 1 k I M for all 1 k w + l. We frst clam that ths mples tj n I M+nk Jj 1 nk I M for all n 1. Assume ths s true for a fxed n, and multply by t j I k. We obtan that (t j I k )(tj ni M+nk ) (t j I k )Jj 1 nk I M. Snce t j I M+k Jj 1 k I M, we now have t n+1 j I M+(n+1)k Jj 1 nk J j 1 k I M as requred. Fx c I M R o. Note that the above contanment shows that, for all n 1, ct n+1 j I (n+1)k J (n+1)k j 1. (3.4) Set B = (b 1,...,b ). Let g l and w r 0. We show by nducton that c g J (+r)q (B r+1 ) [q]. The base case s when = g and r w s arbtrary.
6 8 Ian M. Aberbach & Crag Huneke In ths case J g (g+r)q (Jg r+1 ) [q] = (Bg r+1 ) [q]. The frst ncluson n the above lne follows at once from [HH1, proof of (5.4)]. Assume now that we are gven r and >gand that the clam s true ether for <(wth r w arbtrary) or for = (wth r <r w). By our choce of c and of the t j, c g J (+r)q c g J [q] J (+r 1)q c g [J g [q] J (+r 1)q + a q g+1 J (+r 1)q + +a q J (+r 1)q ] = c g 1 [cj g [q] J (+r 1)q + ca q g+1 J (+r 1)q + +ca q J (+r 1)q ]. Consder a typcal term n ths sum, ca q j J (+r 1)q, where g + 1 j. Snce b j = a j + t j, we can wrte ths term as ca q j J (+r 1)q = cb q j J (+r 1)q ct q j J (+r 1)q. Usng (3.4) (note + r 1 w + l), we obtan and so c g J (+r)q ca q j J (+r 1)q cb q j J (+r 1)q + J (+r 1)q j 1 c g 1 [cj g [q] J (+r 1)q + (cb q g+1 J (+r 1)q + J g (+r 1)q ) + +(cb q J (+r 1)q whch by the nducton hypothess s contaned n + J (+r 1)q 1 )], J g [q] (B r )[q] + b q g+1 (B r )[q] + (B r+ g b ) [q] + +b q (B r )[q] + (B r+1 1 )[q] (B r+1 ) [q]. In partcular, note that c l g J (l+r)q l (B r+1 l ) [q] (3.5) for all r w. We now prove that I l+w (A w+1 ). Let u I l+w. Choose an element d R o such that du q J (l+w)q. Then c l g du q c l g J (l+w)q (B w+1 l ) [q] by (3.5). It follows that u (B w+1 l ) = (A w+1 ). Remark. Theorem 3.3 s stll vald even f ht(i ) = 0. In ths case, choose c 1 I M and c 2 n the ntersecton of the mnmal prmes of 0 that do not contan I and avodng those that do contan I. Thus c 2 I N = 0 for N 0 and c = c 1 + c 2 R o satsfes equaton (3.4). An almost mmedate consequence s one of our man theorems. Theorem 3.6. Let (R, m) be an F-ratonal local rng of postve characterstc p, and let I R be an deal generated by l elements. Then I l+w I w+1 for all w 0.
7 F-Ratonal Rngs and the Integral Closures of Ideals 9 Proof. There s no loss of generalty n assumng that R has an nfnte resdue feld. We can replace I by a mnmal reducton of tself; suppose that J s that mnmal reducton. The number of generators of J s at most l, so wthout loss of generalty we may assume l s the number of generators of J. Fx an nteger N. We thnk of w as fxed and choose t g+1,...,t l and a 1,...,a l as n Proposton 3.2. In partcular, t m N for all. By (3.3), I l+w (A w+1 ) = A w+1 J w+1 + (t h+1,...,t l ) J w+1 + m N. The equalty (A w+1 ) = A w+1 above follows from [A, Thm. 1.1]. By the Krull ntersecton theorem we obtan that I l+w N (J w+1 + m N ) = J w+1. Ths characterstc-p theorem allows us to prove the same result n equcharacterstc 0. Theorem 3.7. Let R be an algebra of fnte type over a feld of characterstc 0 and havng only ratonal sngulartes. Let I R be an deal generated by l elements. Then I l+w I w+1 for all w 0. Proof. By the work of both Hara [Ha] and Mehta and Srnvas [MS], R s of F-ratonal type. It s straghtforward to prove n ths case that, f the concluson holds n a dense open set of fbers n some famly of models A R A of R, t also holds n R. Hence we may pass to postve characterstc and assume that R s fntely generated over a feld of characterstc p>0 such that R P s F-ratonal for all prmes P. The concluson wll follow f we prove t locally, snce the number of generators can only drop after localzaton. It follows that we can reduce to the local F-ratonal case and apply Theorem 3.6 to fnsh the proof. 4. F-Ratonal Gorensten Rngs Our next theorem s new, even for R regular, as far as we know. The proof s based on a careful analyss of the proof of Theorem 3.5 together wth the deas behnd the cancellaton theorem of [Hu1] (see also [CP] for further cancellaton results). Our man theorem apples to rngs that are F-ratonal and Gorensten. It s known [HH2, (3.4), (4.7)] that F-ratonal and F-regular are the same when the base rng s Gorensten. A rng R s F-regular f every deal s tghtly closed n every localzaton of R. Of course, all regular rngs are F-regular, but the class of F-regular rngs s consderably broader than that of regular rngs. Theorem 4.1. Let (R, m) be an F-ratonal Gorensten local rng of dmenson d and havng postve characterstc. Suppose that I s an deal of heght g and analytc spread l > gwth R/I Cohen Macaulay. Then, for any reducton J of I, I l 1 J. Proof. There s no loss of generalty n assumng that R has an nfnte resdue feld and that J s a mnmal reducton. Fx an nteger N and set w = 0 n the notaton of Proposton 3.2 and Theorem 3.3. We wll prove that I l 1 J + m N. An applcaton of the Krull ntersecton theorem then fnshes the proof.
8 10 Ian M. Aberbach & Crag Huneke We choose t g+1,...,t l and a 1,...,a l as n Proposton 3.2, wth N fxed as before. Let b = a +t for 1 l. Choose x = x l+1,...,x d so that b g+1,...,b l,x s a regular sequence on R/I and set A = (b 1,...,b l, x). We set D = J g : t g+1 and K = (J g,b g+2,...,b l, x). Let Q = (I, b g+2,...,b l, x) + K : D. We clam that A : t g+1 Q. Suppose that t g+1 u = w + vb g+1, (4.2) where w K. Then t g+1 (u v) (J g+1,b g+2,...,b l, x) and hence u v (J g+1,b g+2,...,b l, x) : b g+1 (I, b g+2,...,b l, x) : b g+1 (I, b g+2,...,b l, x) snce R/I s Cohen Macaulay. Hence u v Q and to prove u Q t suffces to show that v K : D. Let d D and consder dv. Usng (4.2), we obtan that t g+1 du = dw + dvb g+1 and hence dvb g+1 (J g,b g+2,...,b l, x). Thus Dv (J g,b g+2,...,b l, x) : b g+1 = (J g,b g+2,...,b l, x) = K. Ths proves our clam and n partcular proves that A : Q A : (A : t g+1 ). We next clam that I l 1 A : Q. Frst observe that (I, b g+2,...,b l, x) I l 1 I I l 1 + A and, by Theorem 2.6, I I l 1 A (usng that R s F-ratonal). Hence t remans only to prove that I l 1 (K : D) A. We use a lemma. Lemma 4.3. Wth the same notaton as before, t g+1 I l 1 J g. Proof. Let z I l 1 and choose an element d R o such that dz n I n(l 1) for all n. Choose c I M nonzero as n (3.4). Usng (3.4), we then obtan dct q g+1 zq ct q g+1 I q(l 1) t q g+1 I q(l 1)+M J q(l 1) g J [q] g, where the last contanment follows because l 1 g and J g has g generators. Hence t g+1 z (J g ). Snce R s F-ratonal, t g+1 z J g, provng the lemma. Lemma 4.3 proves that I l 1 D. Hence I l 1 ((J g,b g+2,...,b l, x) : D) A. We have proved that I l 1 A : Q. By local dualty, we have I l 1 A : Q A : (A : t g+1 ) (J g+1,t g+1, b g+2,...,b l, x) (J, t g+1,...,t l, x) J + m N. Acknowledgment. The authors thank Renhold Hübl for valuable correctons n our orgnal preprnt. References [A] I. M. Aberbach, Tght closure n F-ratonal rngs, Nagoya Math. J. 135 (1994), [AH1] I. M. Aberbach and C. Huneke, An mproved Brançon Skoda theorem wth applcatons to the Cohen Macaulayness of Rees algebras, Math. Ann. 297 (1993),
9 F-Ratonal Rngs and the Integral Closures of Ideals 11 [AH2], A theorem of Brançon Skoda type for regular local rngs contanng a feld, Proc. Amer. Math. Soc. 124 (1996), [AHT] I. M. Aberbach, C. Huneke, and N. V. Trung, Reducton numbers, Brançon Skoda theorems and the depth of Rees rngs, Composto Math. 97 (1995), [BrS] J. Brançon and H. Skoda, Sur la clôture ntégrale d un déal de germes de fonctons holomorphes en un pont de C n, C. R. Acad. Sc. Pars Sér. I Math. 278 (1974), [BH] W. Bruns and J. Herzog, Cohen Macaulay rngs, Cambrdge Stud. Adv. Math., 39, Cambrdge Unv. Press, Cambrdge, U.K., [CP] A. Corso and C. Poln, A note on resdually S 2 deals and projectve dmenson one modules, Proc. Amer. Math. Soc. 129 (2001), [FW] R. Fedder and K. Watanabe, A characterzaton of F-regularty n terms of F-purty, Commutatve algebra (Berkeley, CA, 1987), pp , Math. Sc. Res. Inst. Publ., 15, Sprnger-Verlag, New York, [Ha] N. Hara, A characterzaton of ratonal sngulartes n terms of njectvty of Frobenus maps, Amer. J. Math. 120 (1998), [HH1] M. Hochster and C. Huneke, Tght closure, nvarant theory, and the Brançon Skoda theorem, J. Amer. Math. Soc. 3 (1990), [HH2], F-regularty, test elements, and smooth base change, Trans. Amer. Math. Soc. 346 (1994), [HH3], Tght closure n equal characterstc zero, preprnt, lsa.umch.edu/ hochster/ms.html. [Hu1] C. Huneke, A cancellaton theorem for deals, J. Pure Appl. Alg. 152 (2000), [Hu2], Tght closure and ts applcatons, CBMS Regonal Conf. Ser. n Math., 88, Amer. Math. Soc., Provdence, RI, [HyV] E. Hyry and O. Vllamayor, A Brançon Skoda theorem for solated sngulartes, J. Algebra 204 (1998), [L] J. Lpman, Adjonts of deals n regular local rngs, Math. Res. Lett. 1 (1994), [LS] J. Lpman and A. Sathaye, Jacoban deals and a theorem of Brançon Skoda, Mchgan Math. J. 28 (1981), [LT] J. Lpman and B. Tesser, Pseudoratonal local rngs and a theorem of Brançon Skoda about ntegral closures of deals, Mchgan Math. J. 28 (1981), [MS] V. B. Mehta and V. Srnvas, A characterzaton of ratonal sngulartes, Asan J. Math. 1 (1997), [Sm] K. Smth, F-ratonal rngs have ratonal sngulartes, Amer. J. Math. 119 (1997), I. M. Aberbach C. Huneke Department of Mathematcs Department of Mathematcs Unversty of Mssour Unversty of Kansas Columba, MO Lawrence, KS aberbach@math.mssour.edu huneke@math.ukans.edu
We are now ready to answer the question: What are the possible cardinalities for finite fields?
Chapter 3 Fnte felds We have seen, n the prevous chapters, some examples of fnte felds. For example, the resdue class rng Z/pZ (when p s a prme) forms a feld wth p elements whch may be dentfed wth the
More informationn + d + q = 24 and.05n +.1d +.25q = 2 { n + d + q = 24 (3) n + 2d + 5q = 40 (2)
MATH 16T Exam 1 : Part I (In-Class) Solutons 1. (0 pts) A pggy bank contans 4 cons, all of whch are nckels (5 ), dmes (10 ) or quarters (5 ). The pggy bank also contans a con of each denomnaton. The total
More information1 Example 1: Axis-aligned rectangles
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton
More informationLuby s Alg. for Maximal Independent Sets using Pairwise Independence
Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent
More informationRecurrence. 1 Definitions and main statements
Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.
More information8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by
6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng
More informationGeneralizing the degree sequence problem
Mddlebury College March 2009 Arzona State Unversty Dscrete Mathematcs Semnar The degree sequence problem Problem: Gven an nteger sequence d = (d 1,...,d n ) determne f there exsts a graph G wth d as ts
More informationA Probabilistic Theory of Coherence
A Probablstc Theory of Coherence BRANDEN FITELSON. The Coherence Measure C Let E be a set of n propostons E,..., E n. We seek a probablstc measure C(E) of the degree of coherence of E. Intutvely, we want
More informationOn Lockett pairs and Lockett conjecture for π-soluble Fitting classes
On Lockett pars and Lockett conjecture for π-soluble Fttng classes Lujn Zhu Department of Mathematcs, Yangzhou Unversty, Yangzhou 225002, P.R. Chna E-mal: ljzhu@yzu.edu.cn Nanyng Yang School of Mathematcs
More informationEmbedding lattices in the Kleene degrees
F U N D A M E N T A MATHEMATICAE 62 (999) Embeddng lattces n the Kleene degrees by Hsato M u r a k (Nagoya) Abstract. Under ZFC+CH, we prove that some lattces whose cardnaltes do not exceed ℵ can be embedded
More informationREGULAR MULTILINEAR OPERATORS ON C(K) SPACES
REGULAR MULTILINEAR OPERATORS ON C(K) SPACES FERNANDO BOMBAL AND IGNACIO VILLANUEVA Abstract. The purpose of ths paper s to characterze the class of regular contnuous multlnear operators on a product of
More informationSeries Solutions of ODEs 2 the Frobenius method. The basic idea of the Frobenius method is to look for solutions of the form 3
Royal Holloway Unversty of London Department of Physs Seres Solutons of ODEs the Frobenus method Introduton to the Methodology The smple seres expanson method works for dfferental equatons whose solutons
More informationExtending Probabilistic Dynamic Epistemic Logic
Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set
More informationv a 1 b 1 i, a 2 b 2 i,..., a n b n i.
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are
More informationWhat is Candidate Sampling
What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble
More informationSupport Vector Machines
Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.
More informationThe OC Curve of Attribute Acceptance Plans
The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4
More informationBERNSTEIN POLYNOMIALS
On-Lne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful
More informationRing structure of splines on triangulations
www.oeaw.ac.at Rng structure of splnes on trangulatons N. Vllamzar RICAM-Report 2014-48 www.rcam.oeaw.ac.at RING STRUCTURE OF SPLINES ON TRIANGULATIONS NELLY VILLAMIZAR Introducton For a trangulated regon
More information+ + + - - This circuit than can be reduced to a planar circuit
MeshCurrent Method The meshcurrent s analog of the nodeoltage method. We sole for a new set of arables, mesh currents, that automatcally satsfy KCLs. As such, meshcurrent method reduces crcut soluton to
More informationPERRON FROBENIUS THEOREM
PERRON FROBENIUS THEOREM R. CLARK ROBINSON Defnton. A n n matrx M wth real entres m, s called a stochastc matrx provded () all the entres m satsfy 0 m, () each of the columns sum to one, m = for all, ()
More informationINTERPRETING TRUE ARITHMETIC IN THE LOCAL STRUCTURE OF THE ENUMERATION DEGREES.
INTERPRETING TRUE ARITHMETIC IN THE LOCAL STRUCTURE OF THE ENUMERATION DEGREES. HRISTO GANCHEV AND MARIYA SOSKOVA 1. Introducton Degree theory studes mathematcal structures, whch arse from a formal noton
More informationLecture 3: Force of Interest, Real Interest Rate, Annuity
Lecture 3: Force of Interest, Real Interest Rate, Annuty Goals: Study contnuous compoundng and force of nterest Dscuss real nterest rate Learn annuty-mmedate, and ts present value Study annuty-due, and
More informationNonbinary Quantum Error-Correcting Codes from Algebraic Curves
Nonbnary Quantum Error-Correctng Codes from Algebrac Curves Jon-Lark Km and Judy Walker Department of Mathematcs Unversty of Nebraska-Lncoln, Lncoln, NE 68588-0130 USA e-mal: {jlkm, jwalker}@math.unl.edu
More informationModule 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..
More informationbenefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).
REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or
More informationNON-CONSTANT SUM RED-AND-BLACK GAMES WITH BET-DEPENDENT WIN PROBABILITY FUNCTION LAURA PONTIGGIA, University of the Sciences in Philadelphia
To appear n Journal o Appled Probablty June 2007 O-COSTAT SUM RED-AD-BLACK GAMES WITH BET-DEPEDET WI PROBABILITY FUCTIO LAURA POTIGGIA, Unversty o the Scences n Phladelpha Abstract In ths paper we nvestgate
More informationLecture 3: Annuity. Study annuities whose payments form a geometric progression or a arithmetic progression.
Lecture 3: Annuty Goals: Learn contnuous annuty and perpetuty. Study annutes whose payments form a geometrc progresson or a arthmetc progresson. Dscuss yeld rates. Introduce Amortzaton Suggested Textbook
More information7.5. Present Value of an Annuity. Investigate
7.5 Present Value of an Annuty Owen and Anna are approachng retrement and are puttng ther fnances n order. They have worked hard and nvested ther earnngs so that they now have a large amount of money on
More informationThe Greedy Method. Introduction. 0/1 Knapsack Problem
The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton
More informationSection 5.4 Annuities, Present Value, and Amortization
Secton 5.4 Annutes, Present Value, and Amortzaton Present Value In Secton 5.2, we saw that the present value of A dollars at nterest rate per perod for n perods s the amount that must be deposted today
More informationThe descriptive complexity of the family of Banach spaces with the π-property
Arab. J. Math. (2015) 4:35 39 DOI 10.1007/s40065-014-0116-3 Araban Journal of Mathematcs Ghadeer Ghawadrah The descrptve complexty of the famly of Banach spaces wth the π-property Receved: 25 March 2014
More informationUsing Series to Analyze Financial Situations: Present Value
2.8 Usng Seres to Analyze Fnancal Stuatons: Present Value In the prevous secton, you learned how to calculate the amount, or future value, of an ordnary smple annuty. The amount s the sum of the accumulated
More informationAn Alternative Way to Measure Private Equity Performance
An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate
More informationDEFINING %COMPLETE IN MICROSOFT PROJECT
CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,
More informationFINITE HILBERT STABILITY OF (BI)CANONICAL CURVES
FINITE HILBERT STABILITY OF (BICANONICAL CURVES JAROD ALPER, MAKSYM FEDORCHUK, AND DAVID ISHII SMYTH* To Joe Harrs on hs sxteth brthday Abstract. We prove that a generc canoncally or bcanoncally embedded
More informationwhere the coordinates are related to those in the old frame as follows.
Chapter 2 - Cartesan Vectors and Tensors: Ther Algebra Defnton of a vector Examples of vectors Scalar multplcaton Addton of vectors coplanar vectors Unt vectors A bass of non-coplanar vectors Scalar product
More informationHow Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence
1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh
More informationHow To Assemble The Tangent Spaces Of A Manfold Nto A Coherent Whole
CHAPTER 7 VECTOR BUNDLES We next begn addressng the queston: how do we assemble the tangent spaces at varous ponts of a manfold nto a coherent whole? In order to gude the decson, consder the case of U
More informationProject Networks With Mixed-Time Constraints
Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa
More informationThe Noether Theorems: from Noether to Ševera
14th Internatonal Summer School n Global Analyss and Mathematcal Physcs Satellte Meetng of the XVI Internatonal Congress on Mathematcal Physcs *** Lectures of Yvette Kosmann-Schwarzbach Centre de Mathématques
More informationPSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12
14 The Ch-squared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed
More informationSimple Interest Loans (Section 5.1) :
Chapter 5 Fnance The frst part of ths revew wll explan the dfferent nterest and nvestment equatons you learned n secton 5.1 through 5.4 of your textbook and go through several examples. The second part
More informationCalculation of Sampling Weights
Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a two-stage stratfed cluster desgn. 1 The frst stage conssted of a sample
More informationNatural hp-bem for the electric field integral equation with singular solutions
Natural hp-bem for the electrc feld ntegral equaton wth sngular solutons Alexe Bespalov Norbert Heuer Abstract We apply the hp-verson of the boundary element method (BEM) for the numercal soluton of the
More informationChapter 6 Inductance, Capacitance, and Mutual Inductance
Chapter 6 Inductance Capactance and Mutual Inductance 6. The nductor 6. The capactor 6.3 Seres-parallel combnatons of nductance and capactance 6.4 Mutual nductance 6.5 Closer look at mutual nductance Oerew
More informationTHE HIT PROBLEM FOR THE DICKSON ALGEBRA
TRNSCTIONS OF THE MERICN MTHEMTICL SOCIETY Volume 353 Number 12 Pages 5029 5040 S 0002-9947(01)02705-2 rtcle electroncally publshed on May 22 2001 THE HIT PROBLEM FOR THE DICKSON LGEBR NGUY ÊN H. V. HUNG
More information8 Algorithm for Binary Searching in Trees
8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the
More informationTHE METHOD OF LEAST SQUARES THE METHOD OF LEAST SQUARES
The goal: to measure (determne) an unknown quantty x (the value of a RV X) Realsaton: n results: y 1, y 2,..., y j,..., y n, (the measured values of Y 1, Y 2,..., Y j,..., Y n ) every result s encumbered
More informationBasic Queueing Theory M/M/* Queues. Introduction
Basc Queueng Theory M/M/* Queues These sldes are created by Dr. Yh Huang of George Mason Unversty. Students regstered n Dr. Huang's courses at GMU can ake a sngle achne-readable copy and prnt a sngle copy
More information1. Measuring association using correlation and regression
How to measure assocaton I: Correlaton. 1. Measurng assocaton usng correlaton and regresson We often would lke to know how one varable, such as a mother's weght, s related to another varable, such as a
More informationQuantization Effects in Digital Filters
Quantzaton Effects n Dgtal Flters Dstrbuton of Truncaton Errors In two's complement representaton an exact number would have nfntely many bts (n general). When we lmt the number of bts to some fnte value
More informationSPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background:
SPEE Recommended Evaluaton Practce #6 efnton of eclne Curve Parameters Background: The producton hstores of ol and gas wells can be analyzed to estmate reserves and future ol and gas producton rates and
More informationLecture 2: Single Layer Perceptrons Kevin Swingler
Lecture 2: Sngle Layer Perceptrons Kevn Sngler kms@cs.str.ac.uk Recap: McCulloch-Ptts Neuron Ths vastly smplfed model of real neurons s also knon as a Threshold Logc Unt: W 2 A Y 3 n W n. A set of synapses
More informationUpper Bounds on the Cross-Sectional Volumes of Cubes and Other Problems
Upper Bounds on the Cross-Sectonal Volumes of Cubes and Other Problems Ben Pooley March 01 1 Contents 1 Prelmnares 1 11 Introducton 1 1 Basc Concepts and Notaton Cross-Sectonal Volumes of Cubes (Hyperplane
More informationLECTURE 1: MOTIVATION
LECTURE 1: MOTIVATION STEVEN SAM AND PETER TINGLEY 1. Towards quantum groups Let us begn by dscussng what quantum groups are, and why we mght want to study them. We wll start wth the related classcal objects.
More informationA Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression
Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy S-curve Regresson Cheng-Wu Chen, Morrs H. L. Wang and Tng-Ya Hseh Department of Cvl Engneerng, Natonal Central Unversty,
More informationProblem Set 3. a) We are asked how people will react, if the interest rate i on bonds is negative.
Queston roblem Set 3 a) We are asked how people wll react, f the nterest rate on bonds s negatve. When
More informationThe Mathematical Derivation of Least Squares
Pscholog 885 Prof. Federco The Mathematcal Dervaton of Least Squares Back when the powers that e forced ou to learn matr algera and calculus, I et ou all asked ourself the age-old queston: When the hell
More informationIn our example i = r/12 =.0825/12 At the end of the first month after your payment is received your amount in the account, the balance, is
Payout annutes: Start wth P dollars, e.g., P = 100, 000. Over a 30 year perod you receve equal payments of A dollars at the end of each month. The amount of money left n the account, the balance, earns
More informationProduction. 2. Y is closed A set is closed if it contains its boundary. We need this for the solution existence in the profit maximization problem.
Producer Theory Producton ASSUMPTION 2.1 Propertes of the Producton Set The producton set Y satsfes the followng propertes 1. Y s non-empty If Y s empty, we have nothng to talk about 2. Y s closed A set
More informationTexas Instruments 30X IIS Calculator
Texas Instruments 30X IIS Calculator Keystrokes for the TI-30X IIS are shown for a few topcs n whch keystrokes are unque. Start by readng the Quk Start secton. Then, before begnnng a specfc unt of the
More informationHow To Understand The Results Of The German Meris Cloud And Water Vapour Product
Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPP-ATBD-ClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller
More informationLevel Annuities with Payments Less Frequent than Each Interest Period
Level Annutes wth Payments Less Frequent than Each Interest Perod 1 Annuty-mmedate 2 Annuty-due Level Annutes wth Payments Less Frequent than Each Interest Perod 1 Annuty-mmedate 2 Annuty-due Symoblc approach
More informationLogical Development Of Vogel s Approximation Method (LD-VAM): An Approach To Find Basic Feasible Solution Of Transportation Problem
INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME, ISSUE, FEBRUARY ISSN 77-866 Logcal Development Of Vogel s Approxmaton Method (LD- An Approach To Fnd Basc Feasble Soluton Of Transportaton
More informationON CYCLOTOMIC POLYNOMIALS WITH ±1 COEFFICIENTS
ON CYCLOTOMIC POLYNOMIALS WITH ±1 COEFFICIENTS PETER BORWEIN AND KWOK-KWONG STEPHEN CHOI Abstract. We characterze all cyclotomc polynomals of even egree wth coeffcents restrcte to the set {+1, 1}. In ths
More informationTime Value of Money. Types of Interest. Compounding and Discounting Single Sums. Page 1. Ch. 6 - The Time Value of Money. The Time Value of Money
Ch. 6 - The Tme Value of Money Tme Value of Money The Interest Rate Smple Interest Compound Interest Amortzng a Loan FIN21- Ahmed Y, Dasht TIME VALUE OF MONEY OR DISCOUNTED CASH FLOW ANALYSIS Very Important
More information) of the Cell class is created containing information about events associated with the cell. Events are added to the Cell instance
Calbraton Method Instances of the Cell class (one nstance for each FMS cell) contan ADC raw data and methods assocated wth each partcular FMS cell. The calbraton method ncludes event selecton (Class Cell
More informationHow To Calculate The Accountng Perod Of Nequalty
Inequalty and The Accountng Perod Quentn Wodon and Shlomo Ytzha World Ban and Hebrew Unversty September Abstract Income nequalty typcally declnes wth the length of tme taen nto account for measurement.
More informationA Secure Password-Authenticated Key Agreement Using Smart Cards
A Secure Password-Authentcated Key Agreement Usng Smart Cards Ka Chan 1, Wen-Chung Kuo 2 and Jn-Chou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,
More informationCan Auto Liability Insurance Purchases Signal Risk Attitude?
Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159-164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? Chu-Shu L Department of Internatonal Busness, Asa Unversty, Tawan Sheng-Chang
More informationOn fourth order simultaneously zero-finding method for multiple roots of complex polynomial equations 1
General Mathematcs Vol. 6, No. 3 (2008), 9 3 On fourth order smultaneously zero-fndng method for multple roots of complex polynomal euatons Nazr Ahmad Mr and Khald Ayub Abstract In ths paper, we present
More informationAn Overview of Financial Mathematics
An Overvew of Fnancal Mathematcs Wllam Benedct McCartney July 2012 Abstract Ths document s meant to be a quck ntroducton to nterest theory. It s wrtten specfcally for actuaral students preparng to take
More informationStability, observer design and control of networks using Lyapunov methods
Stablty, observer desgn and control of networks usng Lyapunov methods von Lars Naujok Dssertaton zur Erlangung des Grades enes Doktors der Naturwssenschaften - Dr. rer. nat. - Vorgelegt m Fachberech 3
More informationFisher Markets and Convex Programs
Fsher Markets and Convex Programs Nkhl R. Devanur 1 Introducton Convex programmng dualty s usually stated n ts most general form, wth convex objectve functons and convex constrants. (The book by Boyd and
More informationProduct-Form Stationary Distributions for Deficiency Zero Chemical Reaction Networks
Bulletn of Mathematcal Bology (21 DOI 1.17/s11538-1-9517-4 ORIGINAL ARTICLE Product-Form Statonary Dstrbutons for Defcency Zero Chemcal Reacton Networks Davd F. Anderson, Gheorghe Cracun, Thomas G. Kurtz
More informationMultiple stage amplifiers
Multple stage amplfers Ams: Examne a few common 2-transstor amplfers: -- Dfferental amplfers -- Cascode amplfers -- Darlngton pars -- current mrrors Introduce formal methods for exactly analysng multple
More informationInstitute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic
Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange
More informationRisk-based Fatigue Estimate of Deep Water Risers -- Course Project for EM388F: Fracture Mechanics, Spring 2008
Rsk-based Fatgue Estmate of Deep Water Rsers -- Course Project for EM388F: Fracture Mechancs, Sprng 2008 Chen Sh Department of Cvl, Archtectural, and Envronmental Engneerng The Unversty of Texas at Austn
More informationMean Molecular Weight
Mean Molecular Weght The thermodynamc relatons between P, ρ, and T, as well as the calculaton of stellar opacty requres knowledge of the system s mean molecular weght defned as the mass per unt mole of
More informationThe Full-Wave Rectifier
9/3/2005 The Full Wae ectfer.doc /0 The Full-Wae ectfer Consder the followng juncton dode crcut: s (t) Power Lne s (t) 2 Note that we are usng a transformer n ths crcut. The job of ths transformer s to
More information= i δ δ s n and PV = a n = 1 v n = 1 e nδ
Exam 2 s Th March 19 You are allowe 7 sheets of notes an a calculator 41) An mportant fact about smple nterest s that for smple nterest A(t) = K[1+t], the amount of nterest earne each year s constant =
More informationDISTRIBUTED storage systems have been becoming increasingly
268 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 28, NO. 2, FEBRUARY 2010 Cooperatve Recovery of Dstrbuted Storage Systems from Multple Losses wth Network Codng Yuchong Hu, Ynlong Xu, Xaozhao
More informationJoe Pimbley, unpublished, 2005. Yield Curve Calculations
Joe Pmbley, unpublshed, 005. Yeld Curve Calculatons Background: Everythng s dscount factors Yeld curve calculatons nclude valuaton of forward rate agreements (FRAs), swaps, nterest rate optons, and forward
More informationFINANCIAL MATHEMATICS. A Practical Guide for Actuaries. and other Business Professionals
FINANCIAL MATHEMATICS A Practcal Gude for Actuares and other Busness Professonals Second Edton CHRIS RUCKMAN, FSA, MAAA JOE FRANCIS, FSA, MAAA, CFA Study Notes Prepared by Kevn Shand, FSA, FCIA Assstant
More informationSolution: Let i = 10% and d = 5%. By definition, the respective forces of interest on funds A and B are. i 1 + it. S A (t) = d (1 dt) 2 1. = d 1 dt.
Chapter 9 Revew problems 9.1 Interest rate measurement Example 9.1. Fund A accumulates at a smple nterest rate of 10%. Fund B accumulates at a smple dscount rate of 5%. Fnd the pont n tme at whch the forces
More informationOn the Optimal Control of a Cascade of Hydro-Electric Power Stations
On the Optmal Control of a Cascade of Hydro-Electrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;
More informationHollinger Canadian Publishing Holdings Co. ( HCPH ) proceeding under the Companies Creditors Arrangement Act ( CCAA )
February 17, 2011 Andrew J. Hatnay ahatnay@kmlaw.ca Dear Sr/Madam: Re: Re: Hollnger Canadan Publshng Holdngs Co. ( HCPH ) proceedng under the Companes Credtors Arrangement Act ( CCAA ) Update on CCAA Proceedngs
More informationLinear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits
Lnear Crcuts Analyss. Superposton, Theenn /Norton Equalent crcuts So far we hae explored tmendependent (resste) elements that are also lnear. A tmendependent elements s one for whch we can plot an / cure.
More informationAnswer: A). There is a flatter IS curve in the high MPC economy. Original LM LM after increase in M. IS curve for low MPC economy
4.02 Quz Solutons Fall 2004 Multple-Choce Questons (30/00 ponts) Please, crcle the correct answer for each of the followng 0 multple-choce questons. For each queston, only one of the answers s correct.
More informationHÜCKEL MOLECULAR ORBITAL THEORY
1 HÜCKEL MOLECULAR ORBITAL THEORY In general, the vast maorty polyatomc molecules can be thought of as consstng of a collecton of two electron bonds between pars of atoms. So the qualtatve pcture of σ
More informationLoop Parallelization
- - Loop Parallelzaton C-52 Complaton steps: nested loops operatng on arrays, sequentell executon of teraton space DECLARE B[..,..+] FOR I :=.. FOR J :=.. I B[I,J] := B[I-,J]+B[I-,J-] ED FOR ED FOR analyze
More informationA Lyapunov Optimization Approach to Repeated Stochastic Games
PROC. ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, OCT. 2013 1 A Lyapunov Optmzaton Approach to Repeated Stochastc Games Mchael J. Neely Unversty of Southern Calforna http://www-bcf.usc.edu/
More informationConversion between the vector and raster data structures using Fuzzy Geographical Entities
Converson between the vector and raster data structures usng Fuzzy Geographcal Enttes Cdála Fonte Department of Mathematcs Faculty of Scences and Technology Unversty of Combra, Apartado 38, 3 454 Combra,
More informationMatrix Multiplication I
Matrx Multplcaton I Yuval Flmus February 2, 2012 These notes are based on a lecture gven at the Toronto Student Semnar on February 2, 2012. The materal s taen mostly from the boo Algebrac Complexty Theory
More informationLaws of Electromagnetism
There are four laws of electromagnetsm: Laws of Electromagnetsm The law of Bot-Savart Ampere's law Force law Faraday's law magnetc feld generated by currents n wres the effect of a current on a loop of
More informationLeast Squares Fitting of Data
Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2016. All Rghts Reserved. Created: July 15, 1999 Last Modfed: January 5, 2015 Contents 1 Lnear Fttng
More informationFinite Math Chapter 10: Study Guide and Solution to Problems
Fnte Math Chapter 10: Study Gude and Soluton to Problems Basc Formulas and Concepts 10.1 Interest Basc Concepts Interest A fee a bank pays you for money you depost nto a savngs account. Prncpal P The amount
More informationSecure Network Coding Over the Integers
Secure Network Codng Over the Integers Rosaro Gennaro Jonathan Katz Hugo Krawczyk Tal Rabn Abstract Network codng has receved sgnfcant attenton n the networkng communty for ts potental to ncrease throughput
More informationIDENTIFICATION AND CORRECTION OF A COMMON ERROR IN GENERAL ANNUITY CALCULATIONS
IDENTIFICATION AND CORRECTION OF A COMMON ERROR IN GENERAL ANNUITY CALCULATIONS Chrs Deeley* Last revsed: September 22, 200 * Chrs Deeley s a Senor Lecturer n the School of Accountng, Charles Sturt Unversty,
More information