Order-Degree Curves for Hypergeometric Creative Telescoping

Size: px
Start display at page:

Download "Order-Degree Curves for Hypergeometric Creative Telescoping"

Transcription

1 Ode-Degee Cuves fo Hyegeometc Ceatve Telescong ABSTRACT Shaosh Chen Deatment of Mathematcs NCSU Ralegh, NC 7695, USA Ceatve telescong aled to a bvaate oe hyegeometc tem oduces lnea ecuence oeatos wth olynomal coeffcents, called telescoes We ovde bounds fo the degees of the olynomals aeang n these oeatos Ou bounds ae exessed as cuves n the (, d-lane whch assgn to evey ode a bound on the degee d of the telescoes These cuves ae hyebolas, whch eflect the henomenon that hghe ode telescoes tend to have lowe degee, and vce vesa Categoes and Subject Desctos I [Comutng Methodologes]: Symbolc and Algebac Manulaton Algothms Geneal Tems Algothms Keywods Symbolc Summaton, Ceatve Telescong, Degee Bounds INTRODUCTION We consde the oblem of fndng lnea ecuence equatons wth olynomal coeffcents satsfed by a gven defnte sngle sum ove a oe hyegeometc tem n two vaables Ths s one of the classcal oblems n symbolc summaton Zelbege [6] showed that such a ecuence always exsts, and oosed the algothm now named afte hm fo comutng one [5, 7] Also exlct bounds ae known fo the ode of the ecuence satsfed by a gven sum [4, 0, 4] Lttle s known howeve about the degees Suoted by the Natonal Scence Foundaton (NFS gant CCF-077 Suoted by the Austan Scence Fund (FWF gant Y464-N8 Pemsson to make dgtal o had coes of all o at of ths wok fo esonal o classoom use s ganted wthout fee ovded that coes ae not made o dstbuted fo oft o commecal advantage and that coes bea ths notce and the full ctaton on the fst age To coy othewse, to eublsh, to ost on seves o to edstbute to lsts, eques o secfc emsson and/o a fee Coyght 0XX ACM X-XXXXX-XX-X/XX/XX $000 Manuel Kaues RISC Johannes Kele Unvesty 4040 Lnz, Austa mkaues@scjkuat of the olynomals aeang n the ecuence These ae nvestgated n the esent ae Ideally, we would lke to be able to detemne fo a gven sum all the as (, d such that the sum satsfes a lnea ecuence of ode wth olynomal coeffcents of degee at most d Ths s a had queston whch we do not exect to have a smle answe The esults gven below can be vewed as answes to smlfed vaants of the oblem One smlfcaton s that we estct the attenton to the ecuences found by ceatve telescong [7], called telescoes n the symbolc summaton communty (see Secton below fo a defnton The second smlfcaton s that nstead of tyng to chaacteze all the as (, d, we confne ouselves wth suffcent condtons Ou man esults ae thus fomulas whch ovde bounds on the degee d of the olynomal coeffcents n a telescoe, deendng on ts ode The fomulas descbe cuves n the (, d-lane wth the oety that fo evey ntege ont (, d above the cuve, thee s a telescoe of ode wth olynomal coeffcents of degee at most d As the cuves ae hyebolas, they eflect the henomenon that hghe ode ecuence equatons may have lowe degee coeffcents Ths featue can be used to deve a comlexty estmate accodng to whch, at least n theoy, comutng the mnmum ode ecuence s moe exensve than comutng a ecuence wth slghtly hghe ode (but dastcally smalle olynomal coeffcents Ths henomenon s analogous to the stuaton n the dffeental case, whch was fst analyzed by Bostan et al [5] fo algebac functons, and ecently fo ntegals of hyeexonental tems by the authos [6] Ou analyss fo non-atonal oe hyegeometc nut (Secton 3 follows closely ou analyss fo the dffeental case [6] It tuns out that the summaton case consdeed hee s slghtly ease than the dffeental case n that t eques fewe cases to dstngush and n that the esultng degee estmaton fomula s much smle than ts dffeental analogue Fo atonal nut (Secton 4, we deve a degee estmaton fomula followng Le s algothm fo comutng telescoes of atonal functons [, 9] PROPER HYPERGEOMETRIC TERMS AND CREATIVE TELESCOPING Let K be a feld of chaactestc zeo and let K(n, k be the feld of atonal functons n n and k We wll be consdeng extenson felds E of K(n, k on whch two somohsms S n and S k ae defned whch commute wth each

2 othe, leave evey element of K fxed, and act on n and k va S n(n = n +, S k (n = n, S n(k = k, S k (k = k + A hyegeometc tem s an element h of such an extenson feld E wth S n(h/h K(n, k and S k (h/h K(n, k Poe hyegeometc tems ae hyegeometc tems whch can be wtten n the fom M h = x n y k Γ(a mn + a mk + a mγ(b mn b mk + b m Γ(u mn + u mk + u mγ(v mn v mk + v m, ( whee K[n, k], x, y K, M N s fxed, a m, a m, b m, b m, u m, u m, v m, v m ae nonnegatve nteges, a m, b m, u m, v m K and the exessons x n, y k, and Γ( efe to elements of E on whch S n and S k act as suggested by the notaton, eg, S n(γ(n k + = (n k+(n k+γ(n k +, S k (Γ(n k + = Γ(n k + n k Thoughout the ae the symbols, x, y, M, a m, a m, a m, wll be used wth the meanng they have n ( Fo fttng long fomulas nto the naow columns of ths layout, we also use the abbevatons A m := a mn + a mk + a m, B m := b mn + b mk + b m, U m := u mn + u mk + u m, V m := v mn + v mk + v m We follow the aadgm of ceatve telescong Fo a gven hyegeometc tem h as above, we want to detemne olynomals l 0,, l K[n] (fee of k, not all zeo, and a atonal functon C K(n, k (ossbly nvolvng k, ossbly zeo, such that l 0h + l S n(h + + l S n(h = S k (Ch Ch In ths case, the oeato L := l 0 + l S n + + l Sn K[n][S n] s called a telescoe fo h, and the atonal functon C K(n, k s called a cetfcate fo L (and h The numbe s called the ode of L, and d := max deg n l s called ts degee If h eesents an actual sequence f(n, k, then a ecuence fo the defnte sum n k=0 f(n, k can be obtaned fom such a a (L, C as exlaned n the lteatue on symbolc summaton [] We shall not embak on the techncal subtletes of ths coesondence hee but estct ouselves to analyzng of the set of all as (, d fo whch thee exsts a telescoe of ode and degee d The followng notaton wll be used Fo K[n, k] and m N, let m := ( + ( + ( + m wth the conventons 0 = and = Fo K[n, k], deg n and deg k denote the degee of wth esect to n o k, esectvely deg wthout any subsct denotes the total degee of Fo z R, let z + := max{0, z} Wth ths notaton, we have S n(h h S k (h h = x Sn( = y S k( A am m Bm bm U um m V vm m A a m m (V m v m v m U u m m (B m b m b m, 3 THE NON-RATIONAL CASE We consde n ths secton the case whee h cannot be slt nto h = qh 0 fo q K(n, k and anothe hyegeometc tem h 0 wth S k (h 0/h 0 = Infomally, ths means that we exclude tems h whee y = and evey Γ-tem nvolvng k can be cancelled aganst anothe one to some atonal functon Those tems ae teated seaately n Secton 4 below If h cannot be slt as ndcated, then also Ch cannot be slt n ths way, fo any atonal functon C K(n, k In atcula, we can then not have Ch K and theefoe we always have S k (Ch Ch 0 Ths mles that wheneve we have a a (L, C wth L(h = S k (Ch Ch, we can be sue that L s not the zeo oeato, and we need not woy about ths equement any futhe The analyss n the esent case s smla to that caed out by Aagodu and Zelbege [0], who used t fo devng a bound on the ode of L, and smla to ou analyss [6] of the dffeental case The man dea s to follow ste by ste the executon of Zelbege s algothm when aled to h Ths eventually leads to a lnea system of equatons wth coeffcents n K(n whch must have a soluton wheneve t s undedetemned The condton of havng moe vaables than equatons n ths lnea system s the souce of the estmate fo choces (, d that lead to a soluton 3 Zelbege s Algothm Recall the man stes of Zelbege s algothm: fo some choce of, t makes an ansatz L = l 0+l S n+ +l S n wth undetemned coeffcents l 0,, l, and then calls Gose s algothm on L(h Gose s algothm [7] oceeds by wtng S k (L(h L(h = S k(p P Q S k (R fo some olynomals P, Q, R such that gcd(q, S k(r = fo all N It tuns out that the undetemned coeffcents l 0,, l aea lnealy n P and not at all n Q o R Next, the algothm seaches fo a olynomal soluton Y of the Gose equaton P = Q S k (Y R Y by makng an ansatz Y = y 0 + y k + y k + + y sk s fo some sutably chosen degee s, substtutng the ansatz nto the equaton, and comang owes of k on both sdes Ths leads to a lnea system n the vaables l 0,, l, y 0,, y s wth coeffcents n K(n Any soluton of ths system gves se to a telescoe L wth the coesondng cetfcate C = RY/P If no soluton exsts, the ocedue s eeated wth a geate value of Fo a hyegeometc tem h and an oeato L = l 0 + l S n + + l S n, we have L(h = = l x S n( l x Sn( Um um Vm vm A am m Bm bm U um m P,m h V vm m ( = l x Sn( P,m h

3 whee x n y k M Γ(A mγ(b m Γ(U m + u mγ(v m + v m, P,m = A am m Bm bm (U m + u m ( um (V m + v m ( vm We can wte whee P = Q = y R = S k (L(h L(h = S k(p P l x Sn( Q S k (R, P,m, A a m m (V m + v m v m v m, (U m + u m u m u m B b m m Deendng on the actual values of the coeffcents aeang n h, ths decomoston may o may not satsfy the equement gcd(q, Sk(R = fo all N But even f t does not, t only means that we may ovelook some solutons, but evey soluton we fnd stll gves se to a coect telescoe and cetfcate Snce we ae nteested only n boundng the sze of the telescoes of h, t s suffcent to study unde whch ccumstances the Gose equaton P = Q S k (Y R Y wth the above choce of P, Q, R has a soluton 3 Countng Vaables and Equatons Aagodu and Zelbege [0] oceed fom hee by analyzng the lnea system ove K(n esultng fom the Gose equaton fo a sutable choce of the degee of Y They deve a bound on but gve no nfomaton on the degee d Geneal bounds fo the degees of solutons of lnea systems wth olynomal coeffcents could be aled, but they tun out to oveshoot qute much In atcula, t seems dffcult to catue the henomenon that nceasng may allow fo deceasng d usng such geneal bounds We oceed dffeently Instead of a coeffcent comason wth esect to owes of k leadng to a lnea system ove K(n, we consde a coeffcent comason wth esect to owes of n and k leadng to a lnea system ove K Ths eques us to make a choce not only fo the degee of Y n k but also fo the degee of Y n n as well as fo the degees of the l ( = 0,, n n Fo exessng the numbe of vaables and equatons n ths system, t s helful to adot the followng defnton Defnton Fo a oe hyegeometc tem h as n (, let δ = deg, { M M } ϑ = max (a m + b m, (u m + v m, λ = M (u m + v m, µ = M (a m + b m u m v m, { M M } ν = max (a m + v m, (u m + b m Note that these aametes ae nteges whch only deend on h but not on o d Excet fo µ, they ae all nonnegatve Note also that we have λ+µ 0 and ϑ = λ+µ + µ Lemma Let d := deg n l ( = 0,, Then deg P δ + λ + Futhemoe, deg k P δ + ϑ Poof It suffces to obseve that max (d + µ deg P,m a m + b m + ( u m + ( v m fo all m =,, M and all = 0,, Fo the degee wth esect to k, obseve also that deg k l = 0 fo all We have some feedom n choosng the d The choce nfluences the numbe of vaables n the ansatz d L = l,jn j Sn j=0 as well as the numbe of equatons We efe to have many vaables and few equatons Fo a fxed taget degee d, the maxmum ossble numbe of vaables s (d + ( + by choosng d 0 = d = = d = d But ths choce also leads to many equatons A bette balance between numbe of vaables and numbe of equatons s obtaned by loweng some of the d wth ndces close to zeo (f µ s negatve o wth ndces close to (f µ s ostve Secfcally, we choose { (ν + + µ f µ 0 d := d (ν + µ f µ < 0 See [6, Ex, Ex 55 and the emaks afte Thm 4] fo a detaled motvaton of the coesondng choce n the dffeental case The suot of the ansatz fo L looks as n the followng dagam, whee evey tem n j Sn s eesented by a bullet at oston (, j: j=d j=0 { }} { } = ν µ } Wth ths choce fo the degees d, the numbe of vaables n the ansatz fo L s (d + = (d + ( + µ ν(ν +, ovded that d µ ν The numbe of esultng equatons s as follows µ

4 Lemma 3 If the d ae chosen as above, then P contans at most ( ( δ + ϑ + δ + d + ϑ µ ν + tems n k j Poof If µ 0, we have d + µ = d (ν + + µ + µ d ν µ + µ fo all = 0,, Lkewse, when µ < 0, we have d + µ = d (ν + µ + µ d ν µ fo all = 0,, Togethe wth Lemma, t follows that deg P δ + (λ + µ + + d ν µ = δ + ϑ + d ν µ egadless of the sgn of µ We also have deg k P δ + ϑ fom Lemma Fo the numbe of tems n k j n P we have ( + deg P = (deg k P + ( deg P + deg k P deg k P Pluggng the estmates fo deg P and deg k P nto the ght hand sde gves the exesson clamed n the Lemma The suot of P has a taezodal shae whch s detemned by the total degee and the degee wth esect to k: deg P } {{ } deg k P The next ste s to choose the degees fo Y n n and k Ths s done n such a way that Q S k (Y R Y only contans tems whch ae aleady exected to occu n P, so that no addtonal equatons wll aea Lemma 4 Let the d be chosen as befoe and suose that Y K[n, k] s such that deg Y deg P ν and deg k Y deg k P ν Then P (Q S k (Y R Y contans at most tems n k j ( δ + ϑ + ( δ + d + ϑ µ ν + Poof As fo Lemma 3, usng also max{deg Q, deg R} = max{deg k Q, deg k R} = ν Lemma 4 suggests the ansatz Y = s s j=0 y,jk n j wth s = deg k P ν and s = deg P ν, whch ovdes us wth ( ( δ + ϑ + ν δ + d + ϑ µ ν + ν vaables We ae now eady to fomulate the man esult of ths secton Note that the nequalty fo d s a consdeably smle fomula than the coesondng esult n the dffeental case (Thm 4 n [6] Theoem 5 Let h be a oe hyegeometc tem whch cannot be wtten h = qh 0 fo some q K(n, k and a hyegeometc tem h 0 wth S k (h 0/h 0 = Let δ, λ, µ, ν be as n Defnton, let ν and d > ( ϑν + ν( δ + µ + 3 ( + µ ν ν + Then thee exsts a telescoe L fo h of ode and degee d Poof A suffcent condton fo the exstence of a telescoe of ode and degee d s that fo some atcula ansatz, the equaton P = Q S k (Y R Y has a nontval soluton A suffcent condton fo the exstence of a soluton s that the lnea system esultng fom coeffcent comason has moe vaables than equatons Fo all d n queston, we have d > ϑν µ ν Theefoe, wth the ansatz descbed above, we have (d + ( + µ ν(ν + vaables l,j n P, ( ( δ + ϑ + ν δ + d + ϑ µ ν + ν vaables y,j n Y, and ( ( δ + ϑ + δ + d + ϑ µ ν + equatons Solvng the nequalty (d + ( + µ ν(ν + ( ( δ + ϑ + ν δ + d + ϑ µ ν + ν > + ( δ + ϑ + ( δ + d + ϑ µ ν + unde the assumton ν fo d gves the clamed degee estmate 33 Examles and Consequences Examle 6 Fo h = (n + k Γ(n + 3k + Γ(n k we have δ =, ϑ =, µ = 0, ν = 4 Theoem 5 edcts a telescoe of ode and degee d wheneve 4 and d > The left fgue below shows the cuve defned by the ght hand sde (black togethe wth the egon of all onts (, d fo whch we found telescoes of h wth ode and degee d by dect calculaton (gay In ths examle, the estmate oveshoots by vey lttle only The coesondng ctue fo h = Γ(n + kγ(n k + Γ(n kγ(n + k s shown below on the ght Hee, δ = 0, ϑ = 3, µ = 0, ν = 3 and Theoem 5 edcts a telescoe of ode and degee d wheneve 3 and d > 8 In ths examle, the estmate s less tght

5 40 30 d d Theefoe, n ode to comute a telescoe and ts cetfcate most effcently, we should mnmze the cost functon C(, d := ( (ϑ + + δ + 3( δ + ϑ + d ( µ + ν The onts (, d n the oton of the gay egon whch s below the black cuve eesent telescoes whee the coesondng lnea system esultng fom the ansatz consdeed n ou oof s ovedetemned but, fo some stange eason, nevetheless nontvally solvable The small otons of whte sace whch le above the cuves ae not n contadcton wth ou theoem because they do not contan any onts wth ntege coodnates (The theoem says that evey ont (, d Z above the cuve belongs to the gay egon Theoem 5 sulements the bound gven n [0] on the ode of telescoes fo a hyegeometc tem by an estmate fo the degee that these oeatos may have In addton, t ovdes lowe degee bounds fo hghe odes and admts a bound on the least ossble degee fo a telescoe Coollay 7 Wth the notaton of Theoem 5, h admts a telescoe of ode = ν and degee d = ν(δ + νϑ + µ ν µ as well as a telescoe of ode and degee d = ϑν = ν( + δ + (ν (ϑ µ Poof Immedate by checkng that the two choces fo and d satsfy the condtons stated n Theoem 5 An accuate edcton fo the degees of the telescoes can also be used fo movng the effcency of ceatve telescong algothms Although most mlementatons today comute the telescoe wth mnmum ode, t may be less costly to comute a telescoe of slghtly hghe ode If we know n advance the degees d of the telescoes fo evey ode, we can select befoe the comutaton the ode whch mnmzes the comutatonal cost Of couse, the cost deends on the algothm whch s used It s not necessay (and not advsable to follow the stes n the devaton of Theoem 5 and do a coeffcent comason ove K Instead, one should follow the common actce [8] of comang coeffcents only wth esect to owes of k and solve a lnea system ove K(n Fo nonmnmal choces of, ths system wll have a nullsace of dmenson geate than one, of whch we need not comute a comlete bass, but only a sngle vecto wth comonents of low degee Thee ae algothms known fo comutng such a vecto usng O(m 3 t feld oeatons when the system has at most m vaables and equatons and the soluton has degee at most t [3, 3, 5] In the stuaton at hand, we have m = (++(δ+ϑ+ vaables and a soluton of degee t = δ+ϑ+d ( µ +ν+ Accodng to the followng theoem, fo asymtotcally lage nut t s sgnfcantly bette to choose slghtly lage than the mnmal ossble value Theoem 8 Let h and λ, µ, ν be as n Theoem 5, τ max{ϑ, ν}, and suose that κ R s a constant such that degee t solutons of a lnea system wth m vaables and at most m equatons ove K(n can be comuted wth κm 3 t oeatons n K Then: A telescoe of ode = τ along wth a coesondng cetfcate can be comuted usng oeatons n K κτ 9 + (7 µ κτ 8 + O(τ 7 If α > s some constant and s chosen such that = ατ + O(, then a telescoe of ode and a coesondng cetfcate can be comuted usng oeatons n K α 5 α κτ 8 + O(τ 7 In atcula, a telescoe fo h and a coesondng cetfcate can be comuted n olynomal tme Poof Accodng to Theoem 5, fo evey τ thee exsts a telescoe of ode and degee d fo any d > f( := (τ + O(τ τ By assumton, such a telescoe can be comuted usng no moe than C(, d = κ ( (τ + + δ + 3( δ + τ + d ( µ + τ + oeatons n K The clam now follows fom the asymtotc exansons of C(τ, f(τ+ and C(ατ, f(ατ+ fo τ, esectvely The leadng coeffcent n at s mnmzed fo α = 5/4 Ths suggests that when ϑ and ν ae lage and aoxmately equal, the ode of the cheaest telescoe s about 0% lage than the mnmal exected ode 4 THE RATIONAL CASE We now tun to the case whee h can be wtten as h = qh 0 fo some hyegeometc tem h 0 wth S k (h 0/h 0 = By the followng tansfomaton, we may assume wthout loss of genealty h 0 = Lemma 9 Let h be a hyegeometc tem and suose that h = qh 0 fo some q K(n, k and a hyegeometc tem h 0 wth S k (h 0/h 0 = Let a, b K[n, k] be such that S n(h 0/h 0 = a/b Let L be a telescoe fo q of ode and degee d Then thee exsts a telescoe fo h of ode and degee at most d + max{deg n a, deg n b}

6 Poof Wte L = l 0 + l S n + + l Sn and let C K(n, k be a cetfcate fo L and q, so L(q = S k (Cq Cq Fo = 0,,, let b ( b l := l a Sn a S n and L := l 0 + l S n + + l S n Then ( b a L(qh 0 = L(qh 0 = (S k (Cq Cqh 0 = S k (Cqh 0 Cqh 0 Because of ( a S k b = S k(s n(h 0 S k (h 0 = Sn(S k(h 0 S k (h 0 = Sn(h0 h 0 = a b, the oeato L s fee of k Thus, afte cleang denomnatos, L s a telescoe fo h wth coeffcents of degee at most d + max{deg n a, deg n b} Fom now on, we assume that h s at the same tme a oe hyegeometc tem and a atonal functon, o equvalently, that h s a atonal functon whose denomnato factos nto ntege-lnea factos Le [9] gves a ecse descton of the stuctue of telescoes n ths case, and he ooses an algothm dffeent fom Zelbege s fo comutng them Ou degee estmate s deved followng the stes of hs algothm, so we stat by befly summazng the man stes of Le s aoach 4 Le s Algothm Gven a atonal oe hyegeometc tem h, Le s algothm comutes a telescoe L fo h as follows Comute g K(n, k and olynomals, q K[n, k] wth gcd(q, S k(q = fo all Z \ {0} such that h = S k (g g + q Then an oeato L s a telescoe fo h f and only f L s a telescoe fo Abamov [] and Paule [] q exlan how to comute such a decomoston Comute a olynomal u K[n], oeatos V,, V s n K[n][S n], and atonal functons f,, f s of the fom f = (a n + k + a e ( =,, s such that q = s V (f u Such data always exsts accodng to Lemma 5 n [9] n combnaton wth the assumton gcd(q, Sk(q = ( Z \ {0} It can be futhe assumed that the f ae chosen such that > 0, e > 0, gcd(a, = fo all, and ( a aj n + a j fo all j wth e = e j ( a a j a Z j 3 Fo =,, s, comute an oeato L K(n[S n] such that S a n s a ght dvso of L ( V It follows u fom Le s Lemma 4 that the oeatos L wth ths oety ae ecsely the telescoes of the atonal functons V (f 4 Comute a common left multle L K[n][S n] of the oeatos L,, L s Then L s a telescoe fo h The man at of the comutatonal wok haens n the last two stes It theefoe aeas sensble to assume n the followng degee analyss that we aleady know the data u, V,, V s, f,, f s comuted n ste, and to exess the degee bounds n tems of the degees and coeffcents athe than n tems of the degees of numeato and denomnato of h, say 4 Countng Vaables and Equatons Also n the esent case, the degee estmate s obtaned by balancng the numbe of vaables and equatons of a cetan lnea system ove K The lnea system we consde ognates fom a atcula way of executng stes 3 and 4 of the algothm outlned above Theoem 0 Let u K[n] and let V,, V s K[n][S n] be oeatos of degee δ ( =, s Let f = (a n + k + a e fo some a K, a, Z wth > 0 and gcd(a, =, e > 0, suose ( a aj n + a j ( a a j a Z j fo all j wth e = e j Let h = s u V(f Then fo evey s a and evey d > + + s δ s + deg n u thee exsts a telescoe L fo h of ode and degee d Poof Accodng to Le s algothm, t suffces to fnd some L K[n][S n] and oeatos R K(n[S n] wth the oety that L( u V = R(Sa n fo all Denote by ρ the ode of V Wtng d := d deg n u, we make an ansatz L = Lu wth L = d j=0 l,jn j S n so that L has degee d and L u V = LV ( =,, s It thus emans to constuct oeatos R K[n][S n] wth LV = R (S a n Snce LṼ has ode + ρ and degee d + δ, we consde ansatzes fo the R of ode + ρ and degee d + δ, esectvely, because S a n and degee 0 Then we have altogethe ( + ( d + + has ode s ( + ρ + ( d + δ + vaables n L and the R, and comang coeffcents wth esect to n and S n n all the equed denttes LV = R (S a n leads to a lnea system wth s ( + ρ + ( d + δ + equatons Ths system wll have a nontval soluton wheneve the numbe of vaables exceeds the numbe of equa-

7 tons Unde the assumton s a, the nequalty ( + ( d s + + ( + ρ + ( d + δ + > s ( + ρ + ( d + δ + s equvalent to Ths comletes the oof d > + s + s a a δ 43 Examles and Consequences Examle h = The atonal functon (n 3k(3n k (n + k + (n + k + (n + k + (3n + k + can be wtten n the fom h = 4 u V(f whee u = (n n(n + 3(n (3n + (5n +, the f ae such that a = a = a 3 =, a 4 =, and the V ae such that δ = = δ 4 = 6 Theefoe, Theoem 0 edcts a telescoe of ode and degee d wheneve 5 and d > Ths cuve togethe wth the egon of all onts (, d fo whch a telescoe of ode and degee d exsts s shown n the left fgue below The coesondng ctue fo the atonal functon d h = (n k + (n 3k + 5 (n + k + 3(n + k + 5(n + k + (n + k + s shown n the fgue below on the ght Ths nut can be wtten n the fom h = S k (g g + 4 V (f u wth g = 0(n+3 (n+4(n+k+7, u = (n 4 (n+9(n+k+3(n+k+4 (3n+ (n 4 (n (n + 5(n + 9, the f such that a = a = a 3 =, a 4 =, and the V such that δ = 8, δ = δ 3 = δ 4 = 7 Accodng to Theoem 0, we theefoe exect a telescoe fo h of ode and degee d wheneve 5 and d > In ths examle, the estmate s not as tght as n the evous one d Agan, t s an easy matte to secalze the geneal degee bound to a degee estmate fo a low ode telescoe, o to an ode estmate fo a low degee telescoe Coollay Wth the notaton of Theoem 0, h admts a telescoe of ode = s a and degee d = deg n u + s (δ a as well as a telescoe of ode = s aδ and degee d = deg n u Poof Clea by checkng that the oosed choces fo and d ae consstent wth the bounds n Theoem 0 Also lke n the non-atonal case, the bounds fo the degees of the telescoes can be used fo devng bounds on the comutatonal cost fo comutng them In the esent stuaton, let us assume fo smlcty that the cost of stes and of Le s algothm s neglgble, o equvalently, that the nut h s of the fom s u V(f wth V K[n][Sn] We shall analyze the algothm whch caes out stes 3 and 4 of Secton 4 n one stoke by makng an ansatz ove K(n fo an oeato L = l 0 + l S n + + l Sn, comutng the ght emndes of L u V wth esect to Sa n and equatng the coeffcents to zeo We assume, as befoe, that the esultng lnea system s solved usng an algothm whose untme s lnea n the outut degee and cubc n the matx sze Then the algothm eques O( 3 d oeatons n K Theoem 3 Let u K[n], V,, V s K[n][S n], and f,, f s K(n, k be as n Theoem 0 and consde h = s u V(f Suose that κ R s a constant such that degee t solutons of a lnea system wth m vaables and at most m equatons ove K(n can be comuted wth κm 3 t oeatons n K Assume δ = = δ s =: δ > 0 and a = a = = a s =: a ae fxed Then: A telescoe of ode = a s can be comuted usng oeatons n K a 4 (δ κ s 4 + O(s 3 If α > s some constant and s chosen such that = αa s + O( then a telescoe of ode can be comuted usng α 3 α a 3 (δ + (α deg n uκ s 3 + O(s oeatons n K In atcula, a telescoe fo h can be comuted n olynomal tme Poof Accodng to the fst estmate stated n Theoem 0, fo evey a s thee exsts a telescoe of ode and degee d fo any d > f( := sa δ + sa + deg n u By assumton, such a telescoe can be comuted usng no moe than C(, d := κ 3 d oeatons n K The clam now follows fom the asymtotc exansons of C(a s, f(a s + and C(αa s, f(αa s + fo s, esectvely

8 When deg n u = 0, the leadng coeffcent n at s mnmzed fo α = 3/ Ths suggests that when s s lage and all the δ, and ae aoxmately equal, the ode of the cheaest oeato exceeds the mnmal exected ode by aound 50% It must not be concluded fom a lteal comason of the exonents n Theoems 5 and 0 that Le s algothm s faste than Zelbege s, because τ n Theoem 5 and s n Theoem 0 measue the sze of the nut dffeently Nevetheless, t s lausble to exect that Le s algothm s faste, because t fnds the telescoes wthout also comutng a (otentally bg coesondng cetfcate Ou man ont hee s not a comason of the two aoaches, but athe the obsevaton that both of them admt a degee analyss whch fts to the geneal aadgm that nceasng the ode can cause a degee do whch s sgnfcant enough to leave a tace n the comutatonal comlexty It can also be agued that the stuatons consdeed n Theoems 8 and 3 ae chosen somewhat abtaly (ϑ and ν gowng whle µ emans fxed; es s gowng whle all the δ and eman fxed Indeed, t would be wong to take these theoems as an advce whch telescoes ae most easly comuted fo a atcula nut at hand Instead, n ode to seed u an actual mlementaton, one should let the ogam calculate the otmal choce fo fom the degee estmates gven Theoems 5 and 0 wth the atcula aametes of the nut Unfotunately, we ae not able to llustate the seedu obtaned n ths way by an actual untme comason fo a concete examle, because fo examles whch can be handled on cuently avalable hadwae, the comutatonal cost tuns out to be mnmzed fo the least ode oeato But aleady fo examles whch ae only slghtly beyond the caacty of cuent machnes, the degee edctons n Theoems 5 and 0 ndcate that comutng the telescoe of ode one moe than mnmal wll stat to gve an advantage We theefoe exect that the esults esented n ths ae wll contbute to the movement of ceatve telescong mlementatons n the vey nea futue [7] Wllam Gose Decson ocedue fo ndefnte hyegeometc summaton Poceedngs of the Natonal Academy of Scences of the Unted States of Ameca, 75:40 4, 978 [8] Chstoh Koutschan A fast aoach to ceatve telescong Mathematcs n Comute Scence, 4( 3:59 66, 00 [9] Ha Q Le A dect algothm to constuct the mnmal Z-as fo atonal functons Advances n Aled Mathematcs, 30( :37 59, 003 [0] Mohamud Mohammed and Doon Zelbege Sha ue bounds fo the odes of the ecuences outut by the Zelbege and q-zelbege algothms Jounal of Symbolc Comutaton, 39(:0 07, 005 [] Pete Paule Geatest factoal factozaton and symbolc summaton Jounal of Symbolc Comutaton, 0:35 68, 995 [] Mako Petkovšek, Hebet Wlf, and Doon Zelbege A = B AK Petes, Ltd, 997 [3] Ane Stojohann and Glles Vllad Comutng the ank and a small nullsace bass of a olynomal matx In Poceedngs of ISSAC 05, ages , 005 [4] Hebet S Wlf and Doon Zelbege An algothmc oof theoy fo hyegeometc (odnay and q multsum/ntegal denttes Inventones Mathematcae, 08: , 99 [5] Doon Zelbege A fast algothm fo ovng temnatng hyegeometc denttes Dscete Mathematcs, 80:07, 990 [6] Doon Zelbege A holonomc systems aoach to secal functon denttes Jounal of Comutatonal and Aled Mathematcs, 3:3 368, 990 [7] Doon Zelbege The method of ceatve telescong Jounal of Symbolc Comutaton, :95 04, 99 5 REFERENCES [] Sege A Abamov Indefnte sums of atonal functons In Poceedngs of ISSAC 95, ages , 995 [] Sege A Abamov and Ha Q Le A cteon fo the alcablty of Zelbege s algothm to atonal functons Dscete Mathematcs, 59( 3: 7, 00 [3] Benhad Beckemann and Geoge Labahn A unfom aoach fo the fast comutaton of matx-tye Padé aoxmants SIAM Jounal on Matx Analyss and Alcatons, 5(3:804 83, 994 [4] Aln Bostan, Shaosh Chen, Fédéc Chyzak, and Zmng L Comlexty of ceatve telescong fo bvaate atonal functons In Poceedngs of ISSAC 0, ages 03 0, 00 [5] Aln Bostan, Fédéc Chyzak, Buno Salvy, Gégoe Lecef, and Éc Schost Dffeental equatons fo algebac functons In Poceedngs of ISSAC 07, ages 5 3, 007 [6] Shaosh Chen and Manuel Kaues Tadng ode fo degee n ceatve telescong Techncal Reot , AXv, 0

An Algorithm For Factoring Integers

An Algorithm For Factoring Integers An Algothm Fo Factong Integes Yngpu Deng and Yanbn Pan Key Laboatoy of Mathematcs Mechanzaton, Academy of Mathematcs and Systems Scence, Chnese Academy of Scences, Bejng 100190, People s Republc of Chna

More information

Perturbation Theory and Celestial Mechanics

Perturbation Theory and Celestial Mechanics Copyght 004 9 Petubaton Theoy and Celestal Mechancs In ths last chapte we shall sketch some aspects of petubaton theoy and descbe a few of ts applcatons to celestal mechancs. Petubaton theoy s a vey boad

More information

A Coverage Gap Filling Algorithm in Hybrid Sensor Network

A Coverage Gap Filling Algorithm in Hybrid Sensor Network A Coveage Ga Fllng Algothm n Hybd Senso Netwok Tan L, Yang Mnghua, Yu Chongchong, L Xuanya, Cheng Bn A Coveage Ga Fllng Algothm n Hybd Senso Netwok 1 Tan L, 2 Yang Mnghua, 3 Yu Chongchong, 4 L Xuanya,

More information

LINES ON BRIESKORN-PHAM SURFACES

LINES ON BRIESKORN-PHAM SURFACES LIN ON BRIKORN-PHAM URFAC GUANGFNG JIANG, MUTUO OKA, DUC TAI PHO, AND DIRK IRMA Abstact By usng toc modfcatons and a esult of Gonzalez-pnbeg and Lejeune- Jalabet, we answe the followng questons completely

More information

Electric Potential. otherwise to move the object from initial point i to final point f

Electric Potential. otherwise to move the object from initial point i to final point f PHY2061 Enched Physcs 2 Lectue Notes Electc Potental Electc Potental Dsclame: These lectue notes ae not meant to eplace the couse textbook. The content may be ncomplete. Some topcs may be unclea. These

More information

Impact on inventory costs with consolidation of distribution centers

Impact on inventory costs with consolidation of distribution centers IIE Tansactons (2) 33, 99± Imact on nventoy costs wth consoldaton of dstbuton centes CHUNG PIAW TEO, JIHONG OU and MARK GOH Deatment of Decson Scences, Faculty of Busness Admnstaton, Natonal Unvesty of

More information

FAIR VALUATION OF VARIOUS PARTICIPATION SCHEMES IN LIFE INSURANCE ABSTRACT

FAIR VALUATION OF VARIOUS PARTICIPATION SCHEMES IN LIFE INSURANCE ABSTRACT FAIR VALUAION OF VARIOUS PARIIPAION SHEMES IN LIFE INSURANE PIERRE DEVOLDER AND INMAULADA DOMÍNGUEZ-FABIÁN BY Insttut des Scences Actuaelles, Unvesté atholque de Louvan, 6 ue des Wallons, 348 Louvan la

More information

Gravitation. Definition of Weight Revisited. Newton s Law of Universal Gravitation. Newton s Law of Universal Gravitation. Gravitational Field

Gravitation. Definition of Weight Revisited. Newton s Law of Universal Gravitation. Newton s Law of Universal Gravitation. Gravitational Field Defnton of Weght evsted Gavtaton The weght of an object on o above the eath s the gavtatonal foce that the eath exets on the object. The weght always ponts towad the cente of mass of the eath. On o above

More information

Additional File 1 - A model-based circular binary segmentation algorithm for the analysis of array CGH data

Additional File 1 - A model-based circular binary segmentation algorithm for the analysis of array CGH data 1 Addtonal Fle 1 - A model-based ccula bnay segmentaton algothm fo the analyss of aay CGH data Fang-Han Hsu 1, Hung-I H Chen, Mong-Hsun Tsa, Lang-Chuan La 5, Ch-Cheng Huang 1,6, Shh-Hsn Tu 6, Ec Y Chuang*

More information

On the Efficiency of Equilibria in Generalized Second Price Auctions

On the Efficiency of Equilibria in Generalized Second Price Auctions On the Effcency of Equlba n Genealzed Second Pce Auctons Ioanns Caaganns Panagots Kanellopoulos Chstos Kaklamans Maa Kyopoulou Depatment of Compute Engneeng and Infomatcs Unvesty of Patas and RACTI, Geece

More information

A New replenishment Policy in a Two-echelon Inventory System with Stochastic Demand

A New replenishment Policy in a Two-echelon Inventory System with Stochastic Demand A ew eplenshment Polcy n a wo-echelon Inventoy System wth Stochastc Demand Rasoul Haj, Mohammadal Payesh eghab 2, Amand Babol 3,2 Industal Engneeng Dept, Shaf Unvesty of echnology, ehan, Ian (haj@shaf.edu,

More information

PCA vs. Varimax rotation

PCA vs. Varimax rotation PCA vs. Vamax otaton The goal of the otaton/tansfomaton n PCA s to maxmze the vaance of the new SNP (egensnp), whle mnmzng the vaance aound the egensnp. Theefoe the dffeence between the vaances captued

More information

(Semi)Parametric Models vs Nonparametric Models

(Semi)Parametric Models vs Nonparametric Models buay, 2003 Pobablty Models (Sem)Paametc Models vs Nonpaametc Models I defne paametc, sempaametc, and nonpaametc models n the two sample settng My defnton of sempaametc models s a lttle stonge than some

More information

Luby s Alg. for Maximal Independent Sets using Pairwise Independence

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

Orbit dynamics and kinematics with full quaternions

Orbit dynamics and kinematics with full quaternions bt dynamcs and knematcs wth full quatenons Davde Andes and Enco S. Canuto, Membe, IEEE Abstact Full quatenons consttute a compact notaton fo descbng the genec moton of a body n the space. ne of the most

More information

Chapter 4: Matrix Norms

Chapter 4: Matrix Norms EE448/58 Vesion.0 John Stensby Chate 4: Matix Noms The analysis of matix-based algoithms often equies use of matix noms. These algoithms need a way to quantify the "size" of a matix o the "distance" between

More information

Integer sequences from walks in graphs

Integer sequences from walks in graphs otes on umbe Theoy and Discete Mathematics Vol. 9, 3, o. 3, 78 84 Intege seuences fom walks in gahs Enesto Estada, and José A. de la Peña Deatment of Mathematics and Statistics, Univesity of Stathclyde

More information

Keywords: Transportation network, Hazardous materials, Risk index, Routing, Network optimization.

Keywords: Transportation network, Hazardous materials, Risk index, Routing, Network optimization. IUST Intenatonal Jounal of Engneeng Scence, Vol. 19, No.3, 2008, Page 57-65 Chemcal & Cvl Engneeng, Specal Issue A ROUTING METHODOLOGY FOR HAARDOUS MATIALS TRANSPORTATION TO REDUCE THE RISK OF ROAD NETWORK

More information

A Novel Lightweight Algorithm for Secure Network Coding

A Novel Lightweight Algorithm for Secure Network Coding A Novel Lghtweght Algothm fo Secue Netwok Codng A Novel Lghtweght Algothm fo Secue Netwok Codng State Key Laboatoy of Integated Sevce Netwoks, Xdan Unvesty, X an, Chna, E-mal: {wangxaoxao,wangmeguo}@mal.xdan.edu.cn

More information

A comparison result for perturbed radial p-laplacians

A comparison result for perturbed radial p-laplacians A comaison esult fo etubed adial -Lalacians Raul Manásevich and Guido Swees Diectoy Table of Contents Begin Aticle Coyight c 23 Last Revision Date: Ail 1, 23 Table of Contents 1. Intoduction and main esult

More information

REAL INTERPOLATION OF SOBOLEV SPACES

REAL INTERPOLATION OF SOBOLEV SPACES REAL INTERPOLATION OF SOBOLEV SPACES NADINE BADR Abstact We pove that W p s a eal ntepolaton space between W p and W p 2 fo p > and p < p < p 2 on some classes of manfolds and geneal metc spaces, whee

More information

AREA COVERAGE SIMULATIONS FOR MILLIMETER POINT-TO-MULTIPOINT SYSTEMS USING STATISTICAL MODEL OF BUILDING BLOCKAGE

AREA COVERAGE SIMULATIONS FOR MILLIMETER POINT-TO-MULTIPOINT SYSTEMS USING STATISTICAL MODEL OF BUILDING BLOCKAGE Radoengneeng Aea Coveage Smulatons fo Mllmete Pont-to-Multpont Systems Usng Buldng Blockage 43 Vol. 11, No. 4, Decembe AREA COVERAGE SIMULATIONS FOR MILLIMETER POINT-TO-MULTIPOINT SYSTEMS USING STATISTICAL

More information

Institut für Halle Institute for Economic Research Wirtschaftsforschung Halle

Institut für Halle Institute for Economic Research Wirtschaftsforschung Halle Insttut fü Halle Insttute fo Economc Reseach Wtschaftsfoschung Halle A Smple Repesentaton of the Bea-Jaque-Lee Test fo Pobt Models Joachm Wlde Dezembe 2007 No. 13 IWH-Dskussonspapee IWH-Dscusson Papes

More information

TRUCK ROUTE PLANNING IN NON- STATIONARY STOCHASTIC NETWORKS WITH TIME-WINDOWS AT CUSTOMER LOCATIONS

TRUCK ROUTE PLANNING IN NON- STATIONARY STOCHASTIC NETWORKS WITH TIME-WINDOWS AT CUSTOMER LOCATIONS TRUCK ROUTE PLANNING IN NON- STATIONARY STOCHASTIC NETWORKS WITH TIME-WINDOWS AT CUSTOMER LOCATIONS Hossen Jula α, Maged Dessouky β, and Petos Ioannou γ α School of Scence, Engneeng and Technology, Pennsylvana

More information

Decomposing General Equilibrium Effects of Policy Intervention in Multi-Regional Trade Models

Decomposing General Equilibrium Effects of Policy Intervention in Multi-Regional Trade Models Decomosng Geneal Equlbum Effects of Polcy Inteventon n ult-regonal Tade odels ethod and Samle Alcaton by hstoh Böhnge ente fo Euoean Economc Reseach (ZEW) boehnge@zew.de and Thomas F. Ruthefod Deatment

More information

I = Prt. = P(1+i) n. A = Pe rt

I = Prt. = P(1+i) n. A = Pe rt 11 Chapte 6 Matheatcs of Fnance We wll look at the atheatcs of fnance. 6.1 Sple and Copound Inteest We wll look at two ways nteest calculated on oney. If pncpal pesent value) aount P nvested at nteest

More information

Degrees of freedom in HLM models

Degrees of freedom in HLM models Degees o eedom n HLM models The vaous degees o eedom n a HLM2/HLM3 model can be calculated accodng to Table 1 and Table 2. Table 1: Degees o Feedom o HLM2 Models Paamete/Test Statstc Degees o Feedom Gammas

More information

Real-Time Scheduling in MapReduce Clusters

Real-Time Scheduling in MapReduce Clusters Unvesty of Nebaska - Lncoln DgtalCoons@Unvesty of Nebaska - Lncoln CSE Confeence and Woksho Paes Coute Scence and Engneeng, Deatent of 2013 Real-Te Schedulng n MaReduce Clustes Chen He Unvesty of Nebaska-Lncoln,

More information

Time Series Perturbation by Genetic Programming

Time Series Perturbation by Genetic Programming Tme Sees Petbaton by Genetc Pogammng G. Y. Lee Assstant Pofess Deatment of Comte and Infomaton Engneeng Yong-San Unvesty San 5 -Nam-R Ung-Sang-E Yang-San-Sh Kyng-Nam Soth Koea sky@java-tech.com Abstact-

More information

We are now ready to answer the question: What are the possible cardinalities for finite fields?

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 information

Drag force acting on a bubble in a cloud of compressible spherical bubbles at large Reynolds numbers

Drag force acting on a bubble in a cloud of compressible spherical bubbles at large Reynolds numbers Euopean Jounal of Mechancs B/Fluds 24 2005 468 477 Dag foce actng on a bubble n a cloud of compessble sphecal bubbles at lage Reynolds numbes S.L. Gavlyuk a,b,,v.m.teshukov c a Laboatoe de Modélsaton en

More information

Efficient Evolutionary Data Mining Algorithms Applied to the Insurance Fraud Prediction

Efficient Evolutionary Data Mining Algorithms Applied to the Insurance Fraud Prediction Intenatonal Jounal of Machne Leanng and Computng, Vol. 2, No. 3, June 202 Effcent Evolutonay Data Mnng Algothms Appled to the Insuance Faud Pedcton Jenn-Long Lu, Chen-Lang Chen, and Hsng-Hu Yang Abstact

More information

The Greedy Method. Introduction. 0/1 Knapsack Problem

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

1 Example 1: Axis-aligned rectangles

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

DEFINING %COMPLETE IN MICROSOFT PROJECT

DEFINING %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 information

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic

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

Support Vector Machines

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

Joint Virtual Machine and Bandwidth Allocation in Software Defined Network (SDN) and Cloud Computing Environments

Joint Virtual Machine and Bandwidth Allocation in Software Defined Network (SDN) and Cloud Computing Environments IEEE ICC 2014 - Next-Geneaton Netwokng Symposum 1 Jont Vtual Machne and Bandwdth Allocaton n Softwae Defned Netwok (SDN) and Cloud Computng Envonments Jonathan Chase, Rakpong Kaewpuang, Wen Yonggang, and

More information

Green's function integral equation methods for plasmonic nanostructures

Green's function integral equation methods for plasmonic nanostructures Geens functon ntegal equaton methods fo plasmonc nanostuctues (Ph Couse: Optcal at the Nanoscale) Thomas Søndegaad epatment of Phscs and Nanotechnolog, Aalbog Unvest, Senve 4A, K-9 Aalbog Øst, enma. Intoducton

More information

A Resource Scheduling Algorithms Based on the Minimum Relative Degree of Load Imbalance

A Resource Scheduling Algorithms Based on the Minimum Relative Degree of Load Imbalance Jounal of Communcatons Vol. 10, No. 10, Octobe 2015 A Resouce Schedulng Algothms Based on the Mnmum Relatve Degee of Load Imbalance Tao Xue and Zhe Fan Depatment of Compute Scence, X an Polytechnc Unvesty,

More information

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by

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

Statistical modelling of gambling probabilities

Statistical modelling of gambling probabilities Ttle Statstcal modellng of gamblng pobabltes Autho(s) Lo, Su-yan, Vcto.; 老 瑞 欣 Ctaton Issued Date 992 URL http://hdl.handle.net/0722/3525 Rghts The autho etans all popetay ghts, (such as patent ghts) and

More information

PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12

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

Voltage ( = Electric Potential )

Voltage ( = Electric Potential ) V-1 of 9 Voltage ( = lectic Potential ) An electic chage altes the space aound it. Thoughout the space aound evey chage is a vecto thing called the electic field. Also filling the space aound evey chage

More information

Recurrence. 1 Definitions and main statements

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

AN EQUILIBRIUM ANALYSIS OF THE INSURANCE MARKET WITH VERTICAL DIFFERENTIATION

AN EQUILIBRIUM ANALYSIS OF THE INSURANCE MARKET WITH VERTICAL DIFFERENTIATION QUIIRIUM YI OF T IUR MRKT WIT VRTI IFFRTITIO Mahto Okua Faculty of conomcs, agasak Unvesty, 4-- Katafuch, agasak, 8508506, Japan okua@net.nagasak-u.ac.p TRT ach nsuance poduct pe se s dentcal but the nsuance

More information

Prejudice and the Economics of Discrimination

Prejudice and the Economics of Discrimination Pelmnay Pejudce and the Economcs of Dscmnaton Kewn Kof Chales Unvesty of Chcago and NB Jonathan Guyan Unvesty of Chcago GSB and NB Novembe 17, 2006 Abstact Ths pape e-examnes the ole of employe pejudce

More information

8 Algorithm for Binary Searching in Trees

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

The Mathematical Derivation of Least Squares

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

Portfolio Loss Distribution

Portfolio Loss Distribution Portfolo Loss Dstrbuton Rsky assets n loan ortfolo hghly llqud assets hold-to-maturty n the bank s balance sheet Outstandngs The orton of the bank asset that has already been extended to borrowers. Commtment

More information

Symmetric polynomials and partitions Eugene Mukhin

Symmetric polynomials and partitions Eugene Mukhin Symmetic polynomials and patitions Eugene Mukhin. Symmetic polynomials.. Definition. We will conside polynomials in n vaiables x,..., x n and use the shotcut p(x) instead of p(x,..., x n ). A pemutation

More information

Embedding lattices in the Kleene degrees

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

Security of Full-State Keyed Sponge and Duplex: Applications to Authenticated Encryption

Security of Full-State Keyed Sponge and Duplex: Applications to Authenticated Encryption Secuty of Full-State Keyed Sponge and uplex: Applcatons to Authentcated Encypton Bat Mennnk 1 Reza Reyhantaba 2 aman Vzá 2 1 ept. Electcal Engneeng, ESAT/COSIC, KU Leuven, and Mnds, Belgum bat.mennnk@esat.kuleuven.be

More information

Applied Research Laboratory. Decision Theory and Receiver Design

Applied Research Laboratory. Decision Theory and Receiver Design Decson Theor and Recever Desgn Sgnal Detecton and Performance Estmaton Sgnal Processor Decde Sgnal s resent or Sgnal s not resent Nose Nose Sgnal? Problem: How should receved sgnals be rocessed n order

More information

Load Balancing of Parallelized Information Filters

Load Balancing of Parallelized Information Filters IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. XXX, NO. XX, XXXXXXX 2001 1 Load Balancng of Parallelzed Informaton Flters Nel C. Rowe, Member, IEEE Comuter Socety, and Amr Zaky, Member, IEEE

More information

A Study on Secure Data Storage Strategy in Cloud Computing

A Study on Secure Data Storage Strategy in Cloud Computing Journal of Convergence Informaton Technology Volume 5, Number 7, Setember 00 A Study on Secure Data Storage Strategy n Cloud Comutng Danwe Chen, Yanjun He, Frst Author College of Comuter Technology, Nanjng

More information

International Business Cycles and Exchange Rates

International Business Cycles and Exchange Rates Revew of Intenatonal Economcs, 7(4), 682 698, 999 Intenatonal Busness Cycles and Exchange Rates Chstan Zmmemann* Abstact Models of ntenatonal eal busness cycles ae not able to account fo the hgh volatlty

More information

An Alternative Way to Measure Private Equity Performance

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

Determinants of Borrowing Limits on Credit Cards Shubhasis Dey and Gene Mumy

Determinants of Borrowing Limits on Credit Cards Shubhasis Dey and Gene Mumy Bank of Canada Banque du Canada Wokng Pape 2005-7 / Document de taval 2005-7 Detemnants of Boowng mts on Cedt Cads by Shubhass Dey and Gene Mumy ISSN 1192-5434 Pnted n Canada on ecycled pape Bank of Canada

More information

Simultaneous Detection and Estimation, False Alarm Prediction for a Continuous Family of Signals in Gaussian Noise

Simultaneous Detection and Estimation, False Alarm Prediction for a Continuous Family of Signals in Gaussian Noise Sultaneous Detecton and Estaton, False Ala Pedcton fo a Contnuous Faly of Sgnals n Gaussan Nose D Mchael Mlde, Robet G Lndgen, and Mos M Bean Abstact New pobles ase when the standad theoy of jont detecton

More information

Statistical Discrimination or Prejudice? A Large Sample Field Experiment. Michael Ewens, Bryan Tomlin, and Liang Choon Wang.

Statistical Discrimination or Prejudice? A Large Sample Field Experiment. Michael Ewens, Bryan Tomlin, and Liang Choon Wang. Statstcal Dscmnaton o Pejudce? A Lage Sample Feld Expement Mchael Ewens, yan Tomln, and Lang Choon ang Abstact A model of acal dscmnaton povdes testable mplcatons fo two featues of statstcal dscmnatos:

More information

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

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

BERNSTEIN POLYNOMIALS

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

Competitive Targeted Advertising with Price Discrimination

Competitive Targeted Advertising with Price Discrimination Compette Tageted Adetsng wth Pce Dscmnaton Rosa Banca Estees Unesdade do Mnho and NIPE banca@eeg.umnho.pt Joana Resende Faculdade de Economa, Unesdade do Poto and CEF.UP jesende@fep.up.pt Septembe 8, 205

More information

Thick-Walled Cylinders and Press Fits. 2004 by W.H.Dornfeld PressCylinder:

Thick-Walled Cylinders and Press Fits. 2004 by W.H.Dornfeld PressCylinder: Thck-Walled Cylndes and Pess Fts 004 by W.H.Dnfeld PessCylnde: 1 Stesses n Thck-Walled Cylndes Thck-Walled cylndes have an aveage adus less than 0 tmes the wall thckness. σ σl They ae essuzed ntenally

More information

Continuous Compounding and Annualization

Continuous Compounding and Annualization Continuous Compounding and Annualization Philip A. Viton Januay 11, 2006 Contents 1 Intoduction 1 2 Continuous Compounding 2 3 Pesent Value with Continuous Compounding 4 4 Annualization 5 5 A Special Poblem

More information

REAL TIME MONITORING OF DISTRIBUTION NETWORKS USING INTERNET BASED PMU. Akanksha Eknath Pachpinde

REAL TIME MONITORING OF DISTRIBUTION NETWORKS USING INTERNET BASED PMU. Akanksha Eknath Pachpinde REAL TME MONTORNG OF DSTRBUTON NETWORKS USNG NTERNET BASED PMU by Akanksha Eknath Pachpnde A Thess submtted to the Faculty of the Gaduate School of the Unvesty at Buffalo, State Unvesty of New Yok n patal

More information

1. Math 210 Finite Mathematics

1. Math 210 Finite Mathematics 1. ath 210 Fnte athematcs Chapter 5.2 and 5.3 Annutes ortgages Amortzaton Professor Rchard Blecksmth Dept. of athematcal Scences Northern Illnos Unversty ath 210 Webste: http://math.nu.edu/courses/math210

More information

PERRON FROBENIUS THEOREM

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

Chapter 3 Savings, Present Value and Ricardian Equivalence

Chapter 3 Savings, Present Value and Ricardian Equivalence Chapte 3 Savings, Pesent Value and Ricadian Equivalence Chapte Oveview In the pevious chapte we studied the decision of households to supply hous to the labo maket. This decision was a static decision,

More information

+ + + - - This circuit than can be reduced to a planar circuit

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

Compiling for Parallelism & Locality. Dependence Testing in General. Algorithms for Solving the Dependence Problem. Dependence Testing

Compiling for Parallelism & Locality. Dependence Testing in General. Algorithms for Solving the Dependence Problem. Dependence Testing Complng for Parallelsm & Localty Dependence Testng n General Assgnments Deadlne for proect 4 extended to Dec 1 Last tme Data dependences and loops Today Fnsh data dependence analyss for loops General code

More information

Electronic Structure Methods

Electronic Structure Methods Electonc Stuctue Methods One-electon models e.g., Huckel theoy Semempcal methods e.g., AM, PM3, MNDO Sngle-efeence based ab nto methods Hatee-Fock Petubaton theoy MP, MP3, MP4 Coupled cluste theoy e.g.,

More information

PREVENTIVE AND CORRECTIVE SECURITY MARKET MODEL

PREVENTIVE AND CORRECTIVE SECURITY MARKET MODEL REVENTIVE AND CORRECTIVE SECURITY MARKET MODEL Al Ahmad-hat Rachd Cheaou and Omd Alzadeh Mousav Ecole olytechnque Fédéale de Lausanne Lausanne Swzeland al.hat@epfl.ch achd.cheaou@epfl.ch omd.alzadeh@epfl.ch

More information

How To Schedule A Cloud Comuting On A Computer (I.E. A Computer)

How To Schedule A Cloud Comuting On A Computer (I.E. A Computer) Intenational Jounal on Cloud Comuting: Sevices and Achitectue(IJCCSA,Vol., No.3,Novembe 20 STOCHASTIC MARKOV MODEL APPROACH FOR EFFICIENT VIRTUAL MACHINES SCHEDULING ON PRIVATE CLOUD Hsu Mon Kyi and Thinn

More information

v a 1 b 1 i, a 2 b 2 i,..., a n b n i.

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

Power-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts

Power-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts Power-of-wo Polces for Sngle- Warehouse Mult-Retaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)

More information

UNIT CIRCLE TRIGONOMETRY

UNIT CIRCLE TRIGONOMETRY UNIT CIRCLE TRIGONOMETRY The Unit Cicle is the cicle centeed at the oigin with adius unit (hence, the unit cicle. The equation of this cicle is + =. A diagam of the unit cicle is shown below: + = - - -

More information

How a Global Inter-Country Input-Output Table with Processing Trade Account. Can be constructed from GTAP Database

How a Global Inter-Country Input-Output Table with Processing Trade Account. Can be constructed from GTAP Database How a lobal Inte-County Input-Output Table wth Pocessng Tade Account Can be constucted fom TAP Database Manos Tsgas and Zh Wang U.S. Intenatonal Tade Commsson* Mak ehlha U.S. Depatment of Inteo* (Pelmnay

More information

Seshadri constants and surfaces of minimal degree

Seshadri constants and surfaces of minimal degree Seshadi constants and sufaces of minimal degee Wioletta Syzdek and Tomasz Szembeg Septembe 29, 2007 Abstact In [] we showed that if the multiple point Seshadi constants of an ample line bundle on a smooth

More information

AMB111F Financial Maths Notes

AMB111F Financial Maths Notes AMB111F Financial Maths Notes Compound Inteest and Depeciation Compound Inteest: Inteest computed on the cuent amount that inceases at egula intevals. Simple inteest: Inteest computed on the oiginal fixed

More information

Chapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT

Chapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT Chapter 4 ECOOMIC DISATCH AD UIT COMMITMET ITRODUCTIO A power system has several power plants. Each power plant has several generatng unts. At any pont of tme, the total load n the system s met by the

More information

4. SHAFT SENSORLESS FORCED DYNAMICS CONTROL OF RELUCTANCE SYNCHRONOUS MOTOR DRIVES

4. SHAFT SENSORLESS FORCED DYNAMICS CONTROL OF RELUCTANCE SYNCHRONOUS MOTOR DRIVES 4. SHAFT SENSORLESS FORCED DYNAMICS CONTROL OF RELUCTANCE SYNCHRONOUS MOTOR DRIVES 4.. VECTOR CONTROLLED RELUCTANCE SYNCHRONOUS MOTOR DRIVES WITH PRESCRIBED CLOSED-LOOP SPEED DYNAMICS Abstact: A new spee

More information

Period and Deadline Selection for Schedulability in Real-Time Systems

Period and Deadline Selection for Schedulability in Real-Time Systems Perod and Deadlne Selecton for Schedulablty n Real-Tme Systems Thdapat Chantem, Xaofeng Wang, M.D. Lemmon, and X. Sharon Hu Department of Computer Scence and Engneerng, Department of Electrcal Engneerng

More information

Voltage ( = Electric Potential )

Voltage ( = Electric Potential ) V-1 Voltage ( = Electic Potential ) An electic chage altes the space aound it. Thoughout the space aound evey chage is a vecto thing called the electic field. Also filling the space aound evey chage is

More information

Molecular Dynamics. r F. r dt. What is molecular dynamics?

Molecular Dynamics. r F. r dt. What is molecular dynamics? What s molecula dynamcs? Molecula Dynamcs Molecula dynamcs (MD) s a compute smulaton technque that allows one to pedct the tme evoluton of a system of nteactng patcles (atoms, molecules, ganules, etc.).

More information

n + d + q = 24 and.05n +.1d +.25q = 2 { n + d + q = 24 (3) n + 2d + 5q = 40 (2)

n + 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 information

Dynamic Load Balancing of Parallel Computational Iterative Routines on Platforms with Memory Heterogeneity

Dynamic Load Balancing of Parallel Computational Iterative Routines on Platforms with Memory Heterogeneity Dynamc Load Balancng of Parallel Comutatonal Iteratve Routnes on Platforms wth Memory Heterogenety Davd Clare, Alexey Lastovetsy, Vladmr Rychov School of Comuter Scence and Informatcs, Unversty College

More information

A Probabilistic Theory of Coherence

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

Chapter 7: Answers to Questions and Problems

Chapter 7: Answers to Questions and Problems 19. Based on the nformaton contaned n Table 7-3 of the text, the food and apparel ndustres are most compettve and therefore probably represent the best match for the expertse of these managers. Chapter

More information

econstor zbw www.econstor.eu

econstor zbw www.econstor.eu econsto www.econsto.eu De Open-Access-Publkatonsseve de ZBW Lebnz-Infomatonszentum Wtschaft The Open Access Publcaton Seve of the ZBW Lebnz Infomaton Cente fo Economcs Babazadeh, Reza; Razm, Jafa; Ghods,

More information

The Choice of Direct Dealing or Electronic Brokerage in Foreign Exchange Trading

The Choice of Direct Dealing or Electronic Brokerage in Foreign Exchange Trading The Choce of Drect Dealng or Electronc Brokerage n Foregn Exchange Tradng Mchael Melvn & Ln Wen Arzona State Unversty Introducton Electronc Brokerage n Foregn Exchange Start from a base of zero n 1992

More information

CONSTRUCTION PROJECT SCHEDULING WITH IMPRECISELY DEFINED CONSTRAINTS

CONSTRUCTION PROJECT SCHEDULING WITH IMPRECISELY DEFINED CONSTRAINTS Management an Innovaton fo a Sustanable Bult Envonment ISBN: 9789052693958 20 23 June 2011, Amsteam, The Nethelans CONSTRUCTION PROJECT SCHEDULING WITH IMPRECISELY DEFINED CONSTRAINTS JANUSZ KULEJEWSKI

More information

Bending Stresses for Simple Shapes

Bending Stresses for Simple Shapes -6 Bendng Stesses fo Smple Sapes In bendng, te maxmum stess and amount of deflecton can be calculated n eac of te followng stuatons. Addtonal examples ae avalable n an engneeng andbook. Secton Modulus

More information

1. Measuring association using correlation and regression

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

Causal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting

Causal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting Causal, Explanatory Forecastng Assumes cause-and-effect relatonshp between system nputs and ts output Forecastng wth Regresson Analyss Rchard S. Barr Inputs System Cause + Effect Relatonshp The job of

More information

Lecture 3: Force of Interest, Real Interest Rate, Annuity

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

Mixed Task Scheduling and Resource Allocation Problems

Mixed Task Scheduling and Resource Allocation Problems Task schedulng and esouce allocaton 1 Mxed Task Schedulng and Resouce Allocaton Poblems Mae-José Huguet 1,2 and Pee Lopez 1 1 LAAS-CNRS, 7 av. du Colonel Roche F-31077 Toulouse cedex 4, Fance {huguet,lopez}@laas.f

More information

Calculation of Sampling Weights

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

Imperial College London

Imperial College London F. Fang 1, C.C. Pan 1, I.M. Navon 2, M.D. Pggott 1, G.J. Gorman 1, P.A. Allson 1 and A.J.H. Goddard 1 1 Appled Modellng and Computaton Group Department of Earth Scence and Engneerng Imperal College London,

More information