Algorithmic Tools for the Asymptotics of Linear Recurrences
|
|
- Irene Cobb
- 5 years ago
- Views:
Transcription
1 Algorithmic Tools for the Asymptotics of Linear Recurrences Bruno Salvy Inria & ENS de Lyon
2 <latexit sha1_base64="sbnu9dqkdmd/u8qyjj76j0qhbyk=">aaacuxicbvhlbtraejw1r2beg+aghxhrsgitvjycahkhcc7cskqsibs2vunxez3jpjyznsli+rf4bq7wbfwknz6f8torzenli5wqutvtxvklhcmo+juirl2/cfpwxu3wzt179x8mnx9+cqa2hkbcsgmpm+zacg1tfcjhsllavcbhidt+3+khn8e6yfq+litifvtouqjo0fpz4epelmacmfmvbkzgpnfwes2hw9ekwhw9cujzslxz9ofeb0li7nxz8dxjda8vaossotelowrthlkuxeibjhih/m96gwwtijzhqcixbjtxevdtmnqoksap2qjmhmqmwkxn2cpds0eeymlhrh8a6yr9d6rhyrmlynynyli6da0j/6fnaixep43qvy2geb+oqcvfq7tt0vxy4cixhjbuhbdcecks4+gpgiywnjxyoxtt+yveftkurjby1kzq19wcksgxfx1/m/3sef2o/q5rucybdln2pk1pxjyvctd9lapqmhbugrxfjtf7cdp0g52v0ccyr+d1fuxftt5m4j2f5dvs1wz5qp6r5yqm22shfcc7zeo4+uk+ke/kr/a2yiiyoopbg8h5zcnyqql3bxdu3c8=</latexit> <latexit sha1_base64="nojdoaorwzogkfpnydxnfgkkjlk=">aaacuxicbvhlbtraejw1r2beg+agqioilrbarww4abkhcc7cskqsibs2vunxez1khmamtbjypnllg7jcf+rx+az+gve6ewrdsyovqrrvu11zjyxdkpo1cc5dvnl12sb18mbnw7fvddfvfncmthym3ehjdzlmqaonuxqo4acywfqmyt87fnvp+5/bomh0hi4rsbvbafeiztbt8+h9xjzmndbzlwysxjzr8cmad7eisbqqehhep2br++hj7u+vj0525pudb0luek1ai5fmuvkcvzg2zklgetpwldjwf9mlljse4ripri5l2zypugrdphzqmx7ifjdzudmflm2ov+5aovjutgtj/dniv+y/iw1tzi1v5jsvw9ktax35p21wy/eybysuagtn+0vflska2p2k5sicr7n0ghervbxks2yzr3/qmlgg4ygbpzjonyauykfgtcsmnlw7rhzmcbk86/jb7jeo6hvtd4icygm0y7l3axri7kxuuo5jgvdhtkmorcjoudml06yb7kyepsf4pa+lypps8mos7/ok35c+nsgd8pg8itf5qbbjo7jdpostl+q7+uf+bq+dlcidj31rmdiduufoved+apyb3zu=</latexit> <latexit sha1_base64="nojdoaorwzogkfpnydxnfgkkjlk=">aaacuxicbvhlbtraejw1r2beg+agqioilrbarww4abkhcc7cskqsibs2vunxez1khmamtbjypnllg7jcf+rx+az+gve6ewrdsyovqrrvu11zjyxdkpo1cc5dvnl12sb18mbnw7fvddfvfncmthym3ehjdzlmqaonuxqo4acywfqmyt87fnvp+5/bomh0hi4rsbvbafeiztbt8+h9xjzmndbzlwysxjzr8cmad7eisbqqehhep2br++hj7u+vj0525pudb0luek1ai5fmuvkcvzg2zklgetpwldjwf9mlljse4ripri5l2zypugrdphzqmx7ifjdzudmflm2ov+5aovjutgtj/dniv+y/iw1tzi1v5jsvw9ktax35p21wy/eybysuagtn+0vflska2p2k5sicr7n0ghervbxks2yzr3/qmlgg4ygbpzjonyauykfgtcsmnlw7rhzmcbk86/jb7jeo6hvtd4icygm0y7l3axri7kxuuo5jgvdhtkmorcjoudml06yb7kyepsf4pa+lypps8mos7/ok35c+nsgd8pg8itf5qbbjo7jdpostl+q7+uf+bq+dlcidj31rmdiduufoved+apyb3zu=</latexit> <latexit sha1_base64="owxcxqc1natr8bw81c2jsa4ur1i=">aaacuxicbvhlbhnbebwvjwtzcoablxgwjyqsaxcoayldbbdubckmkbyw1tvb651khstml4lz+rf4bq7wr/wns7yjienli5wqutvtxvmlpkc4/t2jbty8dxtn90737r37dx729h599rz2asfckutomvcopmexsvj4ujkensk8zs7et/rxv3rewnneiwqnguzgfliabwrwe5k60g5tufujqz0uqcev8azxj0fxqvh1kgxan23qclbx+z7mvtqadqkf3k+sukjpa46kuljsdlkp4w9mtmwtel7qucypxdavyqgx3bt2wie4gzloajsg0u+bi5w7jr8ekuefdeez4iv235egtpclnyvodvt6ba0l/6dnaipetxtpqprqipwiolaclg9pxxppujbabadcywcfixiccaoh7ayodz4lqzwy/exqixwlqbu1ta2w22obwqrfzcff5rb0wd+asemwnerkbzzrn3znxj6vs99+lepuwxju0cniipujznq0g62vbkgw2c7rohi/hl0zjz/i/sg7tzs77cl7xp6zho2za/abhbixe+wb+8f+sl/r2yilyuh03rp1njop2zwk/b9wktnq</latexit> <latexit sha1_base64="hslariysm2/bvgaidkokzortcwq=">aaacxxicbvfnb9naen2yrxk+wjjcyuuvcxgibdhab1w59eyrnbrsnetj9thedt+s3xhbyiq4cesxcaxxv7jxu1jhraapi6309n4bzb6zrflsuxz/6kw3bt+5e2/jfv/bw0epn2xupf3kbe0ejorv1p1k4ffjgyosppckcgg6u3icnx5o9emzdf5ac0slcica5kywugafarbjywzslzuxqsvt1haztufvjatkzqeab8t2pixxxw+c5bjs7774efibmxyw2+p9txmrao2ghalvx0lc0aqbr1ioxpyhqcfwtzonskkjl+hc5lqum7ex0mt+wnusqjzchmcbgtdoj83fkumsdwkv88k68azxfftvswpa+4xoglmdlx5da8n/aeoaivetrpqqjjsig1tuippl7dp4lh0kuosaqdgzonbrggnbybn91khbc2g1bpo/tn2rywg1oqa21xjdlubltbhy/dwhoqp+0yqzsubuim/v2uw0hxg1vi59+7emuqfjuucni2tpjpjj0za2ufrhgsn6vw6c0zvhzja5djfcy11tsofsjxvfevao7bj9dsbgtlav7bv7zn5e+5gjkdrrrfhvsuczu1br5z9jbugi</latexit> <latexit sha1_base64="esvrn1kuwwq7sr8qgk9jlco70ci=">aaacxxicbvhlbhnbebwvr2becrxbaerkcxgwdsob5bbbjtcsksarvlbvo9vrhwueq5nejnbk4grhvoqrkl/cn/atznqjia4tjvsqqlzpdwevkp7i+fcnunx7zt17a/e7dx4+evxkfeppj29rj3agrlluoaopshockcsfx5vd0jnco+zkq6sfnalz0ppdmlu40ja1spackfctdq4tk3qpuuhdacegm3ekqiohvxy61jxynun+vch+eysxyhp3xcxb7y8vl/yng51vaw5frdgquod9mikrgjxgsaqf824v9rj+aazuninhoz3jnmp58zywet5na48viboy4jbaaxr9qdlfjj3zxqbyxlgxnig+yp9taub7p9nzcgqg0q9qlfk/bvhtst1qpklqqiowg4pacbk8xrvppunbahyaccddfc5kccaollebojr4jqzwypi3qs9ylkbw1ns2mq+qbwipzleov+ywtmc/mjbdfpxk5o1dlzntkrhak5e+/vig3ipx3kotxbu0h8moarvbkn1wwwt1xjfbyku/008owixfs2wtsefsfxvnevao7bi9ts8gtlcv7dv7wx5ge5gjkdpdwqpozc8zdq2iz38alkli7g==</latexit> <latexit sha1_base64="esvrn1kuwwq7sr8qgk9jlco70ci=">aaacxxicbvhlbhnbebwvr2becrxbaerkcxgwdsob5bbbjtcsksarvlbvo9vrhwueq5nejnbk4grhvoqrkl/cn/atznqjia4tjvsqqlzpdwevkp7i+fcnunx7zt17a/e7dx4+evxkfeppj29rj3agrlluoaopshockcsfx5vd0jnco+zkq6sfnalz0ppdmlu40ja1spackfctdq4tk3qpuuhdacegm3ekqiohvxy61jxynun+vch+eysxyhp3xcxb7y8vl/yng51vaw5frdgquod9mikrgjxgsaqf824v9rj+aazuninhoz3jnmp58zywet5na48viboy4jbaaxr9qdlfjj3zxqbyxlgxnig+yp9taub7p9nzcgqg0q9qlfk/bvhtst1qpklqqiowg4pacbk8xrvppunbahyaccddfc5kccaollebojr4jqzwypi3qs9ylkbw1ns2mq+qbwipzleov+ywtmc/mjbdfpxk5o1dlzntkrhak5e+/vig3ipx3kotxbu0h8moarvbkn1wwwt1xjfbyku/008owixfs2wtsefsfxvnevao7bi9ts8gtlcv7dv7wx5ge5gjkdpdwqpozc8zdq2iz38alkli7g==</latexit> <latexit sha1_base64="bidnl+9cqlsvii6tjsd6rvkccse=">aaacxxicbvfnb9naen2yrxk+wjhywrffqhwigw7arwovvvgkhlakk2i8hser7oe1o24bwry3jvwsrvbf+desk1tqljfwenrvjwbftfyp6smof/eio3fv3x+w87d/6pgtp892955/8bz2asfckuvomvcopmexsvj4vjkensk8zc4po/30ap2x1pzqsskphowrhrragzrvcpib1evnrepkozpczfjqvqmpsouz5seyiefxqvhtkgzagg3qel7x+57mvtqadqkf3k+sukjpa46kunj2h6nh8e+zoljjca/ouuzuts27woi2n9yekxdnsmbjgay0+mlztura8mggcl5yf54hvml/bwlae7/uwxbqonjvax35p21su/fh2kht1yrgracvtejkebc2nkuhgtqyabbohihclobaufhup3vo8fjyrchkb1jf5fharaipbdvuqwvoqzbxjr/mmhtip5kwqxacsutdxdc57zq4xiuxvvtyhtyd8dyjk8wnncfjtokauyj9cmfk+163wfjt6omo+rwp9g82p9xhl9kr9pol7d3bz0fsmi2zyn/yd/at/yqoihnrdlg2rr1nzwt2o6kvfwcoqt9d</latexit> Problem p 0 (n)a n+k + + p k (n)a n =0, 0 62 p 0 (N), p i 2 Z[n] Aim: given a 0,...,a k 1, predict the behaviour of a n as n!1. Simplified version: ``compute, when they exist,,, m, c 6= 0 such that a n c n n log m n local (at ) 1/30
3 Singularity Analysis sequence (a n ) 7! A(z) := X n 0 a n z n Generating function captures some structure A 3-Step Method: 1. Locate dominant singularities a. singularities; b. dominant ones 2. Compute local behaviour 3. Translate into asymptotics a n = 1 2 i I A(z) dz zn+1 A(z) z! c [Flajolet-Odlyzko1990] 1 z log m 1 1 z a n full asymptotic expansion available Next: computation of,, m, c c n n 1 n!1 ( ) logm n ( 62 N) 3/30
4 P-recursivity & D-finiteness (a n ) 7! A(z) := X n 0 a n z n (a n ) P-recursive A(z) D-finite p 0 (n)a n+k + + p k (n)a n =0 q 0 (z)a (`) (z)+ + q`(z)a(z) =0 Classical properties of LDEs: 1. singularities satisfy q 0 ( ) =0; 2. one can compute a basis of formal solutions at (regular) singular points, of the form convergent 1 z log m 1 1 z (1 + ), 2 Q, m 2 N. local (at ρ) More recently (M. Mezzarobba s ore_algebra_analytic): certified analytic continuation ( c numerically). Semi-decision 4/30
5 Asymptotics of P-recursive Combinatorial Sequences Thm. [Katz70,Chudnovsky85,André00] a 0 +a 1 z+ D-finite, a i integers, radius in (0, ), then its singular points are regular with rational exponents X a n n n log k 1 (n) f,,k. n (,,k)2 finite set in Q Q N Ex. The number a n of walks from the origin taking n steps {N,S,E,W,NW} and staying in the first quadrant behaves like C n n with 62 Q not D-finite. = 1+ [Bostan-Raschel-S.14] arccos(u), 8u3 8u 2 +6u 1=0, u > 0. 8/30
6 Ex: Pólya s 3D Random Walk Start from the origin in Z d ; move one step along one of the axes; repeat. What is the probability p d of returning to 0? Numerical approximation by analytic continuation: 1. u n := P(3D-walk returns to 0 in 2n steps) satisfies (2n+3)(2n+1)(n+1)u n 2(2n+3)(10n 2 +30n+23)u n+1 +36(n+2) 3 u n+2 =0 nx 2. a n := u k! c := 1 converges slowly (1 is a singularity) 1 p 3 3. k=0 Given a 0,a 1,a 2, MM s code produces 100 digits of 1 1 A(z) c 1 z + + c 2 p + + c 3 (1 + ) 1 z c = p [Watson39;Glasser-Zucker77;Koutschan et alii 13,16] c, c 2,c not accessible to the algorithms presented here. s.t. in 0.4 sec. 6/30
7 Example: Apéry s Sequences a n = nx k=0 2 2 n n + k X n, b n = a n k k k=1 1 n k 3 + X k=1 kx m=1 ( 1) m n 2m 3 k n m 2 n+k k n+m m 2 and c n = b n (3)a n have generating functions that satisfy vanishes at 0, = p = p 2 ' 0.03, 2 ' 34. z 2 (z 2 34z + 1)y (z 5)y =0 In the neighborhood of, all solutions behave like analytic µ p z(1 + ( z)analytic). Mezzarobba s code gives µ a ' 4.55, µ b ' 5.46, µ c ' 0. Slightly more work gives µ c =0, then c n and eventually, a proof that (3) is irrational. n [Apéry1978] 7/30
8 Univariate Generating Functions Aim: asymptotics of the D-FINITE DIAGONAL coefficients, automatically. ALGEBRAIC RATIONAL More structure more complete algorithm (analytic continuation Def diagonal: later. easier) Christol s conjecture: All differentially finite power series with integer coefficients and radius of convergence in (0, ) are diagonals. 9/30
9 Pringsheim s Theorem (a n ) 7! A(z) := X n 0 a n z n Useful property [Pringsheim Borel] a n 0 for all n real positive dominant singularity. A couple of years after the publication of my Thesis, Edmund Landau wrote to me to say that the German mathematician Pringsheim thought he had discovered the theorem [ ] ``But, he added, ``of course, this result is yours. [ ] what would have happened if I had not been alive to receive his letter? He would not have been undeceived and the discovery would have been thought to be mine until other readers would have restored it, not to Pringsheim but to E. Borel. J. Hadamard (1954) 10/30
10 I. Rational Generating Functions (Linear Recurrences with Constant Coefficients)
11 Fibonacci Numbers F 1 =1= 1 2 i I 1 dz 1 z z 2 z 2 a n = 1 2 i Z f(z) z n+1 dz = = As n increases, the smallest singularities dominate. F n = n n /30
12 Conway s sequence 1,11,21,1211,111221, Generating function for lengths: f(z)=p(z)/q(z) with deg Q=72. Smallest singularity: ρ l n ρ -n Fast univariate resolution: Sagraloff-Mehlhorn16 c=ρ -1 Res(f,ρ) algebraic [Conway 1987] remainder exponentially small 12/30
13 Singularity Analysis for Rational Functions Ex: 17z 3 9z 2 7z +8 dist 10-5 A 3-Step Method: 1. Locate dominant singularities a. singularities; b. dominant ones 2. Compute local behaviour 3. Translate into asymptotics? Prop. [Mahler64] Cor. Numerical resolution with sufficient precision finds the dominant roots in polynomial complexity Known to be tight only for n=2 & 3 13/30
14 II. Algebraic Generating Functions P (z,f(z)) = 0 with P (z,y) 2 Z[z,y] \{0}
15 Algebraic Generating Functions 1a. Location of possible singularities Implicit Function Theorem: P (z,y(z)) = 0 1b. Analytic continuation finds the dominant ones 2. Local behaviour (Puiseux): 3. Translation: easy: a n P (z,y(z)) = 0 c n n 1 n!1 ( ) (discriminant) with c, algebraic, rational. (1 z/ ), ( 2 Q) Numerical resolution with sufficient precision + algebraic manipulations 14/30
16 3-regular 2-connected Planar Graphs U =2G 3 +T +2U 2 = T (1 U) 3,T = z(1+b)3,b = G 3 + B 2 1+B +z B + 12 B2 define power series U(z),G 3 (z),t(z),b(z). The aim is to compute the asymptotic behaviour of [z n ]B(z). 1. Eliminating U,T,G 3 gives P = 16B 6 z z 2 (z z 1). 2. The discriminant has degree 20, but only one root in (0,1]:.102 root of 54z z z At z =, P has only 1 (double) real positive root: B( ) 4. Computing more terms gives B(z) =B( )+c Conclusion: z ± c 1 [z n ]B(z) 3c 3/2 z + 4 p n 5/2 n. with an explicit c Analytic continuation exploiting the combinatorial origin. 15/30
17 Singularity Analysis of Algebraic Series Prop. [Abel1827;Cockle1861;Harley1862;Tannery1875] Algebraic series are D-finite. Exact analytic continuation for singularity analysis via LDE: A. Compute a LDE starting from P; B. For all roots of disc(p), sorted by increasing modulus, 1. compute exactly the local branches; 2. match with numerical continuation (MM s code); 3. if a singular behaviour is encountered, return it. 16/30
18 III. Diagonals
19 If F (z) = G(z) H(z) its diagonal is Definition is a multivariate rational function with Taylor expansion F (z) = X i2n n c i z i, F (t) = X k2n c k,k,...,k t k. in this talk 1 k +1 2k k 2k k : : 1 1 x y =1+x + y +2xy + x2 + y x 2 y x (1 x y)(1 x) =1+y+1xy x2 +y x 2 y 2 + Apéry s a k : 1 1 t(1 + x)(1 + y)(1 + z)(1 + y + z + yz + xyz) =1+ +5xyzt + 17/30
20 Diagonals & Multiple Binomial Sums Ex. S n = X r 0 X n ( 1) n+r+s r s 0 n s n + s n + r 2n r s s r n Thm. Diagonals binomial sums with 1 free index. > BinomSums[sumtores](S,u): ( ) defined properly 1 1 t(1 + u 1 )(1 + u 2 )(1 u 1 u 3 )(1 u 2 u 3 ) has for diagonal the generating function of S n [Bostan-Lairez-S.17] 18/30
21 Multiple Binomial Sums over a field K Sequences constructed from - Kronecker s : n 7! n ; - geometric sequences n 7! C n, C 2 K; - the binomial sequence (n, k) 7! n k ; using algebra operations and - affine changes of indices (u n ) 7! (u (n) ); - indefinite summation (u n,k ) 7! mx k=0 u n,k!. 18 /30
22 Diagonals are Differentially Finite [Christol84,Lipshitz88] a n (z)y (n) (z)+ + a 0 (z)y(z) =0, Thm. If F has degree d in n variables, ad-finite i diag. alg. rat. ΔF satisfies a LDE with order d n, coeffs of degree d O(n). + algo in ops. Õ(d 8n ) asymptotics from that LDE Starting point: F (z) = G(z) H(z) ) F = n 1 2 i 1 I F z 1,...,z n 1, t z 1 z n 1 dz1 dz n 1 z 1 z n 1. [Bostan-Lairez-S.13,Lairez16] 19/30
23 LDE for Integrals: Griffiths-Dwork Method Basic idea: I(t) = 1. While m>1, reduce modulo and integrate by parts P Q m I P(t, x) Q m (t, x) dx J := h@ 1 Q,...,@ n Qi Q square-free Int. over a cycle where Q 0. = r+v 1@ 1 Q+ +v n Q Q m = r Q m + P Q m 1 + derivatives 2. Apply to I,I,I, until a linear dependency is found. Thm. If P/Q has degree d in n variables, I(t) satisfies a LDE with order d n, coeffs of degree d O(n). +Algo in Õ(d 8n ) Diagonals: J becomes hz 1 H z n H,..., z n n 1 H z n Hi. [Griffiths70;Christol84;Bostan-Lairez-S.13;Lairez16] 20/30
24 Bivariate Diagonals are Algebraic [Pólya21,Furstenberg67] D-finite diag. alg. = diag 2 [Bostan-Dumont-S.17] rat. Thm. F=A(x,y)/B(x,y), deg d in x and y, then ΔF cancels a polynomial of degree 4 d in y and t. x satisfies 1 x 2 y t y t y t t y t y 6 t t t y t t y 4 54 t t y t t y 2 t 3 50 t t t y t t =0 + quasi-optimal algorithm. the differential equation is often better. 21/30
25 <latexit sha1_base64="lzscpwjyul+titgoutrnnrnkddo=">aaadjxicbvjnb9qwepwgrxiktcc4clgovtqiapv0+eqh2goq4karurtselk5zmtxqune9or2czh6c/gd/bnunbasj278dpxnc7rljftp781o/gyc5upadiifle/cxuuxryxc9a8txr9xc2n51lubfubaqgqqm3srt6ckhgfkvlcxg+bppga32n9e67vvwviz6r2c5tbk+utlraqojhovhzxvupdyvm4ujniz310wwutqmuvo5ghfesmfdtfwgvdwbdzayiwei721kigo/5qyoznix967xx8auoozi1zsg1blvyo3k5+9aiw8018dl60e3wae9dwij8fk/4u/euqi2r4vtz6xobnfchqf4tyowydhucknsqgg8tvmgpudnuc0zaihecbjnfzllxcpa1xyyn1t+asgdmqegh2vh/njvrttqjgmmxfhi52z/5auplv2lkyu03md2rnatf5pgxaypb2vuucfghzno6rqfdnar4xg0obanxoacyodfsqm3a0x3fj8zkddgcjslov4abnjdakvfjzflldn1ysnus1omv4mu6zt+lq7hjkhoava/5vgz9yqj2ol0typi4bari21ygryys1oocrrwtqk7zyynt3xetby7250wzfbytyz0sqcuufukw4jyroyrv6rbtiggvxqlbbuto56n72v3jfve5pqty5rbpnt4f38dzklayq=</latexit> <latexit sha1_base64="hwqrw/oenos0hh+s6qwbunadkbs=">aaadjxicbvjnb9qwepwgrxik3ylgwsvivalf1srp8tvd1qoq4karurrsvawcz7jr1xeie0k7hej8av4ef/4jn04ixikbvwnn0wxampktp/dmnh4zjnillqbbj5z37vyfi5fmlvtx5q9ew2gvxn9ls8ii6itmzwyv4hau1nbhiqr2cgm8jrtsrgdpan33drgrm72dkxwgkr9pmujb0vhd9vuygvaeddeyggsxp3exrtcsukw5gnluscrwqcp11qbcm4h764zry7g3gjlq8z8si0djfnd7/ebta1d8zpglawoq3kzkjcpnt0ehx95cgby7qteybj0lwmpq2fzsb+qfv/vbw8xwbxznokhbo1dc2v0wyhfqconskkj8jwbbzugpcfwyhcm8ldgoq7ixinq1lizk7il8bpsoap6chzrh00lwdmlrmu0y445gomx/lsl5au0kjvym8zq2p7wa/j+2x2dyafbknrciwjsnkkjrzgi9fhplawlvxaeujhrwqbhzn1x0y/ozaq2hikttruo7zcyxjlxqwbzzxp1we55knzll/e12tzfoc+16yitiggj9bxqfwupmxkqlrr8wabvcw2rbyosem51wunaftrxfbta8va+zol/wxe+gl4po1mpsxby5te6qzrksh2slpcfbpe8e+dwab91s3fi+ev+8r963jtvrhdfcicfc+/kbm9kema==</latexit> <latexit sha1_base64="hwqrw/oenos0hh+s6qwbunadkbs=">aaadjxicbvjnb9qwepwgrxik3ylgwsvivalf1srp8tvd1qoq4karurrsvawcz7jr1xeie0k7hej8av4ef/4jn04ixikbvwnn0wxampktp/dmnh4zjnillqbbj5z37vyfi5fmlvtx5q9ew2gvxn9ls8ii6itmzwyv4hau1nbhiqr2cgm8jrtsrgdpan33drgrm72dkxwgkr9pmujb0vhd9vuygvaeddeyggsxp3exrtcsukw5gnluscrwqcp11qbcm4h764zry7g3gjlq8z8si0djfnd7/ebta1d8zpglawoq3kzkjcpnt0ehx95cgby7qteybj0lwmpq2fzsb+qfv/vbw8xwbxznokhbo1dc2v0wyhfqconskkj8jwbbzugpcfwyhcm8ldgoq7ixinq1lizk7il8bpsoap6chzrh00lwdmlrmu0y445gomx/lsl5au0kjvym8zq2p7wa/j+2x2dyafbknrciwjsnkkjrzgi9fhplawlvxaeujhrwqbhzn1x0y/ozaq2hikttruo7zcyxjlxqwbzzxp1we55knzll/e12tzfoc+16yitiggj9bxqfwupmxkqlrr8wabvcw2rbyosem51wunaftrxfbta8va+zol/wxe+gl4po1mpsxby5te6qzrksh2slpcfbpe8e+dwab91s3fi+ev+8r963jtvrhdfcicfc+/kbm9kema==</latexit> <latexit sha1_base64="oe8d4sasspmtm81kyz+etoeybgg=">aaadjxicbvlbbhmxehwwwwmfpib44cuiipsiktptuoubtqkeeknida0uh8jrnu2ser0re5ymlcvxbxwhx8mtqukjn74dby5aw0aydxrmrumzx2gmpexf/1hzlly8dpnk2tx6tfxrnzyamzff2jq3avoivak5crkfjtx0uakco8wat0ifh+hx8yp/+b6mlak+wfkgw4sptyyl4oiouentuy66l0c7tegm7fndysgmps4sjkzosxyblmjq216abyvwsmcyxsa72wedhf1pmxi8wy/dd48+lobwnvnk4tiaknbl4mlzzy9aiw/vbo0atb/jz4oeb8esnmky9kebtc8sskwegeahulwdwm9wwhcduigo6y1mwe1bj3fsmiqpnsgij2xr9uxibucwmvcupoabg5onyiffdl7jkrycfde4ne5ophp235acj9boktbvoq0tezzxkf/ldxkmnwwlqbmcqyvfodhxffna2uijaucgmjnahzfochut7palzrw6m6dhrkrjwnv0n9k4gpjncos8zcqz2zgnus1wfx+l3dawfa3ddbltnact/s1cz7ogvmul0lypc4fari21ygr8ss1bmcyqxkpk3tkynpxrpojvdhqd4i3f3hu2thkn3cx3sjse5dhzi6/ipuktqx7v1mu3a3e8l95x75v3fvhq1zy9t8ip8h7+btcpavc=</latexit> Summary of this part Prop. Algebraic series are the diagonals of bivariate rational functions. Diagonals are D-finite; they are closed under sum, product, Hadamard product; their coefficients are multiple binomial sums (and conversely). D-finite diag. alg. rat. Christol s conjecture: All D- finite power series with integer coefficients and radius of convergence in (0, ) are diagonals F, 4 9, , z? = (?) All these properties are effective, with good bounds and complexity. asymptotics from the LDE [Pólya21,Furstenberg67,Christol84,BostanLairezS.13,Lairez16,BostanDumontS.17] 21 /30
26 IV. Analytic Combinatorics in Several Variables, with Computer Algebra Wanted: complete algorithms, good complexity, more cases with `explicit c. Solution: 1. restrict to simplest class; 2. avoid amoebas and deal only with polynomial systems; 3. control all degrees & sizes.
27 Coefficients of Diagonals F (z) = G(z) H(z) c k,...,k = 1 2 i n Z T G(z) H(z) dz 1 dz n (z 1 z n ) k+1 Critical points: minimize z 1 z n on V = {z H(z) @z 1 z n 1 z n n! apple 1 1 = = n Minimal ones: on the boundary of the domain of convergence. i.e. J from G-D method A 3-step method 1a. locate the critical points (algebraic condition); 1b. find the minimal ones (semi-algebraic condition); 2. translate (easy in simple cases). Analytic continuation from the rational function Def. F(z 1,,z n ) is combinatorial if every coefficient is 0. Prop. [PemantleWilson] In the combinatorial case, one of the minimal critical points has positive real coordinates. 22/30
28 Ex.: Central Binomial Coefficients 2k k : 1 1 x y =1+x + y +2xy + x2 + y x 2 y 2 + (1). Critical points: 1 x y =0,x= y =) x = y =1/2. (2). Minimal ones. Easy. In general, this is the difficult step. (3). Analysis close to the minimal critical point: a k = 1 ZZ (2 i) 2 Z 4k+1 2 i 1 1 x y dx dy (xy) k i exp(4(k + 1)(x 1/2) 2 ) dx 4k p k. Z dx (x(1 x)) k+1 residue saddle-point approx 23/30
29 Kronecker Representation for the Critical Points Algebraic part: ``compute the solutions of the system H(z) =0 1 = = n If Under genericity assumptions, a probabilistic algorithm running in bit ops finds: History and Background: see Castro, Pardo, Hägele, and Morais (2001) [Giusti-Lecerf-S.01;Schost02;SafeySchost16] System reduced to a univariate polynomial. 24/30
30 Example (Lattice Path Model) The number of walks from the origin taking steps {NW,NE,SE,SW} and staying in the first quadrant is F, F (x, y, t) = (1 + x)(1 + y) 1 t(1 + x 2 + y 2 + x 2 y 2 ) Kronecker representation of the critical points: P (u) =4u u u u Q x (u) = 336u u Q y (u) = 160u u Q t (u) =4u u u/ /2 ie, they are given by: P (u) =0, x = Q x(u) P 0 (u), y = Q y(u) P 0 (u), t = Q t(u) P 0 (u) Which one of these 4 is minimal? 25/30
31 Testing Minimality F = 1 H = 1 (1 x y)(20 x 40y) 1 Critical point : x(2x + 41y 21) = y(41x + 80y 60) 4 critical points, 2 of which are real: (x 1,y 1 )=(0.2528, ), (x 2,y 2 )=( , ) Add H(tx, ty) =0and compute a Kronecker representation: P (u) =0, x = Q x(u) P 0 (u), y = Q y(u) P 0 (u), Solve numerically and keep the real positive sols: t = Q t(u) P 0 (u) (0.31, 0.55, 0.99), (0.31, 0.55, 1.71), (0.25, 9.99, 0.09), (0.25, 0.99, 0.99) (x 1,y 1 ) is not minimal, (x 2,y 2 ) is. 26/30
32 Algorithm and Complexity Thm. If F (z) is combinatorial, then under regularity conditions, the points contributing to dominant diagonal asymptotics can be determined in Õ(hd 5 D 4 ) bit operations. Each contribution has the form A k = T k k (1 n)/2 (2 ) (1 n)/2 (C + O(1/k)) T, C can be found to 2 apple precision in Õ(h(dD) 3 + Dapple) bit ops. explicit algebraic numbers [Melczer-S.16] half-integer This result covers the easiest cases. All conditions hold generically and can be checked within the same complexity, except combinatoriality. 27/30
33 Example: Apéry's sequence 1 1 t(1 + x)(1 + y)(1 + z)(1 + y + z + yz + xyz) =1+ +5xyzt + Kronecker representation of the critical points: x = 2u 1006 P 0 (u) P (u) =u 2 366u u , y = z = P 0, t = (u) P 0 (u) There are two real critical points, and one is positive. After testing minimality, one has proved asymptotics 28/30
34 Example: Restricted Words in Factors F (x, y) = 1 x 3 y 6 + x 3 y 4 + x 2 y 4 + x 2 y 3 1 x y + x 2 y 3 x 3 y 3 x 4 y 4 x 3 y 6 + x 4 y 6 words over {0,1} without or /30
35 Summary & Conclusion D-finite diag. alg. rat. In many cases, LDE + certified analytic continuation works. Diagonals are a nice and important class of generating functions for which we now have many good algorithms. ACSV can be made effective (at least in simple cases) and recovers explicit constants. Complexity issues become clearer. Work in progress: extend beyond some of the assumptions The End 30/30
Algorithmic Tools for the Asymptotics of Linear Recurrences
Algorithmic Tools for the Asymptotics of Linear Recurrences Bruno Salvy Inria & ENS de Lyon Computer Algebra in Combinatorics, Schrödinger Institute, Vienna, Nov. 2017 Motivation p 0 (n)a n+k + + p k (n)a
More informationAlgorithmic Tools for the Asymptotics of Diagonals
Algorithmic Tools for the Asymptotics of Diagonals Bruno Salvy Inria & ENS de Lyon Lattice walks at the Interface of Algebra, Analysis and Combinatorics September 19, 2017 Asymptotics & Univariate Generating
More informationDiagonals: Combinatorics, Asymptotics and Computer Algebra
Diagonals: Combinatorics, Asymptotics and Computer Algebra Bruno Salvy Inria & ENS de Lyon Families of Generating Functions (a n ) 7! A(z) := X n 0 a n z n counts the number of objects of size n captures
More informationSymbolic-Numeric Tools for Multivariate Asymptotics
Symbolic-Numeric Tools for Multivariate Asymptotics Bruno Salvy Joint work with Stephen Melczer to appear in Proc. ISSAC 2016 FastRelax meeting May 25, 2016 Combinatorics, Randomness and Analysis From
More informationLinear Differential Equations as a Data-Structure
Linear Differential Equations as a Data-Structure Bruno Salvy Inria & ENS de Lyon FoCM, July 14, 2017 Computer Algebra Effective mathematics: what can we compute exactly? And complexity: how fast? (also,
More informationDiagonals and Walks. Alin Bostan 1 Louis Dumont 1 Bruno Salvy 2. November 4, Introduction Diagonals Walks. 1 INRIA, SpecFun.
and Alin Bostan 1 Louis Dumont 1 Bruno Salvy 2 1 INRIA, SpecFun 2 INRIA, AriC November 4, 2014 1/16 Louis Dumont and 2/16 Louis Dumont and Motivations In combinatorics: Lattice walks w i,j : number of
More information1. Find the Taylor series expansion about 0 of the following functions:
MAP 4305 Section 0642 3 Intermediate Differential Equations Assignment 1 Solutions 1. Find the Taylor series expansion about 0 of the following functions: (i) f(z) = ln 1 z 1+z (ii) g(z) = 1 cos z z 2
More informationLECTURE 5, FRIDAY
LECTURE 5, FRIDAY 20.02.04 FRANZ LEMMERMEYER Before we start with the arithmetic of elliptic curves, let us talk a little bit about multiplicities, tangents, and singular points. 1. Tangents How do we
More informationFast Computation of the Nth Term of an Algebraic Series over a Finite Prime Field
Fast Computation of the Nth Term of an Algebraic Series over a Finite Prime Field Alin Bostan 1 Gilles Christol 2 Philippe Dumas 1 1 Inria (France) 2 Institut de mathématiques de Jussieu (France) Specfun
More information7 Asymptotics for Meromorphic Functions
Lecture G jacques@ucsd.edu 7 Asymptotics for Meromorphic Functions Hadamard s Theorem gives a broad description of the exponential growth of coefficients in power series, but the notion of exponential
More informationPower series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) a n z n. n=0
Lecture 22 Power series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) Recall a few facts about power series: a n z n This series in z is centered at z 0. Here z can
More informationOn (Effective) Analytic Combinatorics
On (Effective) Analytic Combinatorics Bruno Salvy Inria & ENS de Lyon Séminaire Algorithmes Dec. 2017 Combinatorics, Randomness and Analysis From simple local rules, a global structure arises. A quest
More informationMath Homework 2
Math 73 Homework Due: September 8, 6 Suppose that f is holomorphic in a region Ω, ie an open connected set Prove that in any of the following cases (a) R(f) is constant; (b) I(f) is constant; (c) f is
More informationPhilippe Flajolet and Symbolic Computation
Philippe Flajolet and Symbolic Computation Bruno Salvy 1. Combinatorics and Analysis of Algorithms 4 2. Complex Analysis 5 3. Symbolic Computation 7 While Philippe Flajolet did not publish many articles
More informationEfficient Experimental Mathematics for Lattice Path Combinatorics
1/45 Efficient Experimental Mathematics for Lattice Path Combinatorics Alin Bostan based on joint works with M. Bousquet-Mélou, F. Chyzak, M. van Hoeij, M. Kauers, S. Melczer, L. Pech, K. Raschel, B. Salvy
More informationLucas Congruences. A(n) = Pure Mathematics Seminar University of South Alabama. Armin Straub Oct 16, 2015 University of South Alabama.
Pure Mathematics Seminar University of South Alabama Oct 6, 205 University of South Alabama A(n) = n k=0 ( ) n 2 ( n + k k k ) 2, 5, 73, 445, 3300, 89005, 2460825,... Arian Daneshvar Amita Malik Zhefan
More informationCombinatorial/probabilistic analysis of a class of search-tree functionals
Combinatorial/probabilistic analysis of a class of search-tree functionals Jim Fill jimfill@jhu.edu http://www.mts.jhu.edu/ fill/ Mathematical Sciences The Johns Hopkins University Joint Statistical Meetings;
More informationIntroduction to Techniques for Counting
Introduction to Techniques for Counting A generating function is a device somewhat similar to a bag. Instead of carrying many little objects detachedly, which could be embarrassing, we put them all in
More informationFourth Week: Lectures 10-12
Fourth Week: Lectures 10-12 Lecture 10 The fact that a power series p of positive radius of convergence defines a function inside its disc of convergence via substitution is something that we cannot ignore
More informationClosed Form Solutions
Closed Form Solutions Mark van Hoeij 1 Florida State University Slides of this talk: www.math.fsu.edu/ hoeij/issac2017.pdf 1 Supported by NSF 1618657 1 / 29 What is a closed form solution? Example: Solve
More informationMultiple binomial sums
Multiple binomial sums Alin Bostan, Pierre Lairez, Bruno Salvy To cite this version: Alin Bostan, Pierre Lairez, Bruno Salvy. Multiple binomial sums. Journal of Symbolic Computation, Elsevier, 207, 80
More information5.4 Bessel s Equation. Bessel Functions
SEC 54 Bessel s Equation Bessel Functions J (x) 87 # with y dy>dt, etc, constant A, B, C, D, K, and t 5 HYPERGEOMETRIC ODE At B (t t )(t t ), t t, can be reduced to the hypergeometric equation with independent
More informationBon anniversaire Marc!
Bon anniversaire Marc! The full counting function of Gessel walks is algebraic Alin Bostan (INRIA) joint work with Manuel Kauers (INRIA/RISC) Journées GECKO/TERA 2008 Context: restricted lattice walks
More informationGENERATING FUNCTIONS AND CENTRAL LIMIT THEOREMS
GENERATING FUNCTIONS AND CENTRAL LIMIT THEOREMS Michael Drmota Institute of Discrete Mathematics and Geometry Vienna University of Technology A 1040 Wien, Austria michael.drmota@tuwien.ac.at http://www.dmg.tuwien.ac.at/drmota/
More informationSeries Solutions. 8.1 Taylor Polynomials
8 Series Solutions 8.1 Taylor Polynomials Polynomial functions, as we have seen, are well behaved. They are continuous everywhere, and have continuous derivatives of all orders everywhere. It also turns
More informationMath 2 Variable Manipulation Part 2 Powers & Roots PROPERTIES OF EXPONENTS:
Math 2 Variable Manipulation Part 2 Powers & Roots PROPERTIES OF EXPONENTS: 1 EXPONENT REVIEW PROBLEMS: 2 1. 2x + x x + x + 5 =? 2. (x 2 + x) (x + 2) =?. The expression 8x (7x 6 x 5 ) is equivalent to?.
More information1. multiplication is commutative and associative;
Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.
More informationLinear differential and recurrence equations viewed as data-structures
Linear differential and recurrence equations viewed as data-structures Bruno Salvy Inria & ENS de Lyon Leçons de Mathématiques et d'informatique d'aujourd'hui Bordeaux, Mai 2015 Computer Algebra Effective
More informationPolynomials over finite fields. Algorithms and Randomness
Polynomials over Finite Fields: Algorithms and Randomness School of Mathematics and Statistics Carleton University daniel@math.carleton.ca AofA 10, July 2010 Introduction Let q be a prime power. In this
More informationAlgebraic. techniques1
techniques Algebraic An electrician, a bank worker, a plumber and so on all have tools of their trade. Without these tools, and a good working knowledge of how to use them, it would be impossible for them
More informationClosed Form Solutions
Closed Form Solutions Mark van Hoeij 1 Florida State University ISSAC 2017 1 Supported by NSF 1618657 1 / 26 What is a closed form solution? Example: Solve this equation for y = y(x). y = 4 x 3 (1 x) 2
More informationand the compositional inverse when it exists is A.
Lecture B jacques@ucsd.edu Notation: R denotes a ring, N denotes the set of sequences of natural numbers with finite support, is a generic element of N, is the infinite zero sequence, n 0 R[[ X]] denotes
More informationare the q-versions of n, n! and . The falling factorial is (x) k = x(x 1)(x 2)... (x k + 1).
Lecture A jacques@ucsd.edu Notation: N, R, Z, F, C naturals, reals, integers, a field, complex numbers. p(n), S n,, b(n), s n, partition numbers, Stirling of the second ind, Bell numbers, Stirling of the
More informationLocal Parametrization and Puiseux Expansion
Chapter 9 Local Parametrization and Puiseux Expansion Let us first give an example of what we want to do in this section. Example 9.0.1. Consider the plane algebraic curve C A (C) defined by the equation
More informationSolving Differential Equations Using Power Series
LECTURE 25 Solving Differential Equations Using Power Series We are now going to employ power series to find solutions to differential equations of the form (25.) y + p(x)y + q(x)y = 0 where the functions
More informationNetworks: Lectures 9 & 10 Random graphs
Networks: Lectures 9 & 10 Random graphs Heather A Harrington Mathematical Institute University of Oxford HT 2017 What you re in for Week 1: Introduction and basic concepts Week 2: Small worlds Week 3:
More informationSolving Differential Equations Using Power Series
LECTURE 8 Solving Differential Equations Using Power Series We are now going to employ power series to find solutions to differential equations of the form () y + p(x)y + q(x)y = 0 where the functions
More information2.1 Affine and Projective Coordinates
1 Introduction Depending how you look at them, elliptic curves can be deceptively simple. Using one of the easier definitions, we are just looking at points (x,y) that satisfy a cubic equation, something
More informationMTH4101 CALCULUS II REVISION NOTES. 1. COMPLEX NUMBERS (Thomas Appendix 7 + lecture notes) ax 2 + bx + c = 0. x = b ± b 2 4ac 2a. i = 1.
MTH4101 CALCULUS II REVISION NOTES 1. COMPLEX NUMBERS (Thomas Appendix 7 + lecture notes) 1.1 Introduction Types of numbers (natural, integers, rationals, reals) The need to solve quadratic equations:
More informationIntroduction to Arithmetic Geometry Fall 2013 Lecture #2 09/10/2013
18.78 Introduction to Arithmetic Geometry Fall 013 Lecture # 09/10/013.1 Plane conics A conic is a plane projective curve of degree. Such a curve has the form C/k : ax + by + cz + dxy + exz + fyz with
More informationReview of Power Series
Review of Power Series MATH 365 Ordinary Differential Equations J. Robert Buchanan Department of Mathematics Fall 2018 Introduction In addition to the techniques we have studied so far, we may use power
More information1 Assignment 1: Nonlinear dynamics (due September
Assignment : Nonlinear dynamics (due September 4, 28). Consider the ordinary differential equation du/dt = cos(u). Sketch the equilibria and indicate by arrows the increase or decrease of the solutions.
More informationMath 259: Introduction to Analytic Number Theory Functions of finite order: product formula and logarithmic derivative
Math 259: Introduction to Analytic Number Theory Functions of finite order: product formula and logarithmic derivative This chapter is another review of standard material in complex analysis. See for instance
More informationFinding Hyperexponential Solutions of Linear ODEs by Numerical Evaluation
Finding Hyperexponential Solutions of Linear ODEs by Numerical Evaluation Fredrik Johansson* 1 Manuel Kauers* 1 Marc Mezzarobba* 1,2 *RISC-Linz ISSAC 2013, Boston, MA 1 Supported by the Austrian Science
More informationGenerating Functions
Semester 1, 2004 Generating functions Another means of organising enumeration. Two examples we have seen already. Example 1. Binomial coefficients. Let X = {1, 2,..., n} c k = # k-element subsets of X
More informationCongruences for algebraic sequences
Congruences for algebraic sequences Eric Rowland 1 Reem Yassawi 2 1 Université du Québec à Montréal 2 Trent University 2013 September 27 Eric Rowland (UQAM) Congruences for algebraic sequences 2013 September
More informationMath 259: Introduction to Analytic Number Theory Functions of finite order: product formula and logarithmic derivative
Math 259: Introduction to Analytic Number Theory Functions of finite order: product formula and logarithmic derivative This chapter is another review of standard material in complex analysis. See for instance
More informationComplex Analysis Slide 9: Power Series
Complex Analysis Slide 9: Power Series MA201 Mathematics III Department of Mathematics IIT Guwahati August 2015 Complex Analysis Slide 9: Power Series 1 / 37 Learning Outcome of this Lecture We learn Sequence
More informationNotes on generating functions in automata theory
Notes on generating functions in automata theory Benjamin Steinberg December 5, 2009 Contents Introduction: Calculus can count 2 Formal power series 5 3 Rational power series 9 3. Rational power series
More informationAn example of generalization of the Bernoulli numbers and polynomials to any dimension
An example of generalization of the Bernoulli numbers and polynomials to any dimension Olivier Bouillot, Villebon-Georges Charpak institute, France C.A.L.I.N. team seminary. Tuesday, 29 th March 26. Introduction
More informationA2 HW Imaginary Numbers
Name: A2 HW Imaginary Numbers Rewrite the following in terms of i and in simplest form: 1) 100 2) 289 3) 15 4) 4 81 5) 5 12 6) -8 72 Rewrite the following as a radical: 7) 12i 8) 20i Solve for x in simplest
More informationAlgebra One Dictionary
Algebra One Dictionary Page 1 of 17 A Absolute Value - the distance between the number and 0 on a number line Algebraic Expression - An expression that contains numbers, operations and at least one variable.
More informationTHE PYTHAGOREAN THEOREM
THE STORY SO FAR THE PYTHAGOREAN THEOREM USES OF THE PYTHAGOREAN THEOREM USES OF THE PYTHAGOREAN THEOREM SOLVE RIGHT TRIANGLE APPLICATIONS USES OF THE PYTHAGOREAN THEOREM SOLVE RIGHT TRIANGLE APPLICATIONS
More informationMath Assignment 11
Math 2280 - Assignment 11 Dylan Zwick Fall 2013 Section 8.1-2, 8, 13, 21, 25 Section 8.2-1, 7, 14, 17, 32 Section 8.3-1, 8, 15, 18, 24 1 Section 8.1 - Introduction and Review of Power Series 8.1.2 - Find
More informationarxiv: v1 [cs.sc] 15 Oct 2015
ALGEBRAIC DIAGONALS AND WALKS: ALGORITHMS, BOUNDS, COMPLEXITY ALIN BOSTAN, LOUIS DUMONT, AND BRUNO SALVY arxiv:1510.04526v1 [cs.sc] 15 Oct 2015 Abstract. The diagonal of a multivariate power series F is
More informationINFINITE SEQUENCES AND SERIES
11 INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES In section 11.9, we were able to find power series representations for a certain restricted class of functions. INFINITE SEQUENCES AND SERIES
More informationCore A-level mathematics reproduced from the QCA s Subject criteria for Mathematics document
Core A-level mathematics reproduced from the QCA s Subject criteria for Mathematics document Background knowledge: (a) The arithmetic of integers (including HCFs and LCMs), of fractions, and of real numbers.
More informationHere are brief notes about topics covered in class on complex numbers, focusing on what is not covered in the textbook.
Phys374, Spring 2008, Prof. Ted Jacobson Department of Physics, University of Maryland Complex numbers version 5/21/08 Here are brief notes about topics covered in class on complex numbers, focusing on
More informationTaylor Expansions with Finite Radius of Convergence Work of Robert Jentzsch, 1917
Polynomial Families with Interesting Zeros Robert Boyer Drexel University April 30, 2010 Taylor Expansions with Finite Radius of Convergence Work of Robert Jentzsch, 1917 Partial Sums of Geometric Series
More informationMA094 Part 2 - Beginning Algebra Summary
MA094 Part - Beginning Algebra Summary Page of 8/8/0 Big Picture Algebra is Solving Equations with Variables* Variable Variables Linear Equations x 0 MA090 Solution: Point 0 Linear Inequalities x < 0 page
More informationPart 2 - Beginning Algebra Summary
Part - Beginning Algebra Summary Page 1 of 4 1/1/01 1. Numbers... 1.1. Number Lines... 1.. Interval Notation.... Inequalities... 4.1. Linear with 1 Variable... 4. Linear Equations... 5.1. The Cartesian
More informationOn the Sequence A and Its Combinatorial Interpretations
1 2 47 6 2 11 Journal of Integer Sequences, Vol. 9 (2006), Article 06..1 On the Sequence A079500 and Its Combinatorial Interpretations A. Frosini and S. Rinaldi Università di Siena Dipartimento di Scienze
More informationChapter 11. Taylor Series. Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27
Chapter 11 Taylor Series Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27 First-Order Approximation We want to approximate function f by some simple function. Best possible approximation
More informationFINAL REVIEW Answers and hints Math 311 Fall 2017
FINAL RVIW Answers and hints Math 3 Fall 7. Let R be a Jordan region and let f : R be integrable. Prove that the graph of f, as a subset of R 3, has zero volume. Let R be a rectangle with R. Since f is
More informationLattice paths with catastrophes
Lattice paths with catastrophes Lattice paths with catastrophes SLC 77, Strobl 12.09.2016 Cyril Banderier and Michael Wallner Laboratoire d Informatique de Paris Nord, Université Paris Nord, France Institute
More informationChapter One Hilbert s 7th Problem: It s statement and origins
Chapter One Hilbert s 7th Problem: It s statement and origins At the second International Congress of athematicians in Paris, 900, the mathematician David Hilbert was invited to deliver a keynote address,
More informationComputing Monodromy Groups Defined by Plane Algebraic Curves. Adrien Poteaux
Algorithms Seminar 2006 2007, F. Chyzak (ed.), INRIA Available online at the URL http://algo.inria.fr/seminars/. Computing Monodromy Groups Defined by Plane Algebraic Curves Adrien Poteaux Xlim-Dmi, umr
More informationChapter 11 - Sequences and Series
Calculus and Analytic Geometry II Chapter - Sequences and Series. Sequences Definition. A sequence is a list of numbers written in a definite order, We call a n the general term of the sequence. {a, a
More informationMahler measure as special values of L-functions
Mahler measure as special values of L-functions Matilde N. Laĺın Université de Montréal mlalin@dms.umontreal.ca http://www.dms.umontreal.ca/~mlalin CRM-ISM Colloquium February 4, 2011 Diophantine equations
More informationSolutions for Problem Set #5 due October 17, 2003 Dustin Cartwright and Dylan Thurston
Solutions for Problem Set #5 due October 17, 23 Dustin Cartwright and Dylan Thurston 1 (B&N 6.5) Suppose an analytic function f agrees with tan x, x 1. Show that f(z) = i has no solution. Could f be entire?
More informationCongruences for combinatorial sequences
Congruences for combinatorial sequences Eric Rowland Reem Yassawi 2014 February 12 Eric Rowland Congruences for combinatorial sequences 2014 February 12 1 / 36 Outline 1 Algebraic sequences 2 Automatic
More informationUnit 2 Rational Functionals Exercises MHF 4UI Page 1
Unit 2 Rational Functionals Exercises MHF 4UI Page Exercises 2.: Division of Polynomials. Divide, assuming the divisor is not equal to zero. a) x 3 + 2x 2 7x + 4 ) x + ) b) 3x 4 4x 2 2x + 3 ) x 4) 7. *)
More information5. Analytic Combinatorics
ANALYTIC COMBINATORICS P A R T O N E 5. Analytic Combinatorics http://aofa.cs.princeton.edu Analytic combinatorics is a calculus for the quantitative study of large combinatorial structures. Features:
More informationQuantum Field Theory Homework 3 Solution
Quantum Field Theory Homework 3 Solution 1 Complex Gaußian Integrals Consider the integral exp [ ix 2 /2 ] dx (1) First show that it is not absolutely convergent. Then we should define it as Next, show
More informationDe part en retraite de Pierre
Introduction Combinatorics Generating Series Oracle Conclusion De part en retraite de Pierre Villetaneuse, fe vrier 2013 1 / 41 De part en retraite de Pierre Introduction Combinatorics Generating Series
More informationMSM120 1M1 First year mathematics for civil engineers Revision notes 4
MSM10 1M1 First year mathematics for civil engineers Revision notes 4 Professor Robert A. Wilson Autumn 001 Series A series is just an extended sum, where we may want to add up infinitely many numbers.
More informationContents. 2 Partial Derivatives. 2.1 Limits and Continuity. Calculus III (part 2): Partial Derivatives (by Evan Dummit, 2017, v. 2.
Calculus III (part 2): Partial Derivatives (by Evan Dummit, 2017, v 260) Contents 2 Partial Derivatives 1 21 Limits and Continuity 1 22 Partial Derivatives 5 23 Directional Derivatives and the Gradient
More information12d. Regular Singular Points
October 22, 2012 12d-1 12d. Regular Singular Points We have studied solutions to the linear second order differential equations of the form P (x)y + Q(x)y + R(x)y = 0 (1) in the cases with P, Q, R real
More informationOn rational approximation of algebraic functions. Julius Borcea. Rikard Bøgvad & Boris Shapiro
On rational approximation of algebraic functions http://arxiv.org/abs/math.ca/0409353 Julius Borcea joint work with Rikard Bøgvad & Boris Shapiro 1. Padé approximation: short overview 2. A scheme of rational
More informationALGEBRAIC GEOMETRY HOMEWORK 3
ALGEBRAIC GEOMETRY HOMEWORK 3 (1) Consider the curve Y 2 = X 2 (X + 1). (a) Sketch the curve. (b) Determine the singular point P on C. (c) For all lines through P, determine the intersection multiplicity
More informationPhilippe Flajolet & Analytic Combinatorics: Inherent Ambiguity of Context-Free Languages
Philippe Flajolet & Analytic Combinatorics: Inherent Ambiguity of Context-Free Languages Frédérique Bassino and Cyril Nicaud LIGM, Université Paris-Est & CNRS December 16, 2011 I first met Philippe in
More informationAutomatisches Beweisen von Identitäten
Automatisches Beweisen von Identitäten Stefan Gerhold 30. Oktober 2006 The General Scheme Parametric sums summand(n, k) = answer(n) Parametric integrals k integrand(x, y)dy = answer(x) Zeilberger s Summation
More informationCongruent Numbers, Elliptic Curves, and Elliptic Functions
Congruent Numbers, Elliptic Curves, and Elliptic Functions Seongjin Cho (Josh) June 6, 203 Contents Introduction 2 2 Congruent Numbers 2 2. A certain cubic equation..................... 4 3 Congruent Numbers
More informationA field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:
Byte multiplication 1 Field arithmetic A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties: F is an abelian group under addition, meaning - F is closed under
More informationDIFFERENTIATION RULES
3 DIFFERENTIATION RULES DIFFERENTIATION RULES We have: Seen how to interpret derivatives as slopes and rates of change Seen how to estimate derivatives of functions given by tables of values Learned how
More informationProblem 1A. Suppose that f is a continuous real function on [0, 1]. Prove that
Problem 1A. Suppose that f is a continuous real function on [, 1]. Prove that lim α α + x α 1 f(x)dx = f(). Solution: This is obvious for f a constant, so by subtracting f() from both sides we can assume
More informationAS PURE MATHS REVISION NOTES
AS PURE MATHS REVISION NOTES 1 SURDS A root such as 3 that cannot be written exactly as a fraction is IRRATIONAL An expression that involves irrational roots is in SURD FORM e.g. 2 3 3 + 2 and 3-2 are
More informationSecondary Curriculum Maps
Secondary Curriculum Maps Cumberland Valley School District Soaring to Greatness, Committed to Excellence Algebra CVSD Math Curriculum Map ~ Algebra PA Core Standard CC.2.2.8.B.3 Analyze and solve linear
More informationMathematics 324 Riemann Zeta Function August 5, 2005
Mathematics 324 Riemann Zeta Function August 5, 25 In this note we give an introduction to the Riemann zeta function, which connects the ideas of real analysis with the arithmetic of the integers. Define
More information2. Intersection Multiplicities
2. Intersection Multiplicities 11 2. Intersection Multiplicities Let us start our study of curves by introducing the concept of intersection multiplicity, which will be central throughout these notes.
More informationHigher order asymptotics from multivariate generating functions
Higher order asymptotics from multivariate generating functions Mark C. Wilson, University of Auckland (joint with Robin Pemantle, Alex Raichev) Rutgers, 2009-11-19 Outline Preliminaries References Our
More informationSeries Solution of Linear Ordinary Differential Equations
Series Solution of Linear Ordinary Differential Equations Department of Mathematics IIT Guwahati Aim: To study methods for determining series expansions for solutions to linear ODE with variable coefficients.
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include
PUTNAM TRAINING POLYNOMIALS (Last updated: December 11, 2017) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationBinomial Coefficient Identities/Complements
Binomial Coefficient Identities/Complements CSE21 Fall 2017, Day 4 Oct 6, 2017 https://sites.google.com/a/eng.ucsd.edu/cse21-fall-2017-miles-jones/ permutation P(n,r) = n(n-1) (n-2) (n-r+1) = Terminology
More informationSummations in Bernoulli s Triangles via Generating Functions
2 3 47 6 23 Journal of Integer Sequences, Vol 20 (207, Article 73 Summations in Bernoulli s Triangles via Generating Functions Kamilla Oliver 9 Stellenberg Road 730 Somerset West Sout Africa olikamilla@gmailcom
More informationIntroduction to Number Theory
INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: N={0,1,, }. Integers: Z={0,±1,±, }. Definition: Divisor If a Z can be writeen as a=bc where b, c Z, then we say a is divisible by b or,
More informationGeneralized Lucas Sequences Part II
Introduction Generalized Lucas Sequences Part II Daryl DeFord Washington State University February 4, 2013 Introduction Èdouard Lucas: The theory of recurrent sequences is an inexhaustible mine which contains
More informationFrom the Discrete to the Continuous, and Back... Philippe Flajolet INRIA, France
From the Discrete to the Continuous, and Back... Philippe Flajolet INRIA, France 1 Discrete structures in... Combinatorial mathematics Computer science: data structures & algorithms Information and communication
More informationIs Analysis Necessary?
Is Analysis Necessary? Ira M. Gessel Brandeis University Waltham, MA gessel@brandeis.edu Special Session on Algebraic and Analytic Combinatorics AMS Fall Eastern Meeting University of Connecticut, Storrs
More informationMahler measure and special values of L-functions
Mahler measure and special values of L-functions Matilde N. Laĺın University of Alberta mlalin@math.ualberta.ca http://www.math.ualberta.ca/~mlalin October 24, 2008 Matilde N. Laĺın (U of A) Mahler measure
More information