DOCSLIB.ORG

ANALYTIC COMBINATORICS — COMPLEX ASYMPTOTICS (Chapters IV, V, VI, VII)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
ANALYTIC COMBINATORICS — COMPLEX ASYMPTOTICS (Chapters IV, V, VI, VII) ANALYTIC COMBINATORICS — COMPLEX ASYMPTOTICS (Chapters IV, V, VI, VII) PHILIPPE FLAJOLET & ROBERT SEDGEWICK Algorithms Project Department of Computer Science INRIA Rocquencourt Princeton University 78153 Le Chesnay Princeton, NJ 08540 France USA Zeroth Edition, May 8, 2004 (This temporary version expires on December 31, 2004) ~ ~ ~ ~ ~ ~ i ABSTRACT This booklet develops in about 240 pages the basics of asymptotic enumeration through an approach that revolves around generating functions and complex analysis. Major proper- ties of generating functions that are of interest here are singularities. The text presents the core of the theory with two chapters on complex analytic methods focusing on rational and meromorphic functions as well as two chapters on fundamentals of singularity analysis and combinatorial consequences. It is largely oriented towards applications of complex anal- ysis to asymptotic enumeration and asymptotic properties of random discrete structures. Many examples are given that relate to words, integer compositions, paths and walks in graphs, lattice paths, constrained permutations, trees, mappings, walks, and maps. Acknowledgements. This work was supported in part by the IST Programme of the EU under contract number IST-1999-14186 (ALCOM-FT). This booklet would be substantially different (and much less informative) without Neil Sloane’s Encyclopedia of Integer Sequences and Steve Finch’s Mathematical Constants, both available on the internet. Bruno Salvy and Paul Zimmermann have developed algorithms and libraries for combinatorial structures and generating functions that are based on the MAPLE system for symbolic computations and have proven to be immensely useful. This is a set of lecture notes that are a component of a wider book project titled Analytic Combi- natorics, which will provide a unified treatment of analytic methods in combinatorics. This text contains Chapters IV, V, VI, and VII; it is a continuation of “Analytic Combinatorics—Symbolic Methods” (by Flajolet & Sedgewick, 2002). Readers are encouraged to check Philippe Flajolet’s web pages for regular updates and new developments. c Philippe Flajolet and Robert Sedgewick 2004. iii PREFACE Analytic Combinatorics aims at predicting precisely the asymptotic properties of struc- tured combinatorial configurations, through an approach that bases itself extensively on analytic methods. Generating functions are the central objects of the theory. Analytic combinatorics starts from an exact enumerative description of combinatorial structures by means of generating functions, which make their first appearance as purely formal algebraic objects. Next, generating functions are interpreted as analytic objects, that is, as mappings of the complex plane into itself. In this context, singularities play a key roleˆ in extracting a function’s coefficients in asymptotic form and extremely precise estimates result for counting sequences. This chain is applicable to a large number of problems of discrete mathematics relative to words, trees, permutations, graphs, and so on. A suitable adaptation of the theory finally opens the way to the analysis of parameters of large random structures. Analytic combinatorics can accordingly be organized based on three components: — Symbolic Methods develops systematic “symbolic” relations between some of the major constructions of discrete mathematics and operations on generating functions which exactly encode counting sequences. — Complex Asymptotics elaborates a collection of methods by which one can ex- tract asymptotic counting informations from generating functions, once these are viewed as analytic transformations of the complex domain (as “analytic” also known as“holomorphic” functions). Singularities then appear to be a key deter- minant of asymptotic behaviour. — Random Structures concerns itself with probabilistic properties of large random structures—which properties hold with “high” probability, which laws govern randomness in large objects? In the context of analytic combinatorics, this cor- responds to a deformation (adding auxiliary variables) and a perturbation (exam- ining the effect of small variations of such auxiliary variables) of the standard enumerative theory. The approach to quantitative problems of discrete mathematics provided by analytic combinatorics can be viewed as an operational calculus for combinatorics. The booklets, of which this is the second installment, expose this view by means of a very large num- ber of examples concerning classical combinatorial structures (like words, trees, permuta- tions, and graphs). What is aimed at eventually is an effective way of quantifying “metric” properties of large random structures. Accordingly, the theory is susceptible to many ap- plications, within combinatorics itself, but, perhaps more importantly, within other areas of science where discrete probabilistic models recurrently surface, like statistical physics, computational biology, or electrical engineering. Last but not least, the analysis of algo- rithms and data structures in computer science has served and still serves as an important motivation in the development of the theory. The present booklet specifically exposes Complex Asymptotics, which is a unified an- alytic theory dedicated to the process of extractic asymptotic information from counting iv generating functions. As it turns out, a collection of general (and simple) theorems provide a systematic translation mechanism between generating functions and asymptotic forms of coefficients. Four chapters compose this booklet. Chapter IV serves as an introduction to complex-analytic methods and proceeds with the treatment of meromorphic functions, that is, functions whose only singularities are poles, rational functions being the simplest case. Chapter V develops applications of rational and meromorphic asymptotics of gen- erating functions, with numerous applications related to words and languages, walks and graphs, as well as permutations. Chapter VI develops a general theory of singularity anal- ysis that applies to a wide variety of singularity types like square-root or logarithmic and has applications to trees and other recursively defined combinatorial classes. Chapter VII, presents applications of singularity analysis to 2-regular graphs and polynomials, trees of various sorts, mappings, context-free languages, walks, and maps. It contains in particu- lar a discussion of the analysis of coefficients of algebraic functions. (A future chapter, Chapter VIII, will explore saddle point methods.) Contents Chapter IV. Complex Analysis, Rational and Meromorphic Asymptotics 1 IV. 1. Generating functions as analytic objects 2 IV. 2. Analytic functions and meromorphic functions 5 IV. 2.1. Basics 6 IV. 2.2. Integrals and residues. 8 IV. 3. Singularities and exponential growth of coefficients 14 IV. 3.1. Singularities 14 IV. 3.2. The Exponential Growth Formula 18 IV. 3.3. Closure properties and computable bounds 23 IV. 4. Rational and meromorphic functions 28 IV. 4.1. Rational functions 29 IV. 4.2. Meromorphic Functions 31 IV. 5. Localization of singularities 35 IV. 5.1. Multiple singularities 35 IV. 5.2. Localization of zeros and poles 39 IV. 5.3. The example of patterns in words 41 IV. 6. Singularities and functional equations 44 IV. 7. Notes 52 Chapter V. Applications of Rational and Meromorphic Asymptotics 55 V. 1. Regular specification and languages 56 V. 2. Lattice paths and walks on the line. 69 V. 3. The supercritical sequence and its applications 81 V. 4. Functional equations: positive rational systems 87 V. 4.1. Perron-Frobenius theory of nonnegative matrices 88 V. 4.2. Positive rational functions. 90 V. 5. Paths in graphs, automata, and transfer matrices. 94 V. 5.1. Paths in graphs. 94 V. 5.2. Finite automata. 101 V. 5.3. Transfer matrix methods. 107 V. 6. Additional constructions 112 V. 7. Notes 117 Chapter VI. Singularity Analysis of Generating Functions 119 VI. 1. Introduction 120 VI. 2. Coefficient asymptotics for the basic scale 123 VI. 3. Transfers 130 VI. 4. First examples of singularity analysis 134 VI. 5. Inversion and implicitly defined functions 137 VI. 6. Singularity analysis and closure properties 141 v vi CONTENTS VI. 6.1. Functional composition. 141 VI. 6.2. Differentiation and integration 146 VI. 6.3. Polylogarithms 149 VI. 6.4. Hadamard Products 150 VI. 7. Multiple singularities 153 VI. 8. Tauberian theory and Darboux’s method 155 VI. 9. Notes 159 Chapter VII. Applications of Singularity Analysis 161 VII. 1. The “exp–log” schema 162 VII. 2. Simple varieties of trees 168 VII. 2.1. Basic analyses 168 VII. 2.2. Additive functionals 172 VII. 2.3. Enumeration of some non-plane unlabelled trees 176 VII. 2.4. Tree like structures. 179 VII. 3. Positive implicit functions 183 VII. 4. The analysis of algebraic functions 187 VII. 4.1. General algebraic functions 188 VII. 4.2. Positive algebraic systems 198 VII. 5. Combinatorial applications of algebraic functions 203 VII. 5.1. Context-free specifications and languages 204 VII. 5.2. Walks and the kernel method 208 VII. 5.3. Maps and the quadratic method 213 VII. 6. Notes 216 Appendix B. Basic Complex Analysis 219 Bibliography 235 Index 241 CHAPTER IV Complex Analysis, Rational and Meromorphic Asymptotics The shortest path between two truths in the real domain passes through the complex domain. Ð JACQUES HADAMARD 1 Generating functions are a central concept of combinatorial theory. So far, they have been treated as formal objects, that is, as formal power series. The major theme of Chapters I–III
Load more

Recommended publications
  • The Saddle Point Method in Combinatorics Asymptotic Analysis: Successes and Failures (A Personal View)
    Pn The number of inversions in permutations Median versus A (A large) for a Luria-Delbruck-like distribution, with parameter A Sum of positions of records in random permutations Merten's theorem for toral automorphisms Representations of numbers as k=−n "k k The q-Catalan numbers A simple case of the Mahonian statistic Asymptotics of the Stirling numbers of the first kind revisited The Saddle point method in combinatorics asymptotic analysis: successes and failures (A personal view) Guy Louchard May 31, 2011 Guy Louchard The Saddle point method in combinatorics asymptotic analysis: successes and failures (A personal view) Pn The number of inversions in permutations Median versus A (A large) for a Luria-Delbruck-like distribution, with parameter A Sum of positions of records in random permutations Merten's theorem for toral automorphisms Representations of numbers as k=−n "k k The q-Catalan numbers A simple case of the Mahonian statistic Asymptotics of the Stirling numbers of the first kind revisited Outline 1 The number of inversions in permutations 2 Median versus A (A large) for a Luria-Delbruck-like distribution, with parameter A 3 Sum of positions of records in random permutations 4 Merten's theorem for toral automorphisms Pn 5 Representations of numbers as k=−n "k k 6 The q-Catalan numbers 7 A simple case of the Mahonian statistic 8 Asymptotics of the Stirling numbers of the first kind revisited Guy Louchard The Saddle point method in combinatorics asymptotic analysis: successes and failures (A personal view) Pn The number of inversions in permutations Median versus A (A large) for a Luria-Delbruck-like distribution, with parameter A Sum of positions of records in random permutations Merten's theorem for toral automorphisms Representations of numbers as k=−n "k k The q-Catalan numbers A simple case of the Mahonian statistic Asymptotics of the Stirling numbers of the first kind revisited The number of inversions in permutations Let a1 ::: an be a permutation of the set f1;:::; ng.
    [Show full text]
  • The Unilateral Z–Transform and Generating Functions
    The Unilateral z{Transform and Generating Functions Recall from \Discrete{Time Linear, Time Invariant Systems and z-Transforms" that the behaviour of a discrete{time LTI system is determined by its impulse response function h[n] and that the z{transform of h[n] is 1 k H(z) = z− h[k] k=X −∞ If the LTI system is causal, then h[n] = 0 for all n < 0 and 1 k H(z) = z− h[k] Xk=0 Definition 1 (Unilateral z{Transform) The unilateral z{transform of the discrete{time signal x[n] (whether or not x[n] = 0 for negative n's) is defined to be 1 n (z) = z− x[n] X nX=0 When there is any danger of confusing the regular z{transform with the unilateral z{transform, 1 n X(z) = z− x[n] nX= 1 − is called the bilateral z{transform. Example 2 The signal x[n] = anu[n] is zero for all n < 0. So the unilateral z{transform of x[n] is the same as the ordinary z{transform. So, as we saw in Example 7 of \Discrete{Time Linear, Time Invariant Systems and z-Transforms", 1 n n 1 (z) = X(z) = z− a = 1 X 1 z− a nX=0 − 1 provided that z− a < 1, or equivalently z > a . Since the unilateral z{transform of any x[n] is always j j j j j j equal to the bilateral z{transform of the right{sided signal x[n]u[n], the region of convergence of a unilateral z{transform is always the exterior of a circle.
    [Show full text]
  • Poles and Zeros of Generalized Carathéodory Class Functions
    W&M ScholarWorks Undergraduate Honors Theses Theses, Dissertations, & Master Projects 5-2011 Poles and Zeros of Generalized Carathéodory Class Functions Yael Gilboa College of William and Mary Follow this and additional works at: https://scholarworks.wm.edu/honorstheses Part of the Mathematics Commons Recommended Citation Gilboa, Yael, "Poles and Zeros of Generalized Carathéodory Class Functions" (2011). Undergraduate Honors Theses. Paper 375. https://scholarworks.wm.edu/honorstheses/375 This Honors Thesis is brought to you for free and open access by the Theses, Dissertations, & Master Projects at W&M ScholarWorks. It has been accepted for inclusion in Undergraduate Honors Theses by an authorized administrator of W&M ScholarWorks. For more information, please contact [email protected]. Poles and Zeros of Generalized Carathéodory Class Functions A thesis submitted in partial fulfillment of the requirement for the degree of Bachelor of Science with Honors in Mathematics from The College of William and Mary by Yael Gilboa Accepted for (Honors) Vladimir Bolotnikov, Committee Chair Ilya Spiktovsky Leiba Rodman Julie Agnew Williamsburg, VA May 2, 2011 POLES AND ZEROS OF GENERALIZED CARATHEODORY´ CLASS FUNCTIONS YAEL GILBOA Date: May 2, 2011. 1 2 YAEL GILBOA Contents 1. Introduction 3 2. Schur Class Functions 5 3. Generalized Schur Class Functions 13 4. Classical and Generalized Carath´eodory Class Functions 15 5. PolesandZerosofGeneralizedCarath´eodoryFunctions 18 6. Future Research and Acknowledgments 28 References 29 POLES AND ZEROS OF GENERALIZED CARATHEODORY´ CLASS FUNCTIONS 3 1. Introduction The goal of this thesis is to establish certain representations for generalized Carath´eodory functions in terms of related classical Carath´eodory functions. Let denote the Carath´eodory class of functions f that are analytic and that have a nonnegativeC real part in the open unit disk D = z : z < 1 .
    [Show full text]
  • Ordinary Generating Functions
    CHAPTER 10 Ordinary Generating Functions Introduction We’ll begin this chapter by introducing the notion of ordinary generating functions and discussing the basic techniques for manipulating them. These techniques are merely restatements and simple applications of things you learned in algebra and calculus. You must master these basic ideas before reading further. In Section 2, we apply generating functions to the solution of simple recursions. This requires no new concepts, but provides practice manipulating generating functions. In Section 3, we return to the manipulation of generating functions, introducing slightly more advanced methods than those in Section 1. If you found the material in Section 1 easy, you can skim Sections 2 and 3. If you had some difficulty with Section 1, those sections will give you additional practice developing your ability to manipulate generating functions. Section 4 is the heart of this chapter. In it we study the Rules of Sum and Product for ordinary generating functions. Suppose that we are given a combinatorial description of the construction of some structures we wish to count. These two rules often allow us to write down an equation for the generating function directly from this combinatorial description. Without such tools, we may get bogged down in lengthy algebraic manipulations. 10.1 What are Generating Functions? In this section, we introduce the idea of ordinary generating functions and look at some ways to manipulate them. This material is essential for understanding later material on generating functions. Be sure to work the exercises in this section before reading later sections! Definition 10.1 Ordinary generating function (OGF) Suppose we are given a sequence a0,a1,..
    [Show full text]
  • Asymptotic Analysis for Periodic Structures
    ASYMPTOTIC ANALYSIS FOR PERIODIC STRUCTURES A. BENSOUSSAN J.-L. LIONS G. PAPANICOLAOU AMS CHELSEA PUBLISHING American Mathematical Society • Providence, Rhode Island ASYMPTOTIC ANALYSIS FOR PERIODIC STRUCTURES ASYMPTOTIC ANALYSIS FOR PERIODIC STRUCTURES A. BENSOUSSAN J.-L. LIONS G. PAPANICOLAOU AMS CHELSEA PUBLISHING American Mathematical Society • Providence, Rhode Island M THE ATI A CA M L ΤΡΗΤΟΣ ΜΗ N ΕΙΣΙΤΩ S A O C C I I R E E T ΑΓΕΩΜΕ Y M A F O 8 U 88 NDED 1 2010 Mathematics Subject Classification. Primary 80M40, 35B27, 74Q05, 74Q10, 60H10, 60F05. For additional information and updates on this book, visit www.ams.org/bookpages/chel-374 Library of Congress Cataloging-in-Publication Data Bensoussan, Alain. Asymptotic analysis for periodic structures / A. Bensoussan, J.-L. Lions, G. Papanicolaou. p. cm. Originally published: Amsterdam ; New York : North-Holland Pub. Co., 1978. Includes bibliographical references. ISBN 978-0-8218-5324-5 (alk. paper) 1. Boundary value problems—Numerical solutions. 2. Differential equations, Partial— Asymptotic theory. 3. Probabilities. I. Lions, J.-L. (Jacques-Louis), 1928–2001. II. Papani- colaou, George. III. Title. QA379.B45 2011 515.353—dc23 2011029403 Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy a chapter for use in teaching or research. Permission is granted to quote brief passages from this publication in reviews, provided the customary acknowledgment of the source is given. Republication, systematic copying, or multiple reproduction of any material in this publication is permitted only under license from the American Mathematical Society.
    [Show full text]
  • Definite Integrals in an Asymptotic Setting
    A Lost Theorem: Definite Integrals in An Asymptotic Setting Ray Cavalcante and Todor D. Todorov 1 INTRODUCTION We present a simple yet rigorous theory of integration that is based on two axioms rather than on a construction involving Riemann sums. With several examples we demonstrate how to set up integrals in applications of calculus without using Riemann sums. In our axiomatic approach even the proof of the existence of the definite integral (which does use Riemann sums) becomes slightly more elegant than the conventional one. We also discuss an interesting connection between our approach and the history of calculus. The article is written for readers who teach calculus and its applications. It might be accessible to students under a teacher’s supervision and suitable for senior projects on calculus, real analysis, or history of mathematics. Here is a summary of our approach. Let ρ :[a, b] → R be a continuous function and let I :[a, b] × [a, b] → R be the corresponding integral function, defined by y I(x, y)= ρ(t)dt. x Recall that I(x, y) has the following two properties: (A) Additivity: I(x, y)+I (y, z)=I (x, z) for all x, y, z ∈ [a, b]. (B) Asymptotic Property: I(x, x + h)=ρ (x)h + o(h)ash → 0 for all x ∈ [a, b], in the sense that I(x, x + h) − ρ(x)h lim =0. h→0 h In this article we show that properties (A) and (B) are characteristic of the definite integral. More precisely, we show that for a given continuous ρ :[a, b] → R, there is no more than one function I :[a, b]×[a, b] → R with properties (A) and (B).
    [Show full text]
  • Control Systems
    ECE 380: Control Systems Course Notes: Winter 2014 Prof. Shreyas Sundaram Department of Electrical and Computer Engineering University of Waterloo ii c Shreyas Sundaram Acknowledgments Parts of these course notes are loosely based on lecture notes by Professors Daniel Liberzon, Sean Meyn, and Mark Spong (University of Illinois), on notes by Professors Daniel Davison and Daniel Miller (University of Waterloo), and on parts of the textbook Feedback Control of Dynamic Systems (5th edition) by Franklin, Powell and Emami-Naeini. I claim credit for all typos and mistakes in the notes. The LATEX template for The Not So Short Introduction to LATEX 2" by T. Oetiker et al. was used to typeset portions of these notes. Shreyas Sundaram University of Waterloo c Shreyas Sundaram iv c Shreyas Sundaram Contents 1 Introduction 1 1.1 Dynamical Systems . .1 1.2 What is Control Theory? . .2 1.3 Outline of the Course . .4 2 Review of Complex Numbers 5 3 Review of Laplace Transforms 9 3.1 The Laplace Transform . .9 3.2 The Inverse Laplace Transform . 13 3.2.1 Partial Fraction Expansion . 13 3.3 The Final Value Theorem . 15 4 Linear Time-Invariant Systems 17 4.1 Linearity, Time-Invariance and Causality . 17 4.2 Transfer Functions . 18 4.2.1 Obtaining the transfer function of a differential equation model . 20 4.3 Frequency Response . 21 5 Bode Plots 25 5.1 Rules for Drawing Bode Plots . 26 5.1.1 Bode Plot for Ko ....................... 27 5.1.2 Bode Plot for sq ....................... 28 s −1 s 5.1.3 Bode Plot for ( p + 1) and ( z + 1) .
    [Show full text]
  • The Bloch-Wigner-Ramakrishnan Polylogarithm Function
    Math. Ann. 286, 613424 (1990) Springer-Verlag 1990 The Bloch-Wigner-Ramakrishnan polylogarithm function Don Zagier Max-Planck-Insfitut fiir Mathematik, Gottfried-Claren-Strasse 26, D-5300 Bonn 3, Federal Republic of Germany To Hans Grauert The polylogarithm function co ~n appears in many parts of mathematics and has an extensive literature [2]. It can be analytically extended to the cut plane ~\[1, ~) by defining Lira(x) inductively as x [ Li m_ l(z)z-tdz but then has a discontinuity as x crosses the cut. However, for 0 m = 2 the modified function O(x) = ~(Liz(x)) + arg(1 -- x) loglxl extends (real-) analytically to the entire complex plane except for the points x=0 and x= 1 where it is continuous but not analytic. This modified dilogarithm function, introduced by Wigner and Bloch [1], has many beautiful properties. In particular, its values at algebraic argument suffice to express in closed form the volumes of arbitrary hyperbolic 3-manifolds and the values at s= 2 of the Dedekind zeta functions of arbitrary number fields (cf. [6] and the expository article [7]). It is therefore natural to ask for similar real-analytic and single-valued modification of the higher polylogarithm functions Li,. Such a function Dm was constructed, and shown to satisfy a functional equation relating D=(x-t) and D~(x), by Ramakrishnan E3]. His construction, which involved monodromy arguments for certain nilpotent subgroups of GLm(C), is completely explicit, but he does not actually give a formula for Dm in terms of the polylogarithm. In this note we write down such a formula and give a direct proof of the one-valuedness and functional equation.
    [Show full text]
  • Real Rational Filters, Zeros and Poles
    Real Rational Filters, Zeros and Poles Jack Xin (Lecture) and J. Ernie Esser (Lab) ∗ Abstract Classnotes on real rational filters, causality, stability, frequency response, impulse response, zero/pole analysis, minimum phase and all pass filters. 1 Real Rational Filter and Frequency Response A real rational filter takes the form of difference equations in the time domain: a(1)y(n) = b(1)x(n)+ b(2)x(n 1) + + b(nb + 1)x(n nb) − ··· − a(2)y(n 1) a(na + 1)y(n na), (1) − − −···− − where na and nb are nonnegative integers (number of delays), x is input signal, y is filtered output signal. In the z-domain, the z-transforms X and Y are related by: Y (z)= H(z) X(z), (2) where X and Y are z-transforms of x and y respectively, and H is called the transfer function: b(1) + b(2)z−1 + + b(nb + 1)z−nb H(z)= ··· . (3) a(1) + a(2)z−1 + + a(na + 1)z−na ··· The filter is called real rational because H is a rational function of z with real coefficients in numerator and denominator. The frequency response of the filter is H(ejθ), where j = √ 1, θ [0, π]. The θ [π, 2π] − ∈ ∈ portion does not contain more information due to complex conjugacy. In Matlab, the frequency response is obtained by: [h, θ] = freqz(b, a, N), where b = [b(1), b(2), , b(nb + 1)], a = [a(1), a(2), , a(na + 1)], N refers to number of ··· ··· sampled points for θ on the upper unit semi-circle; h is a complex vector with components H(ejθ) at sampled points of θ.
    [Show full text]
  • Residue Theorem
    Topic 8 Notes Jeremy Orloff 8 Residue Theorem 8.1 Poles and zeros f z z We remind you of the following terminology: Suppose . / is analytic at 0 and f z a z z n a z z n+1 ; . / = n. * 0/ + n+1. * 0/ + § a ≠ f n z n z with n 0. Then we say has a zero of order at 0. If = 1 we say 0 is a simple zero. f z Suppose has an isolated singularity at 0 and Laurent series b b b n n*1 1 f .z/ = + + § + + a + a .z * z / + § z z n z z n*1 z z 0 1 0 . * 0/ . * 0/ * 0 < z z < R b ≠ f n z which converges on 0 * 0 and with n 0. Then we say has a pole of order at 0. n z If = 1 we say 0 is a simple pole. There are several examples in the Topic 7 notes. Here is one more Example 8.1. z + 1 f .z/ = z3.z2 + 1/ has isolated singularities at z = 0; ,i and a zero at z = *1. We will show that z = 0 is a pole of order 3, z = ,i are poles of order 1 and z = *1 is a zero of order 1. The style of argument is the same in each case. At z = 0: 1 z + 1 f .z/ = ⋅ : z3 z2 + 1 Call the second factor g.z/. Since g.z/ is analytic at z = 0 and g.0/ = 1, it has a Taylor series z + 1 g.z/ = = 1 + a z + a z2 + § z2 + 1 1 2 Therefore 1 a a f .z/ = + 1 +2 + § : z3 z2 z This shows z = 0 is a pole of order 3.
    [Show full text]
  • Introducing Taylor Series and Local Approximations Using a Historical and Semiotic Approach Kouki Rahim, Barry Griffiths
    Introducing Taylor Series and Local Approximations using a Historical and Semiotic Approach Kouki Rahim, Barry Griffiths To cite this version: Kouki Rahim, Barry Griffiths. Introducing Taylor Series and Local Approximations using a Historical and Semiotic Approach. IEJME, Modestom LTD, UK, 2019, 15 (2), 10.29333/iejme/6293. hal- 02470240 HAL Id: hal-02470240 https://hal.archives-ouvertes.fr/hal-02470240 Submitted on 7 Feb 2020 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. INTERNATIONAL ELECTRONIC JOURNAL OF MATHEMATICS EDUCATION e-ISSN: 1306-3030. 2020, Vol. 15, No. 2, em0573 OPEN ACCESS https://doi.org/10.29333/iejme/6293 Introducing Taylor Series and Local Approximations using a Historical and Semiotic Approach Rahim Kouki 1, Barry J. Griffiths 2* 1 Département de Mathématique et Informatique, Université de Tunis El Manar, Tunis 2092, TUNISIA 2 Department of Mathematics, University of Central Florida, Orlando, FL 32816-1364, USA * CORRESPONDENCE: [email protected] ABSTRACT In this article we present the results of a qualitative investigation into the teaching and learning of Taylor series and local approximations. In order to perform a comparative analysis, two investigations are conducted: the first is historical and epistemological, concerned with the pedagogical evolution of semantics, syntax and semiotics; the second is a contemporary institutional investigation, devoted to the results of a review of curricula, textbooks and course handouts in Tunisia and the United States.
    [Show full text]
  • An Introduction to Asymptotic Analysis Simon JA Malham
    An introduction to asymptotic analysis Simon J.A. Malham Department of Mathematics, Heriot-Watt University Contents Chapter 1. Order notation 5 Chapter 2. Perturbation methods 9 2.1. Regular perturbation problems 9 2.2. Singular perturbation problems 15 Chapter 3. Asymptotic series 21 3.1. Asymptotic vs convergent series 21 3.2. Asymptotic expansions 25 3.3. Properties of asymptotic expansions 26 3.4. Asymptotic expansions of integrals 29 Chapter 4. Laplace integrals 31 4.1. Laplace's method 32 4.2. Watson's lemma 36 Chapter 5. Method of stationary phase 39 Chapter 6. Method of steepest descents 43 Bibliography 49 Appendix A. Notes 51 A.1. Remainder theorem 51 A.2. Taylor series for functions of more than one variable 51 A.3. How to determine the expansion sequence 52 A.4. How to find a suitable rescaling 52 Appendix B. Exam formula sheet 55 3 CHAPTER 1 Order notation The symbols , o and , were first used by E. Landau and P. Du Bois- Reymond and areOdefined as∼ follows. Suppose f(z) and g(z) are functions of the continuous complex variable z defined on some domain C and possess D ⊂ limits as z z0 in . Then we define the following shorthand notation for the relative!propertiesD of these functions in the limit z z . ! 0 Asymptotically bounded: f(z) = (g(z)) as z z ; O ! 0 means that: there exists constants K 0 and δ > 0 such that, for 0 < z z < δ, ≥ j − 0j f(z) K g(z) : j j ≤ j j We say that f(z) is asymptotically bounded by g(z) in magnitude as z z0, or more colloquially, and we say that f(z) is of `order big O' of g(z).
    [Show full text]