Combinatorial/probabilistic analysis of a class of search-tree functionals
|
|
- Cody Gallagher
- 5 years ago
- Views:
Transcription
1 Combinatorial/probabilistic analysis of a class of search-tree functionals Jim Fill jimfill@jhu.edu fill/ Mathematical Sciences The Johns Hopkins University Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.1
2 This is joint work (in progress) with Philippe Flajolet, INRIA Nevin Kapur, JHU Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.2
3 Goal For additive functionals on random m-ary search trees: derive asymptotic approximations to distributions Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.3
4 Goal For additive functionals on random m-ary search trees: derive asymptotic approximations to distributions obtain rates of convergence (still to do) Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.3
5 Goal For additive functionals on random m-ary search trees: derive asymptotic approximations to distributions obtain rates of convergence (still to do) study relation between input toll sequence and functional Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.3
6 Goal For additive functionals on random m-ary search trees: Tools: derive asymptotic approximations to distributions obtain rates of convergence (still to do) study relation between input toll sequence and functional get complete asymptotic expansions of moments Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.3
7 Goal For additive functionals on random m-ary search trees: Tools: derive asymptotic approximations to distributions obtain rates of convergence (still to do) study relation between input toll sequence and functional get complete asymptotic expansions of moments combinatorial/probabilistic transfer results linking asymptotics of toll sequence to that of functional Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.3
8 Goal For additive functionals on random m-ary search trees: Tools: derive asymptotic approximations to distributions obtain rates of convergence (still to do) study relation between input toll sequence and functional get complete asymptotic expansions of moments combinatorial/probabilistic transfer results linking asymptotics of toll sequence to that of functional singularity analysis (based on complex analysis) Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.3
9 m-ary search trees fundamental data structure in computer science generalizes the concept of a binary search tree Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.4
10 m-ary search trees Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.5
11 m-ary search trees each sequence of n distinct keys can be associated with an m-ary search tree got by inserting successive elements of the sequence into an initially empty tree Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.5
12 Probability models uniform model each tree equally likely (future work) Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.6
13 Probability models uniform model each tree equally likely (future work) random permutation model each permutation on [n] := {1,..., n} equally likely (this talk) Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.6
14 Probability models uniform model each tree equally likely (future work) random permutation model each permutation on [n] := {1,..., n} equally likely (this talk) Q: probability mass function of the distribution induced by associating an m-ary search tree with each of the n! permutations on [n] Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.6
15 Probability models uniform model each tree equally likely (future work) random permutation model each permutation on [n] := {1,..., n} equally likely (this talk) Q: probability mass function of the distribution induced by associating an m-ary search tree with each of the n! permutations on [n] Q is a crude measure of the shape of a tree balanced tree large Q Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.6
16 Probability models uniform model each tree equally likely (future work) random permutation model each permutation on [n] := {1,..., n} equally likely (this talk) Q: probability mass function of the distribution induced by associating an m-ary search tree with each of the n! permutations on [n] Q is a crude measure of the shape of a tree balanced tree large Q (Dobrow & Fill, 1995) Q(T ) = 1/ ( T (x) ) x full m 1 Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.6
17 Probability models uniform model each tree equally likely (future work) random permutation model each permutation on [n] := {1,..., n} equally likely (this talk) Q: probability mass function of the distribution induced by associating an m-ary search tree with each of the n! permutations on [n] Q is a crude measure of the shape of a tree balanced tree large Q (Dobrow & Fill, 1995) Q(T ) = 1/ ( T (x) ) x full m 1 shape functional: Λ(T ) := ln Q(T ) Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.6
18 Notation x T2 T3 T4 T 1 = T(x) T = 15 full nodes contain m 1 keys Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.7
19 Additive-type tree functionals f(t ) = m f(t i ) + c T, T m 1 i=1 (c n ) n m 1 : toll sequence think of toll sequence as input and additive functional as output Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.8
20 Additive-type tree functionals f(t ) = m f(t i ) + c T, T m 1 i=1 (c n ) n m 1 : toll sequence think of toll sequence as input and additive functional as output Examples: 1. c n := 1: space requirement (Mahmoud & Pittel, 1989; Chern & Hwang, 2001) 2. c n := n (m 1): internal path length (Mahmoud, 1992) [analysis of m-ary Quicksort!] 3. c n := ln ( n m 1 ) : shape functional Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.8
21 1. limit laws center the functional using lead order term of the mean Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.9
22 1. limit laws center the functional using lead order term of the mean observe that all moments of the centered functional satisfy a recurrence relation of the same form Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.9
23 1. limit laws center the functional using lead order term of the mean observe that all moments of the centered functional satisfy a recurrence relation of the same form use a general (combinatorial) transfer theorem to get asymptotics for all moments of the centered functional Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.9
24 1. limit laws center the functional using lead order term of the mean observe that all moments of the centered functional satisfy a recurrence relation of the same form use a general (combinatorial) transfer theorem to get asymptotics for all moments of the centered functional conclude convergence in distribution using method of moments (when possible) Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.9
25 1. limit laws center the functional using lead order term of the mean observe that all moments of the centered functional satisfy a recurrence relation of the same form use a general (combinatorial) transfer theorem to get asymptotics for all moments of the centered functional conclude convergence in distribution using method of moments (when possible) alternative method: contraction method (not today) Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.9
26 Details: distn. of subtree size recall f(t ) = m f(t i ) + c T i=1 Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.10
27 Details: distn. of subtree size recall f(t ) = m f(t i ) + c T i=1 for T = n, and all i, j, ( ) /( ) n j 1 n P ( T = j) = m 2 m 1 Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.10
28 Details: distn. of subtree size recall f(t ) = m f(t i ) + c T i=1 for T = n, and all i, j, ( ) /( ) n j 1 n P ( T = j) = m 2 m 1 so, for n m 1, µ n = m ( n m 1) j µ n := Ef(T ) satisfies ( n j 1 m 2 ) µ j + c n Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.10
29 Details: recurrence rels. & diff. eqs. the sequence (a n ) of moments of each specified order satisfy a recurrence relation of the form a n = ( m n m 1) ( ) n j 1 a j + b n m 2 j Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.11
30 Details: recurrence rels. & diff. eqs. the sequence (a n ) of moments of each specified order satisfy a recurrence relation of the form a n = ( m n m 1) ( ) n j 1 a j + b n m 2 j equivalent to linear differential equation with characteristic polynomial ψ(λ) := λ(λ + 1) (λ + m 2) m! with roots 2 = λ 1,..., λ m 1 Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.11
31 Details: explicit solution! for simplicity, consider case b 1 = = b m 2 = 0 Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.12
32 Details: explicit solution! for simplicity, consider case b 1 = = b m 2 = 0 solution easiest to state using generating functions: A(z) = B(z) + m! m 1 j=1 (1 z) λ j ψ (λ j ) z ζ=0 B(ζ)(1 ζ) λ j 1 dζ Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.12
33 Details: explicit solution! for simplicity, consider case b 1 = = b m 2 = 0 solution easiest to state using generating functions: A(z) = B(z) + m! m 1 j=1 (1 z) λ j ψ (λ j ) z ζ=0 B(ζ)(1 ζ) λ j 1 dζ for general initial conditions, get extra term of form m 1 j=1 r j (1 z) λ j Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.12
34 Transfer theorem examples transfer for small input: b n = o(n) and n=0 b j (n + 1)(n + 2) converges transfers to a n = K 1 H m 1 n + o(n), where K 1 := j=0 b j (j + 1)(j + 2). Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.13
35 Transfer theorem examples transfer for small input: b n = o(n) and n=0 b j (n + 1)(n + 2) converges transfers to a n = K 1 H m 1 n + o(n), where K 1 := j=0 b j (j + 1)(j + 2). one refinement: if m 26 and b n = o( n), then a n = K 1 H m 1 n + o( n) Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.13
36 General transfer theorem links the asymptotic behavior of the remainder sequence (b n ) (input) to (a n ) (output) Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.14
37 General transfer theorem links the asymptotic behavior of the remainder sequence (b n ) (input) to (a n ) (output) Input (b n ) Output (a n ) b n = o(n) etc. a n K 1 H m 1 n b n Kn a n K H m 1 n log n b n Kn v, R(v) > 1 a n K 1 m!γ(v+1) Γ(v+m) n v Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.14
38 General transfer theorem links the asymptotic behavior of the remainder sequence (b n ) (input) to (a n ) (output) Input (b n ) Output (a n ) b n = o(n) etc. a n K 1 H m 1 n b n Kn a n K H m 1 n log n b n Kn v, R(v) > 1 a n K 1 m!γ(v+1) Γ(v+m) refined transfers available; require additional conditions n v Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.14
39 Distributional asymptotics & phase changes small toll sequence: c n = O(n 1/2 L(n)): Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.15
40 Distributional asymptotics & phase changes small toll sequence: c n = O(n 1/2 L(n)): asymptotic normality if m 26 Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.15
41 Distributional asymptotics & phase changes small toll sequence: c n = O(n 1/2 L(n)): asymptotic normality if m 26 periodicity (typically) if m 27 Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.15
42 Distributional asymptotics & phase changes small toll sequence: c n = O(n 1/2 L(n)): asymptotic normality if m 26 periodicity (typically) if m 27 moderate toll sequence: c n n γ L(n), 1 2 < γ < 1: Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.15
43 Distributional asymptotics & phase changes small toll sequence: c n = O(n 1/2 L(n)): asymptotic normality if m 26 periodicity (typically) if m 27 moderate toll sequence: c n n γ L(n), 1 2 < γ < 1: convergence to non-normal distributions if m m 0 (where m 0 26) Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.15
44 Distributional asymptotics & phase changes small toll sequence: c n = O(n 1/2 L(n)): asymptotic normality if m 26 periodicity (typically) if m 27 moderate toll sequence: c n n γ L(n), 1 2 < γ < 1: convergence to non-normal distributions if m m 0 (where m 0 26) periodicity (typically) if m m Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.15
45 Distributional asymptotics & phase changes small toll sequence: c n = O(n 1/2 L(n)): asymptotic normality if m 26 periodicity (typically) if m 27 moderate toll sequence: c n n γ L(n), 1 2 < γ < 1: convergence to non-normal distributions if m m 0 (where m 0 26) periodicity (typically) if m m large toll sequence: c n n γ L(n) with γ 1: Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.15
46 Distributional asymptotics & phase changes small toll sequence: c n = O(n 1/2 L(n)): asymptotic normality if m 26 periodicity (typically) if m 27 moderate toll sequence: c n n γ L(n), 1 2 < γ < 1: convergence to non-normal distributions if m m 0 (where m 0 26) periodicity (typically) if m m large toll sequence: c n n γ L(n) with γ 1: convergence to non-normal distributions for all values of m [γ = 1: Quicksort # of comparisons] Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.15
47 2. Moments: full asymptotic expansions recall: moments (a n ) of each specified order satisfy a n = ( m n m 1) ( ) n j 1 a j + b n m 2 j with (b n ) defined in terms of moments of lower orders, and (for vanishing initial conditions) A(z) = B(z) + m! m 1 j=1 (1 z) λ j ψ (λ j ) z ζ=0 B(ζ)(1 ζ) λ j 1 dζ Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.16
48 Moment expansions remember A(z) = B(z) + m! m 1 j=1 (1 z) λ j ψ (λ j ) z ζ=0 B(ζ)(1 ζ) λ j 1 dζ Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.17
49 Moment expansions remember A(z) = B(z) + m! m 1 j=1 (1 z) λ j ψ (λ j ) z ζ=0 B(ζ)(1 ζ) λ j 1 dζ full asymptotic expansion for g.f. of toll sequence (c n ) transfers to one for g.f. of sequence of means Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.17
50 Moment expansions remember A(z) = B(z) + m! m 1 j=1 (1 z) λ j ψ (λ j ) z ζ=0 B(ζ)(1 ζ) λ j 1 dζ full asymptotic expansion for g.f. of toll sequence (c n ) transfers to one for g.f. of sequence of means inductively, get full asymptotic expansion for g.f. of sequence of moments of each order Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.17
51 Moment expansions remember A(z) = B(z) + m! m 1 j=1 (1 z) λ j ψ (λ j ) z ζ=0 B(ζ)(1 ζ) λ j 1 dζ full asymptotic expansion for g.f. of toll sequence (c n ) transfers to one for g.f. of sequence of means inductively, get full asymptotic expansion for g.f. of sequence of moments of each order use singularity analysis [Flajolet & Odlyzko, 1990] to get full asymptotic expansions for moments Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.17
52 Prototype: the shape functional c n := ln ( n m 1), n m 1 Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.18
53 Prototype: the shape functional c n := ln ( n m 1), n m 1 vanishing initial conditions Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.18
54 Prototype: the shape functional c n := ln ( n m 1), n m 1 vanishing initial conditions using Tauberian methods, with C 1 := K 1 /(H m 1), Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.18
55 Prototype: the shape functional c n := ln ( n m 1), n m 1 vanishing initial conditions using Tauberian methods, with C 1 := K 1 /(H m 1), first moments: µ n C 1 n Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.18
56 Prototype: the shape functional c n := ln ( n m 1), n m 1 vanishing initial conditions using Tauberian methods, with C 1 := K 1 /(H m 1), first moments: µ n C 1 n second moments: ν n C 2 1n 2 Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.18
57 Prototype: the shape functional c n := ln ( n m 1), n m 1 vanishing initial conditions using Tauberian methods, with C 1 := K 1 /(H m 1), first moments: µ n C 1 n second moments: ν n C 2 1n 2 can t go beyond lead order, because side conditions can t be established Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.18
58 Prototype: the shape functional c n := ln ( n m 1), n m 1 vanishing initial conditions using Tauberian methods, with C 1 := K 1 /(H m 1), first moments: µ n C 1 n second moments: ν n C 2 1n 2 can t go beyond lead order, because side conditions can t be established in fact, can t get lead order for variance Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.18
59 Singularity Analysis alternative approach: singularity analysis [Flajolet & Odlyzko, 1990] Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.19
60 Singularity Analysis alternative approach: singularity analysis [Flajolet & Odlyzko, 1990] aids in determination of asymptotic order of growth of (Taylor) coefficients of functions analytic at the origin f(z) = O(g(z)) f n = O(g n ) f(z) = o(g(z)) f n = o(g n ) f(z) g(z) f n g n. Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.19
61 Singularity Analysis alternative approach: singularity analysis [Flajolet & Odlyzko, 1990] aids in determination of asymptotic order of growth of (Taylor) coefficients of functions analytic at the origin f(z) = O(g(z)) f n = O(g n ) f(z) = o(g(z)) f n = o(g n ) f(z) g(z) f n g n. based on Cauchy integral formula in indented crown, judicious choices of contours Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.19
62 Singularity Analysis alternative approach: singularity analysis [Flajolet & Odlyzko, 1990] aids in determination of asymptotic order of growth of (Taylor) coefficients of functions analytic at the origin f(z) = O(g(z)) f n = O(g n ) f(z) = o(g(z)) f n = o(g n ) f(z) g(z) f n g n. based on Cauchy integral formula in indented crown, judicious choices of contours no side conditions on sequence required Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.19
63 SA: what we know Flajolet and Odlyzko [1990] give sufficient conditions for validity of these implications when g(z) is of the form (1 z) β (log (1 z)) γ (log log (1 z)) δ Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.20
64 SA: what we know Flajolet and Odlyzko [1990] give sufficient conditions for validity of these implications when g(z) is of the form (1 z) β (log (1 z)) γ (log log (1 z)) δ Flajolet [1998] showed that singularity analysis is applicable to the generalized polylogarithm Li α,r (z) := (ln n) r zn n α n=1 Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.20
65 SA: new extensions (1) Recall A(z) = B(z) + m! m 1 j=1 (1 z) λ j ψ (λ j ) z ζ=0 B(ζ)(1 ζ) λ j 1 dζ where B(z) is the g.f. of a sequence that depends on the toll sequence. We need Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.21
66 SA: new extensions (1) Recall A(z) = B(z) + m! m 1 j=1 (1 z) λ j ψ (λ j ) z ζ=0 B(ζ)(1 ζ) λ j 1 dζ where B(z) is the g.f. of a sequence that depends on the toll sequence. We need (1) closure under indefinite integration Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.21
67 SA: new extensions (1) Recall A(z) = B(z) + m! m 1 j=1 (1 z) λ j ψ (λ j ) z ζ=0 B(ζ)(1 ζ) λ j 1 dζ where B(z) is the g.f. of a sequence that depends on the toll sequence. We need (1) closure under indefinite integration (2) closure under differentiation (used, e.g., for closure under Hadamard product) Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.21
68 SA: new extensions (1) Recall A(z) = B(z) + m! m 1 j=1 (1 z) λ j ψ (λ j ) z ζ=0 B(ζ)(1 ζ) λ j 1 dζ where B(z) is the g.f. of a sequence that depends on the toll sequence. We need (1) closure under indefinite integration (2) closure under differentiation (used, e.g., for closure under Hadamard product) for example, f(z) = O((1 z) β ) in indented crown implies f (z) = O((1 z) β 1 ) in indented crown Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.21
69 SA: new extensions (2) (3) closure under Hadamard product: (f g)(z) := n=0 f n g n z n Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.22
70 SA: new extensions (2) (3) closure under Hadamard product: (f g)(z) := n=0 f n g n z n these three closure results extend SA toolbox for asymptotic expansions Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.22
71 Application: shape functional (1) using the integral representation of the generating function of the mean and singularity analysis we can show (for m even) G 1 (z) m 1 j=1 + Ã j (1 z) λ j + B (1 z) 1 log (1 z) 1 + L 1 (1 z) 1 + r m 1 m 2 r=0 L r (1 z) r [K r (1 z) r log (1 z) 1 + L r (1 z) r ] Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.23
72 Application: shape functional (2) transfer back to get (for m even) µ n m 1 j=1 + Ã j λ j n n! r m 1 H n + L 1 K r r (( 1 n )) = (1 + o(1))c 1 n Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.24
73 Application: shape functional (2) transfer back to get (for m even) µ n m 1 j=1 + Ã j λ j n n! r m 1 H n + L 1 K r r (( 1 n )) = (1 + o(1))c 1 n similar result for m odd except for an extra (1 z) m [log (1 z) 1 ] 2 term in the generating function Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.24
74 Application: second moments alternative form of solution to recurrence relation: for vanishing initial conditions (e.g.), A(z) = m 1 j=1 (1 z) λ j ψ (λ j ) z ζ=0 B (m 1) (ζ)(1 ζ) λ j+m 2 dζ Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.25
75 Application: second moments alternative form of solution to recurrence relation: for vanishing initial conditions (e.g.), A(z) = m 1 j=1 (1 z) λ j ψ (λ j ) z ζ=0 B (m 1) (ζ)(1 ζ) λ j+m 2 dζ when A(z) is the second-moment g.f. G 2 (z), B (m 1) (z) = (m 1)m!(1 z) (m 2) G 2 1(z)+D (m 1) (z), where d n := c n (2µ n c n ), n m 1 Joint Statistical Meetings; Atlanta, GA; August 5, 2001 p.25
The Subtree Size Profile of Plane-oriented Recursive Trees
The Subtree Size Profile of Plane-oriented Recursive Trees Michael Fuchs Department of Applied Mathematics National Chiao Tung University Hsinchu, Taiwan ANALCO11, January 22nd, 2011 Michael Fuchs (NCTU)
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 space requirement of m-ary search trees: distributional asymptotics for m 27
1 The space requirement of m-ary search trees: distributional asymptotics for m 7 James Allen Fill 1 and Nevin Kapur 1 Applied Mathematics and Statistics, The Johns Hopkins University, 3400 N. Charles
More informationSingularity Analysis, Hadamard Products, and Tree Recurrences
Singularity Analysis, Hadamard Products, and Tree Recurrences James Allen Fill Philippe Flajolet 2 Nevin Kapur The Johns Hopkins University, Department of Mathematical Sciences, 34th and Charles Streets,
More informationDESTRUCTION OF VERY SIMPLE TREES
DESTRUCTION OF VERY SIMPLE TREES JAMES ALLEN FILL, NEVIN KAPUR, AND ALOIS PANHOLZER Abstract. We consider the total cost of cutting down a random rooted tree chosen from a family of so-called very simple
More informationANALYSIS OF SOME TREE STATISTICS
ANALYSIS OF SOME TREE STATISTICS ALOIS PANHOLZER Abstract. In this survey we present results and the used proof techniques concerning the analysis of several parameters in frequently used tree families.
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 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 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 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 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 information3. Generating Functions
ANALYTIC COMBINATORICS P A R T O N E 3. Generating Functions http://aofa.cs.princeton.edu ANALYTIC COMBINATORICS P A R T O N E 3. Generating Functions OF OGFs Solving recurrences Catalan numbers EGFs Counting
More informationMapping the Discrete Logarithm: Talk 2
Mapping the Discrete Logarithm: Talk 2 Joshua Holden Joint work with Daniel Cloutier, Nathan Lindle (Senior Theses), Max Brugger, Christina Frederick, Andrew Hoffman, and Marcus Mace (RHIT REU) Rose-Hulman
More informationLIMITING DISTRIBUTIONS FOR ADDITIVE FUNCTIONALS ON CATALAN TREES
LIMITING DISTRIBUTIONS FOR ADDITIVE FUNCTIONALS ON CATALAN TREES JAMES ALLEN FILL AND NEVIN KAPUR Abstract. Additive tree functionals represent the cost of many divide-andconquer algorithms. We derive
More informationDependence between Path Lengths and Size in Random Trees (joint with H.-H. Chern, H.-K. Hwang and R. Neininger)
Dependence between Path Lengths and Size in Random Trees (joint with H.-H. Chern, H.-K. Hwang and R. Neininger) Michael Fuchs Institute of Applied Mathematics National Chiao Tung University Hsinchu, Taiwan
More informationAnalysis Comprehensive Exam, January 2011 Instructions: Do as many problems as you can. You should attempt to answer completely some questions in both
Analysis Comprehensive Exam, January 2011 Instructions: Do as many problems as you can. You should attempt to answer completely some questions in both real and complex analysis. You have 3 hours. Real
More informationarxiv: v1 [math.pr] 21 Mar 2014
Asymptotic distribution of two-protected nodes in ternary search trees Cecilia Holmgren Svante Janson March 2, 24 arxiv:4.557v [math.pr] 2 Mar 24 Abstract We study protected nodes in m-ary search trees,
More informationEverything You Always Wanted to Know about Quicksort, but Were Afraid to Ask. Marianne Durand
Algorithms Seminar 200 2002, F. Chyzak (ed., INRIA, (2003, pp. 57 62. Available online at the URL http://algo.inria.fr/seminars/. Everything You Always Wanted to Know about Quicksort, but Were Afraid to
More informationFighting Fish: enumerative properties. Enrica Duchi. Veronica Guerrini & Simone Rinaldi DIISM, Università di Siena.
Fighting Fish: enumerative properties Enrica Duchi IRIF, Université Paris Diderot Veronica Guerrini & Simone Rinaldi DIISM, Università di Siena Gilles Schaeffer LIX, CNRS and École Polytechnique Séminaire
More informationApplications of Discrete Mathematics to the Analysis of Algorithms
Applications of Discrete Mathematics to the Analysis of Algorithms Conrado Martínez Univ. Politècnica de Catalunya, Spain May 2007 Goal Given some algorithm taking inputs from some set Á, we would like
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 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 informationOn the number of subtrees on the fringe of random trees (partly joint with Huilan Chang)
On the number of subtrees on the fringe of random trees (partly joint with Huilan Chang) Michael Fuchs Institute of Applied Mathematics National Chiao Tung University Hsinchu, Taiwan April 16th, 2008 Michael
More informationAsymptotic distribution of two-protected nodes in ternary search trees
Asymptotic distribution of two-protected nodes in ternary search trees Cecilia Holmgren Svante Janson March 2, 204; revised October 5, 204 Abstract We study protected nodes in m-ary search trees, by putting
More informationDigital search trees JASS
Digital search trees Analysis of different digital trees with Rice s integrals. JASS Nicolai v. Hoyningen-Huene 28.3.2004 28.3.2004 JASS 04 - Digital search trees 1 content Tree Digital search tree: Definition
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 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 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 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 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 informationarxiv: v1 [math.co] 12 Apr 2018
COMBINATORIAL ANALYSIS OF GROWTH MODELS FOR SERIES-PARALLEL NETWORKS MARKUS KUBA AND ALOIS PANHOLZER arxiv:804.0550v [math.co] Apr 08 Abstract. We give combinatorial descriptions of two stochastic growth
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 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 informationAdditive tree functionals with small toll functions and subtrees of random trees
Additive tree functionals with small toll functions and subtrees of random trees Stephan Wagner To cite this version: Stephan Wagner. Additive tree functionals with small toll functions and subtrees of
More informationAlgorithmic 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 informationCombinatorial Enumeration. Jason Z. Gao Carleton University, Ottawa, Canada
Combinatorial Enumeration Jason Z. Gao Carleton University, Ottawa, Canada Counting Combinatorial Structures We are interested in counting combinatorial (discrete) structures of a given size. For example,
More informationThe Moments of the Profile in Random Binary Digital Trees
Journal of mathematics and computer science 6(2013)176-190 The Moments of the Profile in Random Binary Digital Trees Ramin Kazemi and Saeid Delavar Department of Statistics, Imam Khomeini International
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 information9. Series representation for analytic functions
9. Series representation for analytic functions 9.. Power series. Definition: A power series is the formal expression S(z) := c n (z a) n, a, c i, i =,,, fixed, z C. () The n.th partial sum S n (z) is
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 informationAn asymptotic theory for Cauchy Euler differential equations with applications to the analysis of algorithms
Journal of Algorithms 44 2002 77 225 www.academicpress.com An asymptotic theory for Cauchy Euler differential equations with applications to the analysis of algorithms Hua-Huai Chern, a, Hsien-Kuei Hwang,
More informationNON-FRINGE SUBTREES IN CONDITIONED GALTON WATSON TREES
NON-FRINGE SUBTREES IN CONDITIONED GALTON WATSON TREES XING SHI CAI AND SVANTE JANSON Abstract. We study ST n, the number of subtrees in a conditioned Galton Watson tree of size n. With two very different
More informationPhase changes in random m-ary search trees and generalized quicksort
Phase changes in random m-ary search trees and generalized quicksort Hua-Huai Chern Department of Mathematics and Science Education Taipei Municipal Teacher College Taipei Taiwan Hsien-Kuei Hwang 2 Institute
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 informationA method for determining the mod-2 k behaviour of (certain) recursive sequences
A method for determining the mod-2 k behaviour of (certain) recursive sequences Universität Linz; Universität Wien; Queen Mary, University of London Let (a n ) n 0 be a sequence of integers, where a n
More informationCENTRAL LIMIT THEOREMS FOR ADDITIVE TREE PARAMETERS
CENRAL LIMI HEOREMS FOR ADDIIVE REE PARAMEERS SEPHAN WAGNER DEDICAED O HE MEMORY OF PHILIPPE FLAJOLE Abstract. We call a tree parameter additive if it can be determined recursively as the sum of the parameter
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 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 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 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 informationCS 161 Summer 2009 Homework #2 Sample Solutions
CS 161 Summer 2009 Homework #2 Sample Solutions Regrade Policy: If you believe an error has been made in the grading of your homework, you may resubmit it for a regrade. If the error consists of more than
More informationAnalytic Combinatorics: A Primer
Analytic Combinatorics: A Primer Conrado Martínez Univ. Politècnica de Catalunya, Spain April 2011 What is this course about? Analytic Combinatorics seeks to develop mathematical techniques that help us
More informationELEMENTARY PROPERTIES OF ANALYTIC FUNCTIONS OF SEVERAL VARIABLES
ELEMENTARY PROPERTIES OF ANALYTIC FUNCTIONS OF SEVERAL VARIABLES MARTIN TAMM. Basic Definitions Let C n denote the set of all n-tuples of compex numbers, i.e. the set of all elements z = (z, z,..., z n
More informationToday s Outline. CS 362, Lecture 4. Annihilator Method. Lookup Table. Annihilators for recurrences with non-homogeneous terms Transformations
Today s Outline CS 362, Lecture 4 Jared Saia University of New Mexico Annihilators for recurrences with non-homogeneous terms Transformations 1 Annihilator Method Lookup Table Write down the annihilator
More informationGAUSSIAN LAWS MICHÈLE SORIA. 8 october 2015 IHP Séminaire Flajolet IN ANALYTIC COMBINATORICS
GAUSSIAN LAWS IN ANALYTIC COMBINATORICS MICHÈLE SORIA 8 october 205 IHP Séminaire Flajolet / 43 Michèle Soria Gaussian Laws in Analytic Combinatorics Analytic Combinatorics Estimate properties of large
More informationComplex Analysis Homework 9: Solutions
Complex Analysis Fall 2007 Homework 9: Solutions 3..4 (a) Let z C \ {ni : n Z}. Then /(n 2 + z 2 ) n /n 2 n 2 n n 2 + z 2. According to the it comparison test from calculus, the series n 2 + z 2 converges
More informationRIEMANN MAPPING THEOREM
RIEMANN MAPPING THEOREM VED V. DATAR Recall that two domains are called conformally equivalent if there exists a holomorphic bijection from one to the other. This automatically implies that there is an
More information1 Solving Linear Recurrences
Solving Linear Recurrences Suppose we have a sequence a n defined by the formula The first couple terms of the sequence are a n = 3a n +, a 0 =, 4, 3, 40, 2,... Can you find a general closed for expression
More informationHartogs Theorem: separate analyticity implies joint Paul Garrett garrett/
(February 9, 25) Hartogs Theorem: separate analyticity implies joint Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ (The present proof of this old result roughly follows the proof
More informationarxiv: v1 [math.co] 1 Aug 2018
REDUCING SIMPLY GENERATED TREES BY ITERATIVE LEAF CUTTING BENJAMIN HACKL, CLEMENS HEUBERGER, AND STEPHAN WAGNER arxiv:1808.00363v1 [math.co] 1 Aug 2018 ABSTRACT. We consider a procedure to reduce simply
More informationApproximate Counting via the Poisson-Laplace-Mellin Method (joint with Chung-Kuei Lee and Helmut Prodinger)
Approximate Counting via the Poisson-Laplace-Mellin Method (joint with Chung-Kuei Lee and Helmut Prodinger) Michael Fuchs Department of Applied Mathematics National Chiao Tung University Hsinchu, Taiwan
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 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 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 informationPart IB Complex Analysis
Part IB Complex Analysis Theorems Based on lectures by I. Smith Notes taken by Dexter Chua Lent 2016 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after
More informationANALYTIC COMBINATORICS COMPLEX ASYMPTOTICS
ANALYTIC COMBINATORICS COMPLEX ASYMPTOTICS (Chapters IV, V, VI, VII) PHILIPPE FLAJOLET & ROBERT SEDGEWICK Algorithms Project Department of Computer Science INRIA Rocquencourt Princeton University 7853
More informationAn Introduction to Complex Analysis and Geometry John P. D Angelo, Pure and Applied Undergraduate Texts Volume 12, American Mathematical Society, 2010
An Introduction to Complex Analysis and Geometry John P. D Angelo, Pure and Applied Undergraduate Texts Volume 12, American Mathematical Society, 2010 John P. D Angelo, Univ. of Illinois, Urbana IL 61801.
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 informationNon-perturbative effects in ABJM theory
October 9, 2015 Non-perturbative effects in ABJM theory 1 / 43 Outline 1. Non-perturbative effects 1.1 General aspects 1.2 Non-perturbative aspects of string theory 1.3 Non-perturbative effects in M-theory
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 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 informationA BIJECTION BETWEEN WELL-LABELLED POSITIVE PATHS AND MATCHINGS
Séminaire Lotharingien de Combinatoire 63 (0), Article B63e A BJECTON BETWEEN WELL-LABELLED POSTVE PATHS AND MATCHNGS OLVER BERNARD, BERTRAND DUPLANTER, AND PHLPPE NADEAU Abstract. A well-labelled positive
More informationGENERALIZED STIRLING PERMUTATIONS, FAMILIES OF INCREASING TREES AND URN MODELS
GENERALIZED STIRLING PERMUTATIONS, FAMILIES OF INCREASING TREES AND URN MODELS SVANTE JANSON, MARKUS KUBA, AND ALOIS PANHOLZER ABSTRACT. Bona [6] studied the distribution of ascents, plateaux and descents
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 informationApplications of Analytic Combinatorics in Mathematical Biology (joint with H. Chang, M. Drmota, E. Y. Jin, and Y.-W. Lee)
Applications of Analytic Combinatorics in Mathematical Biology (joint with H. Chang, M. Drmota, E. Y. Jin, and Y.-W. Lee) Michael Fuchs Department of Applied Mathematics National Chiao Tung University
More informationOutline. Computer Science 331. Cost of Binary Search Tree Operations. Bounds on Height: Worst- and Average-Case
Outline Computer Science Average Case Analysis: Binary Search Trees Mike Jacobson Department of Computer Science University of Calgary Lecture #7 Motivation and Objective Definition 4 Mike Jacobson (University
More informationarxiv:math/ v1 [math.co] 28 Apr 2003
ICM 2002 Vol. III 1 3 arxiv:math/0304465v1 [math.co] 28 Apr 2003 Singular Combinatorics Philippe Flajolet Abstract Combinatorial enumeration leads to counting generating functions presenting a wide variety
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 informationRandom Boolean expressions
Random Boolean expressions Danièle Gardy PRiSM, Univ. Versailles-Saint Quentin and CNRS UMR 8144. Daniele.Gardy@prism.uvsq.fr We examine how we can define several probability distributions on the set of
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 informationPolynomial expansions in the Borel region
Polynomial expansions in the Borel region By J. T. HURT and L. R. FORD, Rice Institute, Houston, Texas. (Received 22nd August, 1936. Read 6th November, 1936.) This paper deals with certain expansions of
More information4 Uniform convergence
4 Uniform convergence In the last few sections we have seen several functions which have been defined via series or integrals. We now want to develop tools that will allow us to show that these functions
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 informationMath 421 Homework 1. Paul Hacking. September 22, 2015
Math 421 Homework 1 Paul Hacking September 22, 2015 (1) Compute the following products of complex numbers. Express your answer in the form x + yi where x and y are real numbers. (a) (2 + i)(5 + 3i) (b)
More informationd 1 µ 2 Θ = 0. (4.1) consider first the case of m = 0 where there is no azimuthal dependence on the angle φ.
4 Legendre Functions In order to investigate the solutions of Legendre s differential equation d ( µ ) dθ ] ] + l(l + ) m dµ dµ µ Θ = 0. (4.) consider first the case of m = 0 where there is no azimuthal
More informationNovember 18, 2013 ANALYTIC FUNCTIONAL CALCULUS
November 8, 203 ANALYTIC FUNCTIONAL CALCULUS RODICA D. COSTIN Contents. The spectral projection theorem. Functional calculus 2.. The spectral projection theorem for self-adjoint matrices 2.2. The spectral
More informationCSCE 222 Discrete Structures for Computing. Review for Exam 2. Dr. Hyunyoung Lee !!!
CSCE 222 Discrete Structures for Computing Review for Exam 2 Dr. Hyunyoung Lee 1 Strategy for Exam Preparation - Start studying now (unless have already started) - Study class notes (lecture slides and
More informationarxiv:math.pr/ v1 17 May 2004
Probabilistic Analysis for Randomized Game Tree Evaluation Tämur Ali Khan and Ralph Neininger arxiv:math.pr/0405322 v1 17 May 2004 ABSTRACT: We give a probabilistic analysis for the randomized game tree
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 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 informationRandom Boolean expressions
Computational Logic and Applications, CLA 05 DMTCS proc. AF, 2006, 1 36 Random Boolean expressions Danièle Gardy PRiSM, Univ. Versailles-Saint Quentin and CNRS UMR 8144. Daniele.Gardy@prism.uvsq.fr We
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 informationPartial match queries in random quadtrees
Partial match queries in random quadtrees Nicolas Broutin nicolas.broutin@inria.fr Projet Algorithms INRIA Rocquencourt 78153 Le Chesnay France Ralph Neininger and Henning Sulzbach {neiningr, sulzbach}@math.uni-frankfurt.de
More informationSingularity Analysis: A Perspective
MSRI, Berkeley, June 2004 Singularity Analysis: A Perspective Philippe Flajolet (Inria, France) Analysis of Algorithms Average-Case, Probabilistic Properties of Random Structures? Counting and asymptotics
More informationPhysics 505 Fall 2005 Homework Assignment #7 Solutions
Physics 505 Fall 005 Homework Assignment #7 Solutions Textbook problems: Ch. 4: 4.10 Ch. 5: 5.3, 5.6, 5.7 4.10 Two concentric conducting spheres of inner and outer radii a and b, respectively, carry charges
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 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 informationSeries Solutions Near an Ordinary Point
Series Solutions Near an Ordinary Point MATH 365 Ordinary Differential Equations J. Robert Buchanan Department of Mathematics Spring 2018 Ordinary Points (1 of 2) Consider the second order linear homogeneous
More informationProblems for MATH-6300 Complex Analysis
Problems for MATH-63 Complex Analysis Gregor Kovačič December, 7 This list will change as the semester goes on. Please make sure you always have the newest version of it.. Prove the following Theorem For
More informationENGR-1100 Introduction to Engineering Analysis. Lecture 23
ENGR-1100 Introduction to Engineering Analysis Lecture 23 Today s Objectives: Students will be able to: a) Draw the free body diagram of a frame and its members. FRAMES b) Determine the forces acting at
More information