The number of inversions in permutations: A saddle point approach
|
|
- Wilfred McKinney
- 5 years ago
- Views:
Transcription
1 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 inversion numbers of permutations and Cauchy s integral formula asymptotic results in central and noncentral regions. Keywords: Inversions, permutations, saddle point method. Introduction Let a... a n be a permutation of the set {,..., n}. If a i > a j and i < j, the pair (a i, a j ) is called an inversion; I n (k) is the number of permutations of length n with k inversions. In a recent paper [6], several facts about these numbers are nicely reviewed, and as new results asymptotic formulæ for the numbers I n+k (n) for fixed k and n are derived. This is done using Euler s pentagonal theorem, which leads to a handy explicit formula for I n (k), valid for k n only. Here, we show how to extend these results using the saddle point method. This leads, e. g., to asymptotics for I αn+β (γn + δ), for integer constants α, β, γ, δ and more general ones as well. With this technique, we will also show the known result that I n (k) is asymptotically normal. The generating function for the numbers I n (j) is given by By Cauchy s theorem, Φ n (z) = j I n (j) = ( z) n n I n (j) = Φ n (z) dz 2πi C z j+, ( z i ). where C is, say, a circle around the origin passing (approximately) through the saddle point. In Figure, the saddle point (near z = 2 ) is shown for n = j =. As general references for the application of the saddle point method in enumeration we cite [4, 7]. Actually, we obtain here local limit theorems with some corrections (=lower order terms). For other such theorems in large deviations of combinatorial distributions, see for instance Hwang [5]. The paper is organized as follows: Section 2 deals with the Gaussian limit. In Section 3, we analyze the case j = n k, that we generalize in Section 4 to the case j = αn x, α >. Section 5 is devoted to the moderate large deviation, and Section 6 to the large deviation. Section 7 concludes the paper. Université Libre de Bruxelles, Département d Informatique, CP 22, Boulevard du Triomphe, B-5 Bruxelles, Belgium, louchard@ulb.ac.be University of the Witwatersrand, The John Knopfmacher Centre for Applicable Analysis and Number Theory, School of Mathematics, P.O. Wits, 25 Johannesburg, South Africa, helmut@maths.wits.ac.za
2 y x Figure : Φ (z)/z and the path of integration 2 The Gaussian limit, j = m + xσ The Gaussian limit of I n (j) is easily derived from the generating function Φ n (z) (using the Lindeberg- Lévy conditions, see for instance, Feller [3]); this is also reviewed in Margolius paper, following Sachkov s book [8]. Another analysis is given in Bender [2]. Indeed, this generating function corresponds to a sum for i =,..., n of independent, uniform [..i ] random variables. As an exercise, let us recover this result with the saddle point method, with an additional correction of order /n. We have, with J n := I n /n!, We know that m := E(J n ) = n(n )/4, σ 2 := V(J n ) = n(2n + 5)(n )/72. I n (j) = 2πi Ω e S(z) dz zj+ where Ω is inside the analyticity domain of the integrand and encircles the origin. Since Φ n (z) is just a polynomial, the analyticity restriction can be ignored. We split the exponent of the integrand S = ln(φ n (z)) (j + ) ln z as Set S := S + S 2, () n S := ln( z i ), S 2 := n ln( z) (j + ) ln z. S (i) := di S dz i. To use the saddle point method, we must find the solution of S () ( z) =. (2) 2
3 Set z := z ε, where, here, z =. (This notation always means that z is the approximate saddle point and z is the exact saddle point; they differ by a quantity that has to be computed to some degree of accuracy.) This leads, to first order, to [(n + ) 2 /4 3n/4 5/4 j] + [ (n + ) 3 /36 + 7(n + ) 2 /24 49n/72 9/72 j]ε =. (3) Set j = m + xσ in (3). This shows that, asymptotically, ε is given by a Puiseux series of powers of n /2, starting with 6x/n 3/2. To obtain the next terms, we compute the next terms in the expansion of (2), i.e., we first obtain [(n + ) 2 /4 3n/4 5/4 j] + [ (n + ) 3 /36 + 7(n + ) 2 /24 49n/72 9/72 j]ε + [ j 6/48 (n + ) 3 /24 + 5(n + ) 2 /6 3n/48]ε 2 =. (4) More generally, even powers ε 2k lead to a O(n 2k+ ) ε 2k term and odd powers ε 2k+ lead to a O(n 2k+3 ) ε 2k+ term. Now we set j = m + xσ, expand into powers of n /2 and equate each coefficient with. This leads successively to a full expansion of ε. Note that to obtain a given precision of ε, it is enough to compute a given finite number of terms in the generalization of (4). We obtain We have, with z := z ε, ε = 6x/n 3/2 + (9x/2 54/25x 3 )/n 5/2 (8x )/n 3 + x[ 3942/3625x /x 2 2/6]/n 7/2 + O(/n 4 ). (5) J n (j) = [ exp S( z) + S (2) ( z)(z z) 2 /2! + n!2πi Ω (note carefully that the linear term vanishes). Set z = z + iτ. This gives J n (j) = [ n!2π exp[s( z)] exp S (2) ( z)(iτ) 2 /2! + Let us first analyze S( z). We obtain S ( z) = l=3 l=3 ] S (l) ( z)(z z) l /l! dz n ln(i) + [ 3/2 ln(n) + ln(6) + ln( x)]n + 3/2x n + 43/5x 2 3/4 ] S (l) ( z)(iτ) l /l! dτ. (6) + [3x/8 + 6/x + 27/5x 3 ]/ n + [5679/225x 4 9/5x /6]/n + O(n 3/2 ), S 2 ( z) = [3/2 ln(n) ln(6) ln( x)]n 3/2x n 34/25x 2 + 3/4 [3x/8 + 6/x + 27/5x 3 ]/ n [5679/225x 4 9/5x /6]/n + O(n 3/2 ), and so S( z) = x 2 /2 + ln(n!) + O(n 3/2 ). Also, S (2) ( z) = n 3 /36 + (/24 3/x 2 )n 2 + O(n 3/2 ), S (3) ( z) = O(n 7/2 ), S (4) ( z) = n 5 /6 + O(n 4 ), S (l) ( z) = O(n l+ ), l 5. We can now compute (6), for instance by using the classical trick of setting S (2) ( z)(iτ) 2 /2! + S (l) ( z)(iτ) l /l! = u 2 /2, l=3 3
4 j Figure 2: J n (j) (circle) and the asymptotics (7) (line), without the /n term, n = 6 computing τ as a truncated series in u, setting dτ = dτ dudu, expanding w.r.t. n and integrating on [u =.. ]. (This amounts to the reversion of a series.) Finally (6) leads to J n e x2 /2 exp[( 5/5 + 27/5x 2 )/n + O(n 3/2 )]/(2πn 3 /36) /2. (7) Note that S (3) ( z) does not contribute to the /n correction. To check the effect of the correction, we first give in Figure 2, for n = 6, the comparison between J n (j) and the asymptotics (7), without the /n term. Figure 3 gives the same comparison, with the constant term 5/(5n) in the correction. Figure 4 shows the quotient of J n (j) and the asymptotics (7), with the constant term 5/(5n). The hat behaviour, already noticed by Margolius, is apparent. Finally, Figure 5 shows the quotient of J n (j) and the asymptotics (7), with the full correction. 3 Case j = n k Figure 6 shows the real part of S(z) as given by (), together with a path Ω through the saddle point. It is easy to see that here, we have z = /2. We obtain, to first order, with [C,n 2j 2 + 2n] + [C 2,n 4j 4 4n]ε = C,n = C + O(2 n ), C = 2i 2 i = , C 2,n = C 2 + O(2 n ), C 2 = 4 i(i2i 2 i + ) (2 i ) 2 = Set j = n k. This shows that, asymptotically, ε is given by a Laurent series of powers of n, starting with (k + C /2)/(4n). We next obtain [C 2j 2 + 2n] + [C 2 4j 4 4n]ε + [C 3 + 8n 8j 8]ε 2 = 4
5 j Figure 3: J n (j) (circle) and the asymptotics (7) (line), with the constant in the /n term, n = Figure 4: Quotient of J n (j) and the asymptotics (7), with the constant in the /n term, n = 6 5
6 Figure 5: Quotient of J n (j) and the asymptotics (7), with the full /n term, n = y x Figure 6: Real part of S(z). Saddle-point and path, n =, k = 6
7 for some constant C 3. More generally, powers ε 2k lead to a O() ε 2k term, powers ε 2k+ lead to a O(n) ε 2k+ term. This gives Now we derive ε = (k + C /2)/(4n) + (2k 2 + C )(4k 4 + C 2 )/(64n 2 ) + O(/n 3 ). S ( z) = ln(q) C (k + C /2)/(4n) + O(/n 2 ) with Q := ( /2i ) = Similarly S 2 ( z) = 2 ln(2)n + ( k) ln(2) + ( k 2 /2 + k /2 + C 2 /8)/(2n) + O(/n 2 ) and so with S( z) = ln(q) + 2 ln(2)n + ( k) ln(2) + (A + A k k 2 /4)/n + O(/n 2 ) A := (C 2) 2 /6, A := ( C /2 + )/2. Now we turn to the derivatives of S. We will analyze, with some precision, S (2), S (3), S (4) (the exact number of needed terms is defined by the precision we want in the final result). Note that, from S (3) on, only S (l) 2 must be computed, as S (l) ( z) = O(). This leads to S (2) ( z) = 8n + ( C 2 4k + 4) + O(/n), S (3) 2 ( z) = O(), S (4) 2 ( z) = 92n + O(), S (l) 2 ( z) = O(n), l 5. We denote by S (2,) the dominant term of S (2) ( z), i.e., S (2,) := 8n. We now compute (S (3) 2 ( z) is not necessary here) 2π exp[s( z)] exp[s 2 ( z)(iτ) 2 /2!] exp[s 4 ( z)(iτ) 4 /4! + O(nτ 5 )]dτ which gives 2 ln(2)n+( k) ln(2) Q I n (n k) e (2πS (2,) ) /2. exp{[(a +/8+C 2 /6)+(A +/4)k k 2 /4]/n+O(/n 2 )}. To compare our result with Margolius, we replace n by n + k and find I n+k (n) = 22n+k ( q q + q 2 2q + (q q )k q k 2 ) πn 8n 4n n + O(n 2 ). (8) We have and and q 2 2q = q = Q = ( 2 i ), q = 2q i 2 i, ( i(i ) 2 i + ) i 2 2 i i 2 (2 i ) 2. 7
8 j Figure 7: normalized I n (n k) (circle) and the /n term in the asymptotics (8) (line), n = 3 Margolius form of the constants follows from Euler s pentagonal theorem [] Q(z) = ( z i ) = i Z ( )i z i(3i ) 2 and differentiations: resp. q = i Z ( )i i(3i )2 i(3i ) 2 q 2 = ( i(3i ) i Z ( )i i(3i ) )2 i(3i ) 2. 2 In our formula, k can be negative as well (which was excluded in Margolius analysis). Figure 7 gives, for n = 3, I n (n k) normalized by the first two terms of (8) together with the /n correction in (8); the result is a bell shaped curve, which is perhaps not too unexpected. Figure 8 shows the quotient of I n (n k) and the asymptotics (8). 4 Case j = αn x, α > Of course, we must have that αn x is an integer. For instance, we can choose α, x integers. But this also covers more general cases, for instance I αn+β (γn + δ), with α, β, γ, δ integers. We have here z = α/( + α). We derive, to first order, [C,n (α) (j + )( + α)/α + ( + α)n] + [C 2,n (α) (j + )( + α) 2 /α 2 ( + α) 2 n]ε = with, setting ϕ(i, α) := [α/( + α)] i, C,n (α) = C (α) + O([α/( + α)] n ), C (α) = i( + α)ϕ(i, α) α[ϕ(i, α) ], C 2,n (α) = C 2 (α) + O([α/( + α)] n ), 8
9 Figure 8: Quotient of I n (n k) and the asymptotics (8), n = 3 C 2 (α) = ϕ(i, α)i( + α) 2 (i + ϕ(i, α))/[(ϕ(i, α) ) 2 α 2 ]. Set j = αn x. This leads to ε = [x + αx α + C α]/[( + α) 3 n] + O(/n 2 ). We next obtain [C,n (α) (j + )( + α)/α + ( + α)n] + [C 2,n (α) (j + )( + α) 2 /α 2 ( + α) 2 n]ε + [C 3,n (α) + ( + α) 3 n (j + )( + α) 3 /α 3 ]ε 2 = for some function C 3,n (α). More generally, powers ε k lead to a O(n) ε k term. This gives ε = [x + αx α + C α]/[( + α) 3 n] + (x + xα α + C α) (x + 2xα + xα 2 α 2 + C α 2 2α + C 2 α C )/[( + α) 6 n 2 ] + O(/n 3 ). Next we derive S ( z) = ln( ˆQ(α)) C [x + αx α + C α]/[( + α) 3 n] + O(/n 2 ) with Similarly ( ( α ) ) i ( α ) ˆQ(α) := ( ϕ(i, α)) = = Q. + α + α S 2 ( z) = [ ln(/( + α)) α ln(α/( + α))]n + (x ) ln(α/( + α)) + {(C α + α + )(C α α )/[2α( + α) 3 ] + x/[α( + α)] x 2 /[2α( + α)]}/n + O(/n 2 ). So S( z) = [ ln(/( + α)) α ln(α/( + α))]n + ln( ˆQ(α)) + (x ) ln(α/( + α)) + { (C α α ) 2 /[2α( + α) 3 ] x(c α α )/[α( + α) 2 ] x 2 /[2α( + α)]}/n + O(/n 2 ). 9
10 j Figure 9: normalized I n (αn x) (circle) and the /n term in the asymptotics (9) (line), α = /2, n = 3 The derivatives of S are computed as follows: S (2) ( z) = ( + α) 3 /αn (2xα 3 + 2C α 3 2α 3 + C 2 α 2 + 3xα 2 3α 2 2C α x + )/α 2 + O(/n), S (3) 2 ( z) = 2( + α3 )(α 2 )/α 2 n + O(), S (4) 2 ( z) = 6( + α)4 (α 3 + )/α 3 n + O(), S (l) 2 ( z) = O(n), l 5. We denote by S (2,) the dominant term of S (2) ( z), e.g., S (2,) := n( + α) 3 /α. Note that, now, S (3) 2 ( z) = O(n), so we cannot ignore its contribution. Of course, µ 3 = (third moment of the Gaussian), but µ 6, so S (3) 2 ( z) contributes to the /n term. Finally Maple gives us I n (αn x) e [ ln(/(+α)) α ln(α/(+α))]n+(x ) ln(α/(+α)) ˆQ(α) (2πS (2,) ) /2 exp[{ ( + 3α + 4α 2 2α 2 C + 6C 2 α 2 + α 4 + 3α 3 6C 2 α 2 2C 3 α)/[2α( + α) 3 ] + x(2α 2 2C α + 3α + )/[2α( + α) 2 ] x 2 /[2α( + α)]}/n + O(/n 2 )]. (9) Figure 9 gives, for α = /2, n = 3, I n (αn x) normalized by the first two terms of (9) together with the /n correction in (9). Figure shows the quotient of I n (αn x) and the asymptotics (9). 5 The moderate Large deviation, j = m + xn 7/4 Now we consider the case j = m + xn 7/4. We have here z =. We observe the same behaviour as in Section 2 for the coefficients of ε in the generalization of (4). Proceeding as before, we see that asymptotically, ε is now given by a Puiseux series of powers of n /4, starting with 36x/n 5/4. This leads to ε = 36x/n 5/4 64/25x 3 /n 7/4 + ( /3625x x)/n 9/4 + F (x)/n 5/2 + O(n /4 ),
11 Figure : Quotient of I n (αn x) and the asymptotics (9), α = /2, n = 3 where F is an (unimportant) polynomial of x. This leads to Also, and finally we obtain S( z) = ln(n!) 8x 2 n 296/25x 4 27/625x 2 (69984x 4 625)/ n 458/5625x 4 ( x 4 )/n + O(n 5/4 ). S (2) ( z) = n 3 /36 + (/ /3625x 4 )n 2 27/25x 2 n 5/2 + O(n 7/4 ), S (3) ( z) = /2n 3 + O(n 5/4 ), S (4) ( z) = n 5 /6 + O(n 9/2 ), S (l) ( z) = O(n l+ ), l 5, J n e 8x2 n 296/25x 4 [ exp x 2 ( /625x 4 + 6/25)/ n + ( 5/ /5625x /3625x 4 )/n ] + O(n 5/4 ) /(2πn 3 /36) /2. () Note that S (3) ( z) does not contribute to the correction and that this correction is equivalent to the Gaussian case when x =. Of course, the dominant term is null for x =. To check the effect of the correction, we first give in Figure, for n = 6 and x [ /4../4], the comparison between J n (j) and the asymptotics (), without the / n and /n term. Figure 2 gives the same comparison, with the correction. Figure 3 shows the quotient of J n (j) and the asymptotics (), with the / n and /n term. The exponent 7/4 that we have chosen is of course not sacred; any fixed number below 2 could also have been considered.
12 j Figure : J n (j) (circle) and the asymptotics () (line), without the / n and /n term, n = j Figure 2: J n (j) (circle) and the asymptotics () (line), with the / n and /n term, n = 6 2
13 Figure 3: Quotient of J n (j) and the asymptotics (), with the / n and /n term, n = 6 6 Large deviations, j = αn(n ), < α < /2 Here, again, z =. Asymptotically, ε is given by a Laurent series of powers of n, but here the behaviour is quite different: all terms of the series generalizing (4) contribute to the computation of the coefficients. It is convenient to analyze separately S () and S () 2. This gives, by substituting and expanding w.r.t. n, where z := ε, j = αn(n ), ε = a /n + a 2 /n 2 + a 3 /n 3 + O(/n 4 ), S () 2 ( z) (/a α)n 2 + (α αa a 2 /a 2 )n + O(), n ( z) f(k), S () k= f(k) := (k + )( ε) k /[ ( ε) k+ ] = (k + )( [a /n + a 2 /n 2 + a 3 /n 3 + O(/n 4 )]) k /{ ( [a /n + a 2 /n 2 + a 3 /n 3 + O(/n 4 )]) k+ }. This immediately suggests to apply the Euler-Mac Laurin summation formula, which gives, to first order, n S () ( z) f(k)dk (f(n) f()), 2 so we set k = un/a and expand f(k)n/a. This leads to n a f(k)dk [ ueu a 2 ( eu ) n2 + eu [2a 2 2eu a 2 2u2 a 2 u 2 a 2 + 2eu ua 2 ] ] 2a 3 ( eu ) 2 n du + O() ( (f(n) f()) 2 e a 2( e a ) 2a ) n + O(). 3
14 This readily gives n f(k)dk dilog(e a )/a 2 n 2 + [2a 3 e a + a 4 e a 4a 2 dilog(e a ) + 4a 2 dilog(e a )e a + 2a 2 a 2 e a 2a 2 + 2a 2 e a ]/[2a 3 (e a )]n + O(). Combining S () ( z) + S() 2 ( z) =, we see that a = a (α) is the solution of dilog(e a )/a 2 + /a α =. We check that lim α a (α) =, lim α /2 a (α) =. Similarly, a 2 (α) is the solution of the linear equation α αa a 2 /a 2 + e a /[2( e a )] /(2a ) + [2a 3 e a + a 4 e a + 4a 2 dilog(e a )(e a ) + 2a 2 a 2 e a 2a 2 + 2a 2 e a ]/[2a 3 (e a )] = and lim α a 2 (α) =, lim α /2 a 2 (α) =. We could proceed in the same manner to derive a 3 (α) but the computation becomes quite heavy. So we have computed an approximate solution ã 3 (α) as follows: we have expanded S () ( z) into powers of ε up to ε 9. Then an asymptotic expansion into n leads to a n coefficient which is a polynomial of a of degree 9 (of degree 2 in a 2 and linear in a 3 ). Substituting a (α), a 2 (α) immediately gives ã 3 (α). This approximation is satisfactory for α [ ]. Note that a (/4) =, a 2 (/4) = as expected, and a 3 (/4) = 36. We obtain S( z) = ln(n!) + [/72a (a α)]n + [/72a 3 /4a 2 + /4a a α 5/48a 2 + /36a a 2 + a 2 α + /2a 2 α] + [/72a /36a a 3 /4a 3 + /4a 2 + a + a 3 α + a a 2 α + /3a 3 α a 2 α /2a 2 α 5/24a a 2 + /24a 2 a 2 + 3/44a 2 /6a 3 ]/n + O(/n 2 ). Note that the three terms of S( z) are null for α = /4, as expected. This leads to Finally, J n (αn(n )) S (2) ( z) = n 3 /36 + ( 5/24 + /2a + α)n 2 + O(n), S (3) ( z) = /6a n 4 + O(n 3 ), S (4) ( z) = n 5 /6 + O(n 4 ), S (l) 2 ( z) = O(nl+ ), l 5. e [/72a (a 8+72α)]n+[/72a 3 /4a 2+/4a a α 5/48a 2 +/36a a 2 +a 2 α+/2a 2 α] (2πn 3 /36) /2 exp[(/72a /36a a 3 /4a 3 + /4a 2 /2a + a 3 α + a a 2 α + /3a 3 α a 2 α () /2a 2 α 5/24a a 2 + /24a 2 a /8a 2 /6a /25 8α)/n + O(/n 2 )]. Note that, for α = /4, the /n term gives 5/5, again as expected. Figure 4 gives, for n = 8 and α [ ], J n (αn(n )) normalized by the first two terms of (2) together with the /n correction in (2). Figure 5 shows the quotient of J n (αn(n )) and the asymptotics (2). 4
15 j Figure 4: normalized J n (αn(n )) (circle) and the /n term in the asymptotics (2) (line), n = Figure 5: Quotient of J n (αn(n )) and the asymptotics (2), n = 8 5
16 7 Conclusion Once more the saddle point method revealed itself as a powerful tool for asymptotic analysis. With careful human guidance, the computational operations are almost automatic, and can be performed to any degree of accuracy with the help of some computer algebra, at least in principle. This allowed us to include correction terms in our asymptotic formulæ, and one can see their effect in the figures displayed. References [] G.E. Andrews. The Theory of Partitions, volume 2 of Encyclopedia of Mathematics and its Applications. Addison Wesley, 976. [2] E.A. Bender. Central and local limit theorems applied to asymptotics enumeration. Journal of Combinatorial Theory, Series A, 5:9, 973. [3] W. Feller. Introduction to Probability Theory and its Applications. Vol I. Wiley, 968. [4] P. Flajolet and R. Sedgewick. Analytic combinatorics symbolic combinatorics: Saddle point asymptotics. Technical Report 2376, INRIA, 994. [5] H.K. Hwang. Large deviations of combinatorial distributions II: Local limit theorems. Annals of Applied Probability, 8:63 8, 998. [6] B.H. Margolius. Permutations with inversions. Journal of Integer Sequences, 4: 3, 2. [7] A. Odlyzko. Asymptotic Enumeration Methods. In: Handbook of combinatorics. Eds. R. Graham, M. Götschel, L. Lovász. Elsevier Science, , 995. [8] V.N. Sachkov. Probabilistic Methods in Combinatorial Analysis. Cambridge University Press,
The 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 informationAsymptotics 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 informationASYMPTOTICS OF THE EULERIAN NUMBERS REVISITED: A LARGE DEVIATION ANALYSIS
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
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 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 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 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 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 informationCounting Palindromes According to r-runs of Ones Using Generating Functions
Counting Palindromes According to r-runs of Ones Using Generating Functions Helmut Prodinger Department of Mathematics Stellenbosch University 7602 Stellenbosch South Africa hproding@sun.ac.za Abstract
More informationTwo-stage allocations and the double Q-function
Two-stage allocations and the double Q-function Sergey Agievich National Research Center for Applied Problems of Mathematics and Informatics Belarusian State University Fr. Skorina av. 4, 220050 Minsk,
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 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 informationCompositions and samples of geometric random variables with constrained multiplicities
FPSAC 2010, San Francisco, USA DMTCS proc. AN, 2010, 317 328 Compositions and samples of geometric random variables with constrained multiplicities Margaret Archibald 1 and Arnold Knopfmacher 2 and Toufik
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 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 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 informationThe Number of Guillotine Partitions in d Dimensions
The Number of Guillotine Partitions in d Dimensions Eyal Ackerman Gill Barequet Ron Y. Pinter Dan Romik Abstract Guillotine partitions play an important role in many research areas and application domains,
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 informationAlmost all trees have an even number of independent sets
Almost all trees have an even number of independent sets Stephan G. Wagner Department of Mathematical Sciences Stellenbosch University Private Bag X1, Matieland 7602, South Africa swagner@sun.ac.za Submitted:
More informationFibonacci numbers. Chapter The Fibonacci sequence. The Fibonacci numbers F n are defined recursively by
Chapter Fibonacci numbers The Fibonacci sequence The Fibonacci numbers F n are defined recursively by F n+ = F n + F n, F 0 = 0, F = The first few Fibonacci numbers are n 0 5 6 7 8 9 0 F n 0 5 8 55 89
More informationCounting permutations by cyclic peaks and valleys
Annales Mathematicae et Informaticae 43 (2014) pp. 43 54 http://ami.ektf.hu Counting permutations by cyclic peaks and valleys Chak-On Chow a, Shi-Mei Ma b, Toufik Mansour c Mark Shattuck d a Division of
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 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 311: COMPLEX ANALYSIS CONTOUR INTEGRALS LECTURE
MATH 3: COMPLEX ANALYSIS CONTOUR INTEGRALS LECTURE Recall the Residue Theorem: Let be a simple closed loop, traversed counterclockwise. Let f be a function that is analytic on and meromorphic inside. Then
More informationA REMARK ON THE BOROS-MOLL SEQUENCE
#A49 INTEGERS 11 (2011) A REMARK ON THE BOROS-MOLL SEQUENCE J.-P. Allouche CNRS, Institut de Math., Équipe Combinatoire et Optimisation Université Pierre et Marie Curie, Paris, France allouche@math.jussieu.fr
More informationMath 259: Introduction to Analytic Number Theory More about the Gamma function
Math 59: Introduction to Analytic Number Theory More about the Gamma function We collect some more facts about Γs as a function of a complex variable that will figure in our treatment of ζs and Ls, χ.
More informationTurán s Theorem and k-connected Graphs
Turán s Theorem and k-connected Graphs Nicolas Bougard* DÉPARTEMENT DE MATHÉMATIQUE UNIVERSITÉ LIBRE DE BRUXELLES BOULEVARD DU TRIOMPHE, C.P. 216 B-1050 BRUXELLES, BELGIUM Gwenaël Joret DÉPARTEMENT D INFORMATIQUE
More informationAsymptotics of generating the symmetric and alternating groups
Asymptotics of generating the symmetric and alternating groups John D. Dixon School of Mathematics and Statistics Carleton University, Ottawa, Ontario K2G 0E2 Canada jdixon@math.carleton.ca October 20,
More informationForty years of tree enumeration
October 24, 206 Canada John Moon (Alberta) Counting labelled trees Canadian mathematical monographs What is our subject? Asymptotic enumeration or Probabilistic combinatorics? What is our subject? Asymptotic
More informationCourse : Algebraic Combinatorics
Course 18.31: Algebraic Combinatorics Lecture Notes # 10 Addendum by Gregg Musiker (Based on Lauren Williams Notes for Math 19 at Harvard) February 5th - 7th, 009 1 Introduction to Partitions A partition
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 informationA class of trees and its Wiener index.
A class of trees and its Wiener index. Stephan G. Wagner Department of Mathematics Graz University of Technology Steyrergasse 3, A-81 Graz, Austria wagner@finanz.math.tu-graz.ac.at Abstract In this paper,
More informationAsymptotics of Integrals of. Hermite Polynomials
Applied Mathematical Sciences, Vol. 4, 010, no. 61, 04-056 Asymptotics of Integrals of Hermite Polynomials R. B. Paris Division of Complex Systems University of Abertay Dundee Dundee DD1 1HG, UK R.Paris@abertay.ac.uk
More informationBernoulli Polynomials
Chapter 4 Bernoulli Polynomials 4. Bernoulli Numbers The generating function for the Bernoulli numbers is x e x = n= B n n! xn. (4.) That is, we are to expand the left-hand side of this equation in powers
More informationPower Series Solutions We use power series to solve second order differential equations
Objectives Power Series Solutions We use power series to solve second order differential equations We use power series expansions to find solutions to second order, linear, variable coefficient equations
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 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 informationThe register function for lattice paths
Fifth Colloquium on Mathematics and Computer Science DMTCS proc. AI, 2008, 35 48 The register function for lattice paths Guy Louchard and Helmut Prodinger 2 Université Libre de Bruxelles, Département d
More informationOn the parity of the Wiener index
On the parity of the Wiener index Stephan Wagner Department of Mathematical Sciences, Stellenbosch University, Stellenbosch 7602, South Africa Hua Wang Department of Mathematics, University of Florida,
More informationThe cycle polynomial of a permutation group
The cycle polynomial of a permutation group Peter J. Cameron School of Mathematics and Statistics University of St Andrews North Haugh St Andrews, Fife, U.K. pjc0@st-andrews.ac.uk Jason Semeraro Department
More informationOn reaching head-to-tail ratios for balanced and unbalanced coins
Journal of Statistical Planning and Inference 0 (00) 0 0 www.elsevier.com/locate/jspi On reaching head-to-tail ratios for balanced and unbalanced coins Tamas Lengyel Department of Mathematics, Occidental
More informationGrowing and Destroying Catalan Stanley Trees
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 20:1, 2018, #11 Growing and Destroying Catalan Stanley Trees Benjamin Hackl 1 Helmut Prodinger 2 arxiv:1704.03734v3 [math.co] 26 Feb 2018
More informationSummation Techniques, Padé Approximants, and Continued Fractions
Chapter 5 Summation Techniques, Padé Approximants, and Continued Fractions 5. Accelerated Convergence Conditionally convergent series, such as 2 + 3 4 + 5 6... = ( ) n+ = ln2, (5.) n converge very slowly.
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 informationAlexander Berkovich and Frank G. Garvan Department of Mathematics, University of Florida, Gainesville, Florida
Journal of Combinatorics and Number Theory JCNT 2009, Volume 1, Issue # 3, pp. 49-64 ISSN 1942-5600 c 2009 Nova Science Publishers, Inc. THE GBG-RANK AND t-cores I. COUNTING AND 4-CORES Alexander Berkovich
More informationAlgorithmic Tools for the Asymptotics of Linear Recurrences
Algorithmic Tools for the Asymptotics of Linear Recurrences Bruno Salvy Inria & ENS de Lyon aaacuxicbvhlbtraejw1r2beg+aghxhrsgitvjycahkhcc7cskqsibs2vunxez3jpjyznsli+rf4bq7wbfwknz6f8torzenli5wqutvtxvklhcmo+juirl2/cfpwxu3wzt179x8mnx9+cqa2hkbcsgmpm+zacg1tfcjhsllavcbhidt+3+khn8e6yfq+litifvtouqjo0fpz4epelmacmfmvbkzgpnfwes2hw9ekwhw9cujzslxz9ofeb0li7nxz8dxjda8vaossotelowrthlkuxeibjhih/m96gwwtijzhqcixbjtxevdtmnqoksap2qjmhmqmwkxn2cpds0eeymlhrh8a6yr9d6rhyrmlynynyli6da0j/6fnaixep43qvy2geb+oqcvfq7tt0vxy4cixhjbuhbdcecks4+gpgiywnjxyoxtt+yveftkurjby1kzq19wcksgxfx1/m/3sef2o/q5rucybdln2pk1pxjyvctd9lapqmhbugrxfjtf7cdp0g52v0ccyr+d1fuxftt5m4j2f5dvs1wz5qp6r5yqm22shfcc7zeo4+uk+ke/kr/a2yiiyoopbg8h5zcnyqql3bxdu3c8=
More informationMATH 1A, Complete Lecture Notes. Fedor Duzhin
MATH 1A, Complete Lecture Notes Fedor Duzhin 2007 Contents I Limit 6 1 Sets and Functions 7 1.1 Sets................................. 7 1.2 Functions.............................. 8 1.3 How to define a
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 informationNotes 9 : Infinitely divisible and stable laws
Notes 9 : Infinitely divisible and stable laws Math 733 - Fall 203 Lecturer: Sebastien Roch References: [Dur0, Section 3.7, 3.8], [Shi96, Section III.6]. Infinitely divisible distributions Recall: EX 9.
More informationAsymptotic and Exact Poissonized Variance in the Analysis of Random Digital Trees (joint with Hsien-Kuei Hwang and Vytas Zacharovas)
Asymptotic and Exact Poissonized Variance in the Analysis of Random Digital Trees (joint with Hsien-Kuei Hwang and Vytas Zacharovas) Michael Fuchs Institute of Applied Mathematics National Chiao Tung University
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 information1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =
Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values
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 informationConvergence of sequences and series
Convergence of sequences and series A sequence f is a map from N the positive integers to a set. We often write the map outputs as f n rather than f(n). Often we just list the outputs in order and leave
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 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 informationNew Multiple Harmonic Sum Identities
New Multiple Harmonic Sum Identities Helmut Prodinger Department of Mathematics University of Stellenbosch 760 Stellenbosch, South Africa hproding@sun.ac.za Roberto Tauraso Dipartimento di Matematica Università
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 informationLAURENT SERIES AND SINGULARITIES
LAURENT SERIES AND SINGULARITIES Introduction So far we have studied analytic functions Locally, such functions are represented by power series Globally, the bounded ones are constant, the ones that get
More informationIDENTITIES INVOLVING BERNOULLI NUMBERS RELATED TO SUMS OF POWERS OF INTEGERS
IDENTITIES INVOLVING ERNOULLI NUMERS RELATED TO SUMS OF POWERS OF INTEGERS PIERLUIGI MAGLI Abstract. Pointing out the relations between integer power s sums and ernoulli and Genocchi polynomials, several
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 informationLECTURE 10: REVIEW OF POWER SERIES. 1. Motivation
LECTURE 10: REVIEW OF POWER SERIES By definition, a power series centered at x 0 is a series of the form where a 0, a 1,... and x 0 are constants. For convenience, we shall mostly be concerned with the
More informationLecture 3: Central Limit Theorem
Lecture 3: Central Limit Theorem Scribe: Jacy Bird (Division of Engineering and Applied Sciences, Harvard) February 8, 003 The goal of today s lecture is to investigate the asymptotic behavior of P N (
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 informationq-pell Sequences and Two Identities of V. A. Lebesgue
-Pell Seuences and Two Identities of V. A. Lebesgue José Plínio O. Santos IMECC, UNICAMP C.P. 6065, 13081-970, Campinas, Sao Paulo, Brazil Andrew V. Sills Department of Mathematics, Pennsylvania State
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 Number of Inversions and the Major Index of Permutations are Asymptotically Joint-Independently-Normal
The Number of Inversions and the Major Index of Permutations are Asymptotically Joint-Independently-Normal Andrew BAXTER 1 and Doron ZEILBERGER 1 Abstract: We use recurrences (alias difference equations)
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 informationCombinatorial Analysis of the Geometric Series
Combinatorial Analysis of the Geometric Series David P. Little April 7, 205 www.math.psu.edu/dlittle Analytic Convergence of a Series The series converges analytically if and only if the sequence of partial
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 informationA FEW REMARKS ON THE SUPREMUM OF STABLE PROCESSES P. PATIE
A FEW REMARKS ON THE SUPREMUM OF STABLE PROCESSES P. PATIE Abstract. In [1], Bernyk et al. offer a power series and an integral representation for the density of S 1, the maximum up to time 1, of a regular
More informationPHYS 3900 Homework Set #03
PHYS 3900 Homework Set #03 Part = HWP 3.0 3.04. Due: Mon. Feb. 2, 208, 4:00pm Part 2 = HWP 3.05, 3.06. Due: Mon. Feb. 9, 208, 4:00pm All textbook problems assigned, unless otherwise stated, are from the
More informationMinimax Redundancy for Large Alphabets by Analytic Methods
Minimax Redundancy for Large Alphabets by Analytic Methods Wojciech Szpankowski Purdue University W. Lafayette, IN 47907 March 15, 2012 NSF STC Center for Science of Information CISS, Princeton 2012 Joint
More informationEngel Expansions of q-series by Computer Algebra
Engel Expansions of q-series by Computer Algebra George E. Andrews Department of Mathematics The Pennsylvania State University University Park, PA 6802, USA andrews@math.psu.edu Arnold Knopfmacher The
More information11.6: Ratio and Root Tests Page 1. absolutely convergent, conditionally convergent, or divergent?
.6: Ratio and Root Tests Page Questions ( 3) n n 3 ( 3) n ( ) n 5 + n ( ) n e n ( ) n+ n2 2 n Example Show that ( ) n n ln n ( n 2 ) n + 2n 2 + converges for all x. Deduce that = 0 for all x. Solutions
More informationA Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence
A Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence Dedicated to Philippe Flajolet 1948-2011 July 4, 2013 Philippe Jacquet Charles Knessl 1 Wojciech Szpankowski 2 Bell Labs Dept. Math.
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 informationCounting k-marked Durfee Symbols
Counting k-marked Durfee Symbols Kağan Kurşungöz Department of Mathematics The Pennsylvania State University University Park PA 602 kursun@math.psu.edu Submitted: May 7 200; Accepted: Feb 5 20; Published:
More informationPartitions With Parts Separated By Parity
Partitions With Parts Separated By Parity by George E. Andrews Key Words: partitions, parity of parts, Ramanujan AMS Classification Numbers: P84, P83, P8 Abstract There have been a number of papers on
More informationPROBABILITY. Contents Preface 1 1. Introduction 2 2. Combinatorial analysis 5 3. Stirling s formula 8. Preface
PROBABILITY VITTORIA SILVESTRI Contents Preface. Introduction. Combinatorial analysis 5 3. Stirling s formula 8 Preface These lecture notes are for the course Probability IA, given in Lent 09 at the University
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 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 informationFRACTAL GEOMETRY, DYNAMICAL SYSTEMS AND CHAOS
FRACTAL GEOMETRY, DYNAMICAL SYSTEMS AND CHAOS MIDTERM SOLUTIONS. Let f : R R be the map on the line generated by the function f(x) = x 3. Find all the fixed points of f and determine the type of their
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 informationExercises for Part 1
MATH200 Complex Analysis. Exercises for Part Exercises for Part The following exercises are provided for you to revise complex numbers. Exercise. Write the following expressions in the form x + iy, x,y
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 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 informationPartial Quicksort. Conrado Martínez
Partial Quicksort Conrado Martínez Abstract This short note considers the following common problem: rearrange a given array with n elements, so that the first m places contain the m smallest elements in
More informationHow often do we reject a superior value? (Extended abstract)
How often do we reject a superior value? (Extended abstract) Kamilla Oliver, Helmut Prodinger To cite this version: Kamilla Oliver, Helmut Prodinger. How often do we reject a superior value? (Extended
More informationarxiv: v6 [math.nt] 12 Sep 2017
Counterexamples to the conjectured transcendence of /α) k, its closed-form summation and extensions to polygamma functions and zeta series arxiv:09.44v6 [math.nt] Sep 07 F. M. S. Lima Institute of Physics,
More informationMATH. 4548, Autumn 15, MWF 12:40 p.m. QUIZ 1 September 4, 2015 PRINT NAME A. Derdzinski Show all work. No calculators. The problem is worth 10 points.
MATH. 4548, Autumn 15, MWF 12:40 p.m. QUIZ 1 September 4, 2015 PRINT NAME A. Derdzinski Show all work. No calculators. The problem is worth 10 points. 1. Let f : (, 0) IR be given by f(x) = 1/x 2. Prove
More informationPROBABILITY VITTORIA SILVESTRI
PROBABILITY VITTORIA SILVESTRI Contents Preface. Introduction 2 2. Combinatorial analysis 5 3. Stirling s formula 8 4. Properties of Probability measures Preface These lecture notes are for the course
More informationThe Generating Functions for Pochhammer
The Generating Functions for Pochhammer Symbol { }, n N Aleksandar Petoević University of Novi Sad Teacher Training Faculty, Department of Mathematics Podgorička 4, 25000 Sombor SERBIA and MONTENEGRO Email
More informationOn a Conjectured Inequality for a Sum of Legendre Polynomials
On a Conjectured Inequality for a Sum of Legendre Polynomials Stefan Gerhold sgerhold@fam.tuwien.ac.at Christian Doppler Laboratory for Portfolio Risk Management Vienna University of Technology Manuel
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 informationGraphs, Partitions and Fibonacci Numbers.
Graphs, Partitions and Fibonacci Numbers. Dedicated to Professor Helmut Prodinger on the occasion of his 50th birthday Arnold Knopfmacher a Robert F. Tichy b Stephan Wagner b Volker Ziegler b a The John
More informationINTEGRATION WORKSHOP 2003 COMPLEX ANALYSIS EXERCISES
INTEGRATION WORKSHOP 23 COMPLEX ANALYSIS EXERCISES DOUGLAS ULMER 1. Meromorphic functions on the Riemann sphere It s often useful to allow functions to take the value. This exercise outlines one way to
More information, when k is fixed. We give a number of results in. k q. this direction, some of which involve Eulerian polynomials and their generalizations.
SOME ASYMPTOTIC RESULTS ON -BINOMIAL COEFFICIENTS RICHARD P STANLEY AND FABRIZIO ZANELLO Abstract We loo at the asymptotic behavior of the coefficients of the -binomial coefficients or Gaussian polynomials,
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 informationarxiv: v1 [math.nt] 4 Mar 2014
VARIATIONS ON A GENERATINGFUNCTIONAL THEME: ENUMERATING COMPOSITIONS WITH PARTS AVOIDING AN ARITHMETIC SEQUENCE arxiv:403.0665v [math.nt] 4 Mar 204 MATTHIAS BECK AND NEVILLE ROBBINS Abstract. A composition
More information