ASYMPTOTICS OF THE EULERIAN NUMBERS REVISITED: A LARGE DEVIATION ANALYSIS
|
|
- Stanley Jackson
- 6 years ago
- Views:
Transcription
1 ASYMPTOTICS OF THE EULERIAN NUMBERS REVISITED: A LARGE DEVIATION ANALYSIS GUY LOUCHARD ABSTRACT Using the Saddle point method and multiseries expansions we obtain from the generating function of the Eulerian numbers A nk and Cauchy s integral formula asymptotic results in non-central region In the region k = n n α > α > /2 we analyze the dependence of A nk on α This paper fits within the framework of Analytic Combinatorics INTRODUCTION The Eulerian numbers A nk have been the object of renewed interest recently see for instance Janson [0] They are defined by the recurrence A n+k = n k + 2A nk + k A nk 0 k n The initial conditions vary in the litterature We choose here A 00 = 0 A 0 = This is used for instance in Bender [2] and Flajolet and Sedgewick [6] chv I I I The Eulerian numbers correspond for instance to runs in permutations Let us mention OEIS [] A which stores these numbers and gives many references to the litterature The bivariate generating function exponential in z ordinary in w is given by We have g z w := n=0 k=0 k=0 A nk A nk z n w k = = w w e w z w hence we can define a random variable RV J n this corresponds to the number of runs in a random permutation such that P[J n = k] = A nk From Flajolet and Sedgewick [6] chi X we know that the roots of the denominator are with h j w = f w + 2ij π w j Z f w = w lnw As w f w is close to whereas the other poles h j w with j 0 escape to infinity This fact is consistent with the limit form g z = z which has only one simple pole at If one restricts w to w 2 there is clearly at most one root of the denominator in z 2 given by f w Thus we have for w close enough to g z w = f w + Rz w z Date: June Mathematics Subject Classification 05A6 60C05 60F05 Key words and phrases Eulerian numbers Asymptotics Saddle point method Multiseries expansions Analytic Combinatorics
2 2 GUY LOUCHARD with Rz w analytic in z 2 and [z n ]g z w = f w n+ + O 2 n Notice that f w does not correspond to a discrete RV but if we set w = e t f e t n+ corresponds to a sum of n + independent RV uniformly distributed on [0] see for instance Tanny [4] In the rest of this paper we set m := n + µ := m The corresponding mean and variance are given by M = m 2 σ 2 = m 2 The generating function of the mean and second moment are given respectively by 2 z 2 z z 3 They are obtained either from M and σ 2 or more simply by setting w = e t in f w z and differentiating wrt t Note that the exact mean and second moment generating functions are derived from g z w as 2 2z + z 2 2 z 2 6 2z + 5z 2 7z 3 + z 4 6 z 3 Of course asymptotically by classical singularity analysis exact and asymptotic moments are the same In the central region k = M + xσ x = O J n is asymptotically normal This has first been proved by David an Barton [4] Without being exhaustive a very complete bibliography can be found in Janson [0] let us also mention Bender [2] Carlitz et al [3] Tanny [4] The first two terms of a correction were given in Sira zdinov [5] and Nicolas [3] A complete analysis is given in Gawronski and Neuschel [7]: There exists polynomials q ν ν such that for any l 0 as n uniformly for all k Z A nk = 6 /2 πm e x2 + q ν x = 2 ν H 2ν+2s x6 s x = k m 2 2 m l q ν x ν= ν j = m ν k j! + O m l 3/2 B 2j +2 j + 2j + 2! summing over all non-negative integers k k ν with k + 2k νk ν = ν and letting s = k + k k ν B k are the Bernoulli numbers and the Hermite polynomials satisfy H j x = j e x2 /2 d j d x j e x2 /2 A very simple proof is given in Janson [0] As far as the large deviation is concerned let us mention Bender [2] Hwang [9] Esseen [5] improves Bender s result as follows: k j
3 ASYMPTOTICS OF THE EULERIAN NUMBERS REVISITED: A LARGE DEVIATION ANALYSIS 3 Let a := k/m uniformly in all 0 < k < m Let ta be the solution of Set a = e ta e ta ta δa = e ta tae ata σ 2 a = ta 2 e ta e ta 2 Then A nk = δa m 2πmσa + O m As noted by Esseen further terms can be obtained in this asymptotic All these papers use the solution ρ of 2 mw f w k f w = 0 which actually corresponds to the Saddle point of the Saddle point method see Sec2 In this paper we are interested in the extreme large deviation case k = m m α /2 < α < the choice of this range is justified in Sec3 This range was already the object of our analysis of Stirling numbers of first and second kind see Louchard [] [2] Let us summarize the motivation of this paper: Previous papers simply use ρ as the solution of 2 They don t compute the detailed dependence of ρ on α neither the precise behaviour of functions of ρ they use We will use multiseries expansions: multiseries are in effect power series in which the powers may be non-integral but must tend to infinity and the variables are elements of a scale The scale is a set of variables of increasing order The series is computed in terms of the variable of maximum order the coefficients of which are given in terms of the next-tomaximum order etc This is more precise than mixing different terms Our work fits within the framework of Analytic Combinatorics In Sec2 we revisit the asymptotic expansion in the central region and in Sec3 we analyze the non-central region k = m m α α > /2 α is chosen such that m α is integer We use Cauchy s integral formula and the Saddle point method Sec4 provides a justification of the Saddle point technique we use here 2 CENTRAL REGION In this section as a warm-up we rederive the first terms of the asymptotics We use the Saddle point technique for a good introduction to this method see Flajolet and Sedgewick [6]
4 4 GUY LOUCHARD chv I I I Let ρ be the Saddle point and Ω the circle ρe iθ By Cauchy s theorem A nk f z m 2πi Ω z k+ d z = π ρ k f ρe iθ m e kiθ dθ 2π π = π ρ k e m lnf ρeiθ kiθ dθ 2π π = f ρ m π [ { ρ k exp m 2π π 2 κ 2θ 2 i }] 3 6 κ 3θ 3 + dθ i 4 κ i ρ = lnf ρe u u u=0 See Good [8] for a neat description of this technique Let us now turn to the Saddle point computation We let ρ denote the root of smallest modulus of 2 with k = M + xσ This amounts to [ w lnw w lnw 2 w w ] 2lnw The solution is given by the asymptotic expansion µ µ 2 x3/2 w µ = 0 6lnw ρ := + 2x3/2 + 6x2 µ µ x3 3 /2 5µ x4 5µ 4 + O µ 5 In the sequel we will only give the first terms of our expansions of course Maple knows much more This leads to T = k lnρ = x3 /2 µ x 2 x3 3 /2 5µ x4 5µ 2 + O T 2 = µ 2 lnf ρ = x3 /2 µ + x2 2 + x3 3 /2 5µ + 3x4 20µ 2 + O T + T 2 = x2 2 x4 20µ 2 x6 T 3 = exp T + T 2 + x2 2 µ 3 µ 3 050µ 4 + O µ 6 = x4 20µ 2 + /050x6 + x 8 /800 µ 4 + O Now we turn to the integral in 3 The first κ i are given by κ[2] = 2 x2 20µ 2 + 2x4 525µ 4 + 2x6 κ[3] = x3/2 60µ + 79x3 3 /2 6300µ 3 + O κ[4] = 20 + x2 42µ 2 + O 2625µ 6 + O µ 8 and similar expressions for the next κ i that we don t detail here We proceed as in Flajolet and Sedgewick [6] chv I I I Let us choose a splitting value θ 0 such that mκ 2 θ0 2 mκ 3θ0 3 0n For instance we can use θ 0 = µ /2 We must prove that the integral K mk = 2π θ0 here and in the sequel an b n means a n b n n θ 0 µ 4 µ 5 e m lnf ρeiθ kiθ dθ µ 6
5 ASYMPTOTICS OF THE EULERIAN NUMBERS REVISITED: A LARGE DEVIATION ANALYSIS 5 is such that K mk is exponentially small This is done in the Appendix Now we use the classical trick of setting [ ] m κ 2 θ 2 /2! + κ l iθ l /l! = u 2 /2 Computing θ as a series in u this gives by Lagrange s inversion 6 θ = u i a[i ]/µ = 3 [u 2 /2 + 3x2 2ix 5µ 2 + O µ 4 + u 2 5µ ix3 525µ 4 + O This expansion is valid in the dominant integration domain T 4 := 3/2 2 /2 π /2 µ l=3 u µ a θ 0 = µ /2 µ 6 ]/ + O u 3 µ Setting dθ = dθ du du we integrate on u = [ ]: this extension of the range is justified as in Flajolet and Sedgewick [6] chv I I I This gives [ / + µ 2 + Now it remains to compute 3x T 5 := T 3 T 4 = 3/2 2 /2 57x x / ] µ 4 + O 20 µ 6 [ + x x π /2 µ x x x x / µ 2 / µ 4 + O Note that the coefficient of the exponential term is asymptotically equivalent to the dominant term of as expected The first three terms correspond to Note that our derivation is simpler 2πσ then Nicolas computation in [3] 3 LARGE DEVIATION k = m m α > α > /2 m α INTEGER m We have k = m m α m α integer We set 2 ε := m α ε = m α µ exp/ε µ = m The multiseries scale is here {m α µexp/ε} Set τ = exp /ε Our result can be summarized in the following local limit theorem: Theorem 3 With /2 < α < the rate of growth of A nk / is the following: µ 6 ] 5 6 A nk = e m ε m T 5 + T 6 τ + T 7 τ 2 + O τ 3 with T 5 = 2π εµ 2εµ 3 T 6 = µ 2 ε + 2ε 2 + T 7 = µ4 2 + ε 2 + ε 2 / µ 2 + O 8ε ε 3 ε 2 µ 2 + ε 4 0 3ε ε 2 ε + O µ 4 µ 2 2 here and in the sequel an b n means a n = ob n
6 6 GUY LOUCHARD Proof We have The Saddle point equation 2 becomes k = m m α = m ε 7 w + + lnw + lnwεw lnwε = 0 To first order we have lnw /ε So we set we now have to the next order ρ = e ξ ξ = + η ε ερ η + ρ + ρ ε = 0 or hence This gives ηερ + ηε + ρ = 0 η ρ ε ε ρ = e ξ = e /ε η/ε τ η ε hence η τ η ε τ ε ε + τ ε 2 = τ ε τ2 ε 3 We derive by bootstrapping from 7 again we only provide a few terms here we use more terms in our expansions η = ε τ + ε 3 + ε 2 τ ε 2ε ε 4 4 ε ε 2 τ 3 + O τ 4 ε and successively ρ = expη/ε ie τ ρ = τ ε 2 + 2ε 4 + ε 3 ε 2 τ + 2 2ε ε 5 3 ε ε 3 ε 2 τ 2 + O τ 3 lnρ = + η ie ε lnρ = ε ε 2 τ + ε 4 + ε 3 τ 2 ε 2 + f ρ = τ + ε ε + 2ε 3 + ε 2 ε lnf ρ = lnε + ε + ε 2 + ε τ + O τ 2 3 2ε ε 5 4 ε ε 3 ε 2 τ + O τ 2 τ 3 + O τ 4 For the first part of the Cauchy s integral we have T = lnf ρ εlnρ = lnε + τ + now we extract the dominant part lnε + T 2 = expµ 2 T lnε + = µ 2 τ + 2ε 2 τ 2 + O τ ε2 2ε 2 µ2 + 2 µ4 τ 2 + O τ 3
7 ASYMPTOTICS OF THE EULERIAN NUMBERS REVISITED: A LARGE DEVIATION ANALYSIS 7 Also κ[2] = ε ετ + O τ 2 κ[3] = 2ε 3 + 6ε 2 τ + O τ 2 Again we must choose a splitting value θ 0 = m β β < 0 such that mκ 2 θ0 2 mκ 3θ0 3 0n This leads to β > 2 αβ < 2 3 α that is why we restrict the range to /2 < α < We can then use θ 0 = m /2 α We must prove that the integral K mk = 2π θ0 θ 0 e m lnf ρeiθ kiθ dθ is such that K mk is exponentially small This is done in the Appendix Proceeding further we derive θ = u i a[i ]/µ = u εµ + iu2 3εµ 2 u3 36εµ 3 + iu4 270εµ 4 + O τ This expansion is valid in the dominant integration domain u θ 0µ a = m Setting dθ = dθ du du we integrate on u = [ ] This gives successively [ T 3 = 2π εµ 2ε 2εµ ε ε 5 µ T 4 = T 3 T 2 = T 5 + T 6 τ + T 7 τ 2 + O τ 3 with T 5 = 2π εµ 2εµ 3 T 6 = µ 2 ε + 2ε 2 + T 7 = µ4 2 + ε 2 + ε 2 / µ 2 + O 8ε ε 3 ε 2 µ 2 + ε 4 0 3ε ε 2 ε + O ε 4 24ε 3 2ε 2 µ 3 µ 4 µ 2 τ ] + O τ 2 This concludes the proof Given some desired precision how many terms must we use in our expansions? It depends on α For instance in T 7 we encounter terms like ε 2 µ 2 and ε 4 So we must compare α + with 4 α The critical value is α = 2/3 To check the quality of our asymptotic we have chosen m [90500] and α = 2/3 Figure shows lna nk circle and the ln of expression 5 line Figure 2 shows the quotient of lna nk by the ln of expression 5 without the τ term in 5 line and with this term circle Of course the good influence of the τ term is less effective for large m Another way is to fix m to 00 for instance n = 000 The maximum value for k is m m /2 = 969 We must set k larger than the central domain for instance larger than m m/2 = 58 But notice that the term T 6 starts with two negative terms µ 2 so k must be large so that τ is ε small enough to compensate these negative terms It appears that k = 860 is large enough in our case So our α range is [/207] Figure 3 shows lna nk circle and the ln of expression 5 line
8 8 GUY LOUCHARD FIGURE α = 2/3 lna nk circle and the ln of expression 5 line as function of m FIGURE 2 α = 2/3 quotient of lna nk by the ln of expression 5 as function of m without the τ term in 5 line and with this term circle Figure 4 shows the quotient of lna nk by the ln of expression 5 without the τ term in 5 line and with this term circle
9 ASYMPTOTICS OF THE EULERIAN NUMBERS REVISITED: A LARGE DEVIATION ANALYSIS FIGURE 3 n = 000 lna nk circle and the ln of expression 5 line as function of k FIGURE 4 n = 000 quotient of lna nk by the ln of expression 5 as function of k without the τ term in 5 line and with this term circle 4 APPENDIX JUSTIFICATION OF THE INTEGRATION PROCEDURE 4 The central region We must analyze Rm lnf ρe iθ kiθ
10 0 GUY LOUCHARD Let us first notice that kiθ does not contribute to the analysis Next we have ρ = + 2x3/2 + O µ µ 2 Hence this leads to analyze ρe iθ R ln ln ρe iθ ρe iθ = ln ln ρe iθ = 2 ln 2 cosθ θ 2 The first term has a dominant peak at 0 42 The non-central region Now we must analyze Set δ = τ = e /ε Hence lnδ = ε We have ρe iθ R ln ln ρe iθ = 2 ln + x3/2 µ + O Rm lnf ρe iθ kiθ ρ = δ lnδ 2 + O δ µ 2 = 2 2ρ cosθ + ρ 2 ln lnρ 2 + θ 2 lnδ 2 + θ 2 + lnδ + O δ = lnδ lnlnδ θ2 2lnδ 2 + O = ε + lnε ε2 θ O ε4 The θ contribution has a dominant peak at 0 Acknowledgments lnδ 4 We thank MD Ward for a first reading of this paper preliminary version The insightful comments of the referees are gratefully acknowledged REFERENCES [] The On-line Encyclopedia of Integer sequences OEISorg [2] EA Bender Central and local limit theorems applied to asymptotic enumeration Journal of Combinatorial Theory Series A 5:9 973 [3] L Carlitz DC Kurtz R Scoville and OP Stackelberg Asymptotic properties of Eulerian numbers Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 23: [4] FN David and DE Barton Combinatorial Chance Charles Griffin and co London 962 [5] C G Esseen On the application of the theory of probability to two combinatorial problems invoving permutations In Proceedings of the Seventh Conference on Probability Theory Braşov pages [6] P Flajolet and R Sedgewick Analytic Combinatorics Cambridge University Press 2009 [7] W Gawronski and T Neuschel Euler-frobenius numbers Integral Transforms and Special Functions 240: [8] I J Good Saddle-point methods for the multinomial distribution Annals of Mathematical Statistics 284: [9] HK Hwang Large deviations for combinatorial distributions I: Central limit theorems Advances in Applied Probability 6: [0] S Janson Euler-Frobenius numbers and rounding Online Journal of Analytic Combinatorics [] G Louchard Asymptotics of the stirling numbers of the first kind revisited: A saddle point approach Discrete Mathematics and Theoretical Computer Science 22:
11 ASYMPTOTICS OF THE EULERIAN NUMBERS REVISITED: A LARGE DEVIATION ANALYSIS [2] G Louchard Asymptotics of the stirling numbers of the second kind revisited: A saddle point approach Applicable Analysis and Discrete Mathematics 72: [3] JL Nicolas An integral representation for Eulerian numbers In Sets graphs and numbers Budapest 99 volume 60 pages [4] S Tanny A probabilistic interpretation of Eulerian numbers Duke Mathematical Journal 40: [5] SH Sira zdinov Asymptotic expression for Euler numbers in Russian Izv Akad Nauk UZSSR Ser Fiz-Mat Nauk 6: UNIVERSITÉ LIBRE DE BRUXELLES BELGIUM DÉPARTEMENT D INFORMATIQUE CP 22 BOULEVARD DU TRIOM- PHE B-050 BRUXELLES BELGIUM address: louchard@ulbacbe
Asymptotics of the Eulerian numbers revisited: a large deviation analysis
Asymptotics of the Eulerian numbers revisited: a large deviation analysis Guy Louchard November 204 Abstract Using the Saddle point method and multiseries expansions we obtain from the generating function
More informationThe number of inversions in permutations: A saddle point approach
The number of inversions in permutations: A saddle point approach Guy Louchard and Helmut Prodinger November 4, 22 Abstract Using the saddle point method, we obtain from the generating function of the
More informationThe Number of Inversions in Permutations: A Saddle Point Approach
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 6 (23), Article 3.2.8 The Number of Inversions in Permutations: A Saddle Point Approach Guy Louchard Département d Informatique CP 212, Boulevard du
More informationON THE COEFFICIENTS OF AN ASYMPTOTIC EXPANSION RELATED TO SOMOS QUADRATIC RECURRENCE CONSTANT
Applicable Analysis and Discrete Mathematics available online at http://pefmath.etf.bg.ac.yu Appl. Anal. Discrete Math. x (xxxx), xxx xxx. doi:10.2298/aadmxxxxxxxx ON THE COEFFICIENTS OF AN ASYMPTOTIC
More informationAsymptotic results for silent elimination
Discrete Mathematics and Theoretical Computer Science DMTCS vol. subm., by the authors, 1 1 Asymptotic results for silent elimination Guy Louchard 1 and Helmut Prodinger 2 1 Université Libre de Bruxelles,
More informationAscending Runs in Cayley Trees and Mappings
Ascending Runs in Cayley Trees and Mappings Marie-Louise Bruner and Alois Panholzer marie-louise.bruner@tuwien.ac.at alois.panholzer@tuwien.ac.at arxiv:507.05484v [math.co] 20 Jul 205 Vienna University
More informationarxiv: v1 [cs.pf] 26 May 2017
A refined and asymptotic analysis of optimal stopping problems of Bruss and Weber Guy Louchard October 19, 2017 arxiv:1705.09482v1 [cs.pf] 26 May 2017 Abstract The classical secretary problem has been
More informationk-protected VERTICES IN BINARY SEARCH TREES
k-protected VERTICES IN BINARY SEARCH TREES MIKLÓS BÓNA Abstract. We show that for every k, the probability that a randomly selected vertex of a random binary search tree on n nodes is at distance k from
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 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 informationPermutations with Inversions
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 4 2001, Article 01.2.4 Permutations with Inversions Barbara H. Margolius Cleveland State University Cleveland, Ohio 44115 Email address: b.margolius@csuohio.edu
More information4. Complex Analysis, Rational and Meromorphic Asymptotics
ANALYTIC COMBINATORICS P A R T T W O 4. Complex Analysis, Rational and Meromorphic Asymptotics http://ac.cs.princeton.edu ANALYTIC COMBINATORICS P A R T T W O Analytic Combinatorics Philippe Flajolet and
More informationThe Largest Missing Value in a Composition of an Integer and Some Allouche-Shallit-Type Identities
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 16 13, Article 13.. The Largest Missing Value in a Composition of an Integer and Some Allouche-Shallit-Type Identities Guy Louchard Université Libre de
More informationON SUMS OF PRIMES FROM BEATTY SEQUENCES. Angel V. Kumchev 1 Department of Mathematics, Towson University, Towson, MD , U.S.A.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A08 ON SUMS OF PRIMES FROM BEATTY SEQUENCES Angel V. Kumchev 1 Department of Mathematics, Towson University, Towson, MD 21252-0001,
More informationPart IB. Further Analysis. Year
Year 2004 2003 2002 2001 10 2004 2/I/4E Let τ be the topology on N consisting of the empty set and all sets X N such that N \ X is finite. Let σ be the usual topology on R, and let ρ be the topology on
More informationCookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems!
Cookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems! Steven J. Miller (MC 96) http://www.williams.edu/mathematics/sjmiller/public_html Yale University, April 14, 2014 Introduction Goals of the
More informationCOMPOSITIONS WITH A FIXED NUMBER OF INVERSIONS
COMPOSITIONS WITH A FIXED NUMBER OF INVERSIONS A. KNOPFMACHER, M. E. MAYS, AND S. WAGNER Abstract. A composition of the positive integer n is a representation of n as an ordered sum of positive integers
More informationOn the smoothness of the conjugacy between circle maps with a break
On the smoothness of the conjugacy between circle maps with a break Konstantin Khanin and Saša Kocić 2 Department of Mathematics, University of Toronto, Toronto, ON, Canada M5S 2E4 2 Department of Mathematics,
More informationTHE MAHONIAN PROBABILITY DISTRIBUTION ON WORDS IS ASYMPTOTICALLY NORMAL. [ Abstract! Correct date! No showkeys! ] XXX
THE MAHONIAN PROBABILITY DISTRIBUTION ON WORDS IS ASYMPTOTICALLY NORMAL RODNEY CANFIELD, SVANTE JANSON, AND DORON ZEILBERGER Abstract. We study XXX [ Abstract! Correct date! No showkeys! ] XXX S:intro
More informationThe number of Euler tours of random directed graphs
The number of Euler tours of random directed graphs Páidí Creed School of Mathematical Sciences Queen Mary, University of London United Kingdom P.Creed@qmul.ac.uk Mary Cryan School of Informatics University
More informationNotations. Primary definition. Specific values. Traditional name. Traditional notation. Mathematica StandardForm notation. Specialized values
KleinInvariant Notations Traditional name Klein invariant modular function Traditional notation z Mathematica StandardForm notation KleinInvariant z Primary definition 09.50.0.0001.01 ϑ 0, Π z 8 ϑ 3 0,
More informationProbabilistic analysis of the asymmetric digital search trees
Int. J. Nonlinear Anal. Appl. 6 2015 No. 2, 161-173 ISSN: 2008-6822 electronic http://dx.doi.org/10.22075/ijnaa.2015.266 Probabilistic analysis of the asymmetric digital search trees R. Kazemi a,, M. Q.
More informationTHE ASYMPTOTIC NUMBERS OF REGULAR TOURNAMENTS, EULERIAN DIGRAPHS AND EULERIAN ORIENTED GRAPHS
THE ASYMPTOTIC NUMBERS OF REGULAR TOURNAMENTS, EULERIAN DIGRAPHS AND EULERIAN ORIENTED GRAPHS Brendan D. McKay Computer Science Department, Australian National University, GPO Box 4, ACT 2601, Australia
More information2 Write down the range of values of α (real) or β (complex) for which the following integrals converge. (i) e z2 dz where {γ : z = se iα, < s < }
Mathematical Tripos Part II Michaelmas term 2007 Further Complex Methods, Examples sheet Dr S.T.C. Siklos Comments and corrections: e-mail to stcs@cam. Sheet with commentary available for supervisors.
More informationHamming Weight of the Non-Adjacent-Form under Various Input Statistics. Clemens Heuberger and Helmut Prodinger
FoSP Algorithmen & mathematische Modellierung FoSP Forschungsschwerpunkt Algorithmen und mathematische Modellierung Hamming Weight of the Non-Adjacent-Form under Various Input Statistics Clemens Heuberger
More informationASYMPTOTIC ANALYSIS OF SUMS OF POWERS OF MULTINOMIAL COEFFICIENTS: A SADDLE POINT APPROACH
#A47 INTEGERS 17 (2017) ASYMPTOTIC ANALYSIS OF SUMS OF POWERS OF MULTINOMIAL COEFFICIENTS: A SADDLE POINT APPROACH Guy Louchard Département d Informatique, Université Libre de Bruxelles, Bruxelles, Belgium
More informationBook announcements. Sukumar Das Adhikari ASPECTS OF COMBINATORICS AND COMBINATORIAL NUMBER THEORY CRC Press, Florida, 2002, 156pp.
Discrete Mathematics 263 (2003) 347 352 www.elsevier.com/locate/disc Book announcements Sukumar Das Adhikari ASPECTS OF COMBINATORICS AND COMBINATORIAL NUMBER THEORY CRC Press, Florida, 2002, 156pp. Notations
More information1. Introduction This paper investigates the properties of Ramanujan polynomials, which, for each k 0, the authors of [2] define to be
ZEROS OF RAMANUJAN POLYNOMIALS M. RAM MURTY, CHRIS SMYTH, AND ROB J. WANG Abstract. In this paper, we investigate the properties of Ramanujan polynomials, a family of reciprocal polynomials with real coefficients
More informationMultifractality in simple systems. Eugene Bogomolny
Multifractality in simple systems Eugene Bogomolny Univ. Paris-Sud, Laboratoire de Physique Théorique et Modèles Statistiques, Orsay, France In collaboration with Yasar Atas Outlook 1 Multifractality Critical
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 informationDerangements with an additional restriction (and zigzags)
Derangements with an additional restriction (and zigzags) István Mező Nanjing University of Information Science and Technology 2017. 05. 27. This talk is about a class of generalized derangement numbers,
More informationNotes by Zvi Rosen. Thanks to Alyssa Palfreyman for supplements.
Lecture: Hélène Barcelo Analytic Combinatorics ECCO 202, Bogotá Notes by Zvi Rosen. Thanks to Alyssa Palfreyman for supplements.. Tuesday, June 2, 202 Combinatorics is the study of finite structures that
More informationCalculus 1: Sample Questions, Final Exam
Calculus : Sample Questions, Final Eam. Evaluate the following integrals. Show your work and simplify your answers if asked. (a) Evaluate integer. Solution: e 3 e (b) Evaluate integer. Solution: π π (c)
More informationLoose Hamilton Cycles in Random k-uniform Hypergraphs
Loose Hamilton Cycles in Random k-uniform Hypergraphs Andrzej Dudek and Alan Frieze Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 1513 USA Abstract In the random k-uniform
More informationLimiting behaviour of large Frobenius numbers. V.I. Arnold
Limiting behaviour of large Frobenius numbers by J. Bourgain and Ya. G. Sinai 2 Dedicated to V.I. Arnold on the occasion of his 70 th birthday School of Mathematics, Institute for Advanced Study, Princeton,
More informationROSENA R.X. DU AND HELMUT PRODINGER. Dedicated to Philippe Flajolet ( )
ON PROTECTED NODES IN DIGITAL SEARCH TREES ROSENA R.X. DU AND HELMUT PRODINGER Dedicated to Philippe Flajolet (98 2) Abstract. Recently, 2-protected nodes were studied in the context of ordered trees and
More informationConsidering our result for the sum and product of analytic functions, this means that for (a 0, a 1,..., a N ) C N+1, the polynomial.
Lecture 3 Usual complex functions MATH-GA 245.00 Complex Variables Polynomials. Construction f : z z is analytic on all of C since its real and imaginary parts satisfy the Cauchy-Riemann relations and
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 informationTHE ZERO-DISTRIBUTION AND THE ASYMPTOTIC BEHAVIOR OF A FOURIER INTEGRAL. Haseo Ki and Young One Kim
THE ZERO-DISTRIBUTION AND THE ASYMPTOTIC BEHAVIOR OF A FOURIER INTEGRAL Haseo Ki Young One Kim Abstract. The zero-distribution of the Fourier integral Q(u)eP (u)+izu du, where P is a polynomial with leading
More informationLIMIT LAWS FOR SUMS OF FUNCTIONS OF SUBTREES OF RANDOM BINARY SEARCH TREES
LIMIT LAWS FOR SUMS OF FUNCTIONS OF SUBTREES OF RANDOM BINARY SEARCH TREES Luc Devroye luc@cs.mcgill.ca Abstract. We consider sums of functions of subtrees of a random binary search tree, and obtain general
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 informationA New Operation on Sequences: The Boustrophedon Transform
A New Operation on Sequences: The Boustrophedon Transform J. Millar, N. J. A. Sloane and N. E. Young Mathematical Sciences Research Center AT&T Bell Laboratories Murray Hill, New Jersey 07974 January 5,
More informationCounting Markov Types
Counting Markov Types Philippe Jacquet, Charles Knessl, Wojciech Szpankowski To cite this version: Philippe Jacquet, Charles Knessl, Wojciech Szpankowski. Counting Markov Types. Drmota, Michael and Gittenberger,
More informationGENERATING SERIES FOR IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS
GENERATING SERIES FOR IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS ARNAUD BODIN Abstract. We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results
More information2.4 Lecture 7: Exponential and trigonometric
154 CHAPTER. CHAPTER II.0 1 - - 1 1 -.0 - -.0 - - - - - - - - - - 1 - - - - - -.0 - Figure.9: generalized elliptical domains; figures are shown for ǫ = 1, ǫ = 0.8, eps = 0.6, ǫ = 0.4, and ǫ = 0 the case
More informationShort Kloosterman Sums for Polynomials over Finite Fields
Short Kloosterman Sums for Polynomials over Finite Fields William D Banks Department of Mathematics, University of Missouri Columbia, MO 65211 USA bbanks@mathmissouriedu Asma Harcharras Department of Mathematics,
More informationA Note on Extended Binomial Coefficients
A Note on Extended Binomial Coefficients Thorsten Neuschel arxiv:407.749v [math.co] 8 Jul 04 Abstract We study the distribution of the extended binomial coefficients by deriving a complete asymptotic expansion
More informationTaylor and Laurent Series
Chapter 4 Taylor and Laurent Series 4.. Taylor Series 4... Taylor Series for Holomorphic Functions. In Real Analysis, the Taylor series of a given function f : R R is given by: f (x + f (x (x x + f (x
More informationAsymptotic Rational Approximation To Pi: Solution of an Unsolved Problem Posed By Herbert Wilf
AofA 0 DMTCS proc AM, 00, 59 60 Asymptotic Rational Approximation To Pi: Solution of an Unsolved Problem Posed By Herbert Wilf Mark Daniel Ward Department of Statistics, Purdue University, 50 North University
More informationCOMPLEX ANALYSIS Spring 2014
COMPLEX ANALYSIS Spring 24 Homework 4 Solutions Exercise Do and hand in exercise, Chapter 3, p. 4. Solution. The exercise states: Show that if a
More informationExtremal Statistics on Non-Crossing Configurations
Extremal Statistics on Non-Crossing Configurations Michael Drmota Anna de Mier Marc Noy Abstract We analye extremal statistics in non-crossing configurations on the n vertices of a convex polygon. We prove
More informationTHE LAPLACE TRANSFORM OF THE FOURTH MOMENT OF THE ZETA-FUNCTION. Aleksandar Ivić
THE LAPLACE TRANSFORM OF THE FOURTH MOMENT OF THE ZETA-FUNCTION Aleksandar Ivić Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. (2), 4 48. Abstract. The Laplace transform of ζ( 2 +ix) 4 is investigated,
More informationSome commonly encountered sets and their notations
NATIONAL UNIVERSITY OF SINGAPORE DEPARTMENT OF MATHEMATICS (This notes are based on the book Introductory Mathematics by Ng Wee Seng ) LECTURE SETS & FUNCTIONS Some commonly encountered sets and their
More informationContents. I Basic Methods 13
Preface xiii 1 Introduction 1 I Basic Methods 13 2 Convergent and Divergent Series 15 2.1 Introduction... 15 2.1.1 Power series: First steps... 15 2.1.2 Further practical aspects... 17 2.2 Differential
More informationarxiv: v1 [math.co] 12 Sep 2018
ON THE NUMBER OF INCREASING TREES WITH LABEL REPETITIONS arxiv:809.0434v [math.co] Sep 08 OLIVIER BODINI, ANTOINE GENITRINI, AND BERNHARD GITTENBERGER Abstract. In this paper we study a special subclass
More informationA combinatorial problem related to Mahler s measure
A combinatorial problem related to Mahler s measure W. Duke ABSTRACT. We give a generalization of a result of Myerson on the asymptotic behavior of norms of certain Gaussian periods. The proof exploits
More informationModelling large values of L-functions
Modelling large values of L-functions How big can things get? Christopher Hughes Exeter, 20 th January 2016 Christopher Hughes (University of York) Modelling large values of L-functions Exeter, 20 th January
More informationAlgebraic aspects of some Riordan arrays related to binary words avoiding a pattern
Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern D. Merlini and R. Sprugnoli Dipartimento di Sistemi e Informatica viale Morgagni 65, 5034, Firenze, Italia merlini@dsi.unifi.it,
More informationFoSP. FoSP. WARING S PROBLEM WITH DIGITAL RESTRICTIONS IN F q [X] Manfred Madritsch. Institut für Analysis und Computational Number Theory (Math A)
FoSP Algorithmen & mathematische Modellierung FoSP Forschungsschwerpunkt Algorithmen und mathematische Modellierung WARING S PROBLM WITH DIGITAL RSTRICTIONS IN F q [X] Manfred Madritsch Institut für Analysis
More informationLimit Theorems in Probability and Number
Limit Theorems in Probability and Number Theory Paderborn, January 14-15, 2011 Limit Theorems in Probability and Number Theory V. V. Buldygin K.-H. Indlekofer O. I. Klesov J. G. Steinebach Limit theorems
More informationON POLYNOMIAL REPRESENTATION FUNCTIONS FOR MULTILINEAR FORMS. 1. Introduction
ON POLYNOMIAL REPRESENTATION FUNCTIONS FOR MULTILINEAR FORMS JUANJO RUÉ In Memoriam of Yahya Ould Hamidoune. Abstract. Given an infinite sequence of positive integers A, we prove that for every nonnegative
More informationMOMENTS OF HYPERGEOMETRIC HURWITZ ZETA FUNCTIONS
MOMENTS OF HYPERGEOMETRIC HURWITZ ZETA FUNCTIONS ABDUL HASSEN AND HIEU D. NGUYEN Abstract. This paper investigates a generalization the classical Hurwitz zeta function. It is shown that many of the properties
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 informationDISCRETE AND ALGEBRAIC STRUCTURES
DISCRETE AND ALGEBRAIC STRUCTURES Master Study Mathematics MAT40 Winter Semester 015/16 (Due to organisational reasons register for the course at TU and KFU) Edited by Mihyun Kang TU Graz Contents I Lectures
More informationPartitions into Values of a Polynomial
Partitions into Values of a Polynomial Ayla Gafni University of Rochester Connections for Women: Analytic Number Theory Mathematical Sciences Research Institute February 2, 2017 Partitions A partition
More informationMAE294B/SIOC203B: Methods in Applied Mechanics Winter Quarter sgls/mae294b Solution IV
MAE9B/SIOC3B: Methods in Applied Mechanics Winter Quarter 8 http://webengucsdedu/ sgls/mae9b 8 Solution IV (i The equation becomes in T Applying standard WKB gives ɛ y TT ɛte T y T + y = φ T Te T φ T +
More informationSUPPLEMENT TO TESTING UNIFORMITY ON HIGH-DIMENSIONAL SPHERES AGAINST MONOTONE ROTATIONALLY SYMMETRIC ALTERNATIVES
Submitted to the Annals of Statistics SUPPLEMENT TO TESTING UNIFORMITY ON HIGH-DIMENSIONAL SPHERES AGAINST MONOTONE ROTATIONALLY SYMMETRIC ALTERNATIVES By Christine Cutting, Davy Paindaveine Thomas Verdebout
More informationLIMITING DISTRIBUTIONS FOR THE NUMBER OF INVERSIONS IN LABELLED TREE FAMILIES
LIMITING DISTRIBUTIONS FOR THE NUMBER OF INVERSIONS IN LABELLED TREE FAMILIES ALOIS PANHOLZER AND GEORG SEITZ Abstract. We consider so-called simple families of labelled trees, which contain, e.g., ordered,
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 informationPartitions with Distinct Multiplicities of Parts: On An Unsolved Problem Posed By Herbert Wilf
Partitions with Distinct Multiplicities of Parts: On An Unsolved Problem Posed By Herbert Wilf arxiv:1203.2670v1 [math.co] 12 Mar 2012 James Allen Fill Department of Applied Mathematics and Statistics
More informationF ( B d > = d I 1 S (d,d-k) F _ k k=0
Canad. Math. Bull. Vol. 26 (3), 1983 ORDERED FIBONACCI PARTITIONS BY HELMUT PRODINGER (1) ABSTRACT. Ordered partitions are enumerated by F n = k fc! S(n, k) where S(n, k) is the Stirling number of the
More informationPartitions with Distinct Multiplicities of Parts: On An Unsolved Problem Posed By Herbert Wilf
Partitions with Distinct Multiplicities of Parts: On An Unsolved Problem Posed By Herbert Wilf James Allen Fill Department of Applied Mathematics and Statistics The Johns Hopkins University 3400 N. Charles
More informationA MODULAR IDENTITY FOR THE RAMANUJAN IDENTITY MODULO 35
A MODULAR IDENTITY FOR THE RAMANUJAN IDENTITY MODULO 35 Adrian Dan Stanger Department of Mathematics, Brigham Young University, Provo, Utah 84602, USA adrian@math.byu.edu Received: 3/20/02, Revised: 6/27/02,
More informationThe Calculus of Residues
hapter 7 The alculus of Residues If fz) has a pole of order m at z = z, it can be written as Eq. 6.7), or fz) = φz) = a z z ) + a z z ) +... + a m z z ) m, 7.) where φz) is analytic in the neighborhood
More informationON SIMILARITIES BETWEEN EXPONENTIAL POLYNOMIALS AND HERMITE POLYNOMIALS
Journal of Applied Mathematics and Computational Mechanics 2013, 12(3), 93-104 ON SIMILARITIES BETWEEN EXPONENTIAL POLYNOMIALS AND HERMITE POLYNOMIALS Edyta Hetmaniok, Mariusz Pleszczyński, Damian Słota,
More informationCookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems!
Cookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems! Olivial Beckwith, Murat Koloğlu, Gene Kopp, Steven J. Miller and Yinghui Wang http://www.williams.edu/mathematics/sjmiller/public html Colby
More informationON CHARACTERIZATION OF POWER SERIES DISTRIBUTIONS BY A MARGINAL DISTRIBUTION AND A REGRESSION FUNCTION
Ann. Inst. Statist. Math. Vol. 41, No. 4, 671-676 (1989) ON CHARACTERIZATION OF POWER SERIES DISTRIBUTIONS BY A MARGINAL DISTRIBUTION AND A REGRESSION FUNCTION A. KYRIAKOUSSIS 1 AND H. PAPAGEORGIOU 2 1Department
More informationA Symbolic Operator Approach to Several Summation Formulas for Power Series
A Symbolic Operator Approach to Several Summation Formulas for Power Series T. X. He, L. C. Hsu 2, P. J.-S. Shiue 3, and D. C. Torney 4 Department of Mathematics and Computer Science Illinois Wesleyan
More informationRobust exponential convergence of hp-fem for singularly perturbed systems of reaction-diffusion equations
Robust exponential convergence of hp-fem for singularly perturbed systems of reaction-diffusion equations Christos Xenophontos Department of Mathematics and Statistics University of Cyprus joint work with
More informationLinear Recurrence Relations for Sums of Products of Two Terms
Linear Recurrence Relations for Sums of Products of Two Terms Yan-Ping Mu College of Science, Tianjin University of Technology Tianjin 300384, P.R. China yanping.mu@gmail.com Submitted: Dec 27, 2010; Accepted:
More informationPart IA Probability. Theorems. Based on lectures by R. Weber Notes taken by Dexter Chua. Lent 2015
Part IA Probability Theorems Based on lectures by R. Weber Notes taken by Dexter Chua Lent 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after lectures.
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 informationAdditive irreducibles in α-expansions
Publ. Math. Debrecen Manuscript Additive irreducibles in α-expansions By Peter J. Grabner and Helmut Prodinger * Abstract. The Bergman number system uses the base α = + 5 2, the digits 0 and, and the condition
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 informationA new method to compute the probability of collision for short-term space encounters
A new method to compute the probability of collision for short-term space encounters R. Serra, D. Arzelier, M. Joldes, J-B. Lasserre, A. Rondepierre and B. Salvy ANR FastRelax Meeting May, 2015 Fiction...
More informationMATH 722, COMPLEX ANALYSIS, SPRING 2009 PART 5
MATH 722, COMPLEX ANALYSIS, SPRING 2009 PART 5.. The Arzela-Ascoli Theorem.. The Riemann mapping theorem Let X be a metric space, and let F be a family of continuous complex-valued functions on X. We have
More informationand in each case give the range of values of x for which the expansion is valid.
α β γ δ ε ζ η θ ι κ λ µ ν ξ ο π ρ σ τ υ ϕ χ ψ ω Mathematics is indeed dangerous in that it absorbs students to such a degree that it dulls their senses to everything else P Kraft Further Maths A (MFPD)
More informationarxiv: v1 [math.co] 24 Jul 2013
ANALYTIC COMBINATORICS OF CHORD AND HYPERCHORD DIAGRAMS WITH k CROSSINGS VINCENT PILAUD AND JUANJO RUÉ arxiv:307.6440v [math.co] 4 Jul 03 Abstract. Using methods from Analytic Combinatorics, we study the
More informationCounting Palindromes According to r-runs of Ones Using Generating Functions
3 47 6 3 Journal of Integer Sequences, Vol. 7 (04), Article 4.6. Counting Palindromes According to r-runs of Ones Using Generating Functions Helmut Prodinger Department of Mathematics Stellenbosch University
More informationCounting terms in the binary lambda calculus
Counting terms in the binary lambda calculus Katarzyna Grygiel Theoretical Computer Science Department Jagiellonian University in Kraków Pierre Lescanne Laboratoire de l'informatique du Parallélisme École
More informationb n x n + b n 1 x n b 1 x + b 0
Math Partial Fractions Stewart 7.4 Integrating basic rational functions. For a function f(x), we have examined several algebraic methods for finding its indefinite integral (antiderivative) F (x) = f(x)
More informationOn the mean values of an analytic function
ANNALES POLONICI MATHEMATICI LVII.2 (1992) On the mean values of an analytic function by G. S. Srivastava and Sunita Rani (Roorkee) Abstract. Let f(z), z = re iθ, be analytic in the finite disc z < R.
More informationarxiv: v1 [math.ca] 17 Feb 2017
GENERALIZED STIELTJES CONSTANTS AND INTEGRALS INVOLVING THE LOG-LOG FUNCTION: KUMMER S THEOREM IN ACTION OMRAN KOUBA arxiv:7549v [mathca] 7 Feb 7 Abstract In this note, we recall Kummer s Fourier series
More informationComplex Analysis, Stein and Shakarchi Meromorphic Functions and the Logarithm
Complex Analysis, Stein and Shakarchi Chapter 3 Meromorphic Functions and the Logarithm Yung-Hsiang Huang 217.11.5 Exercises 1. From the identity sin πz = eiπz e iπz 2i, it s easy to show its zeros are
More informationComplex Homework Summer 2014
omplex Homework Summer 24 Based on Brown hurchill 7th Edition June 2, 24 ontents hw, omplex Arithmetic, onjugates, Polar Form 2 2 hw2 nth roots, Domains, Functions 2 3 hw3 Images, Transformations 3 4 hw4
More informationMod-φ convergence I: examples and probabilistic estimates
Mod-φ convergence I: examples and probabilistic estimates Valentin Féray (joint work with Pierre-Loïc Méliot and Ashkan Nikeghbali) Institut für Mathematik, Universität Zürich Summer school in Villa Volpi,
More informationSimplifying Coefficients in a Family of Ordinary Differential Equations Related to the Generating Function of the Laguerre Polynomials
Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Applications and Applied Mathematics: An International Journal (AAM Vol. 13, Issue 2 (December 2018, pp. 750 755 Simplifying Coefficients
More informationOn the Average Complexity of Brzozowski s Algorithm for Deterministic Automata with a Small Number of Final States
On the Average Complexity of Brzozowski s Algorithm for Deterministic Automata with a Small Number of Final States Sven De Felice 1 and Cyril Nicaud 2 1 LIAFA, Université Paris Diderot - Paris 7 & CNRS
More information13 Definite integrals
3 Definite integrals Read: Boas h. 4. 3. Laurent series: Def.: Laurent series (LS). If f() is analytic in a region R, then converges in R, with a n = πi f() = a n ( ) n + n= n= f() ; b ( ) n+ n = πi b
More information