7 Asymptotics for Meromorphic Functions
|
|
- Darren Thornton
- 5 years ago
- Views:
Transcription
1 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 growth is very crude in describing the coefficients. In this section we concentrate on asymptotics of rational and meromorphic generating functions. 7. Pringsheim s Theorem A dominant singularity of a function f(z) analytic at zero with radius of convergence ρ > 0 is a singularity on the circle z = ρ. The saddle point method gives a broad approach when the power series has a strong enough dominant singularity at z = ρ. In some cases, the saddle point method can be greatly simplified, in particular, in the case of meromorphic functions with finitely many poles. The first step towards a theorem for meromorphic functions is Pringsheim s Theorem: Theorem (Pringsheim s Theorem) Let A C[[X]] have non-negative real coefficients and finite radius of convergence ρ > 0. Then z = ρ is a dominant singularity of A. Proof We proved in Hadamard s Theorem that there is a singularity of A on z = ρ, otherwise a compactness argument shows that A converges on a disc z σ with σ > ρ. Suppose for a contradiction that A is analytic at z = ρ. Then there is an ε > 0 such that A converges on z ρ ε. In particular A converges at ρ ε and so 4 A(z) = n 0 b n (z ρ + ε 4 )n is convergent. If a n = [X n ]A(X) then the binomial theorem shows ( ) n b k = a n (ρ ε 4 k )n k. n=0 Also A(z) converges at ρ + ϵ and so performing an expansion around ρ ε with radius ε 4 2 we get A(ρ + ε) = ( ) n a 4 n (ρ ε 4 k )n k ( ε 2 )k. k=0 n=0 This is an absolutely convergent sum since a k 0 for all k, and so by the binomial theorem, A(ρ + ε) = a 4 n (ρ + ε 2 )n. n=0
2 It follows that lim n a n (ρ + ε 2 )n = 0 which contradicts that the radius of convergence of A is ρ. If A is analytic at zero and has non-negative real coefficients, then within the radius of convergence A(z) = A(z) and so dominant singularities come in complex conjugate pairs. Pringsheim s Theorem guarantees at least the dominant singularity z = ρ, although there may be others with equal modulus, such as for ( z 2 ) /2 which has z = ± as the dominant singularities. 7.2 Meromorphic Functions We are now ready to describe the asymptotics of power series of meromorphic functions, and in particular, asymptotics for rational functions. The main point is that the two are essentially the same, since we can via Laurent series expansion write a meromorphic function as a rational function plus an analytic term this is sometimes called the method of subtracted singularities. Theorem 2 (Meromorphic Asymptotics) Let A C[[X]] have finite radius of convergence ρ > 0 and suppose A is analytic on z = ρ and has poles z, z 2,..., z k in the disc z ρ of orders m, m 2,..., m k respectively. Then there exist polynomials P i (X) of degree m i such that k [X n ]A(X) P i (z i )z n = O(ρ n ). i= In particular, if A is a rational function, then i [X n ]A(X) = k i= P i (z i )z n i. Proof For the statement on rational functions, we may give a direct proof using partial fraction decomposition (similar to the linear recurrence equations theorem) and we leave it as an exercise. The first identity can be proved directly via Cauchy s Residue Theorem, which furthermore shows that the O(ρ n ) term is at most ρ n sup z =ρ A(z) ; here we give a direct proof based on the rational case. The key idea is that for some polynomials Q i (z) of degree m i, B(z) = A(z) k i= n= m i Q i (z) k (z z i ) = A(z) B n i (z) i= is analytic on the circle γ of radius ρ. This follows by collecting all negative powers of z z i in the Laurent series expansion of A at each pole z i. Now since B i (z) is a rational function we have from the rational case that [X n ]B i (X) = P i (z i )z n i for some polynomial 2
3 P i of degree m i. It remains to consider B(z), and we use a saddle point bound: let γ be the curve z = ρ and observe [X n ]B(X) = B(z) dz ρ sup B(z) ρ n = O(ρ n ) 2πi zn+ z =ρ since B is analytic on γ. This proves the theorem. γ A key fact here is that if there is a unique dominant singularity of A(z) then we can obtain from the theorem an asymptotic formula for [X n ]A(X), and even more, the more the singularities are spaced out, the better choice we can make for ρ to minimize the error term ρ n sup z =ρ A(z). 7.3 Four short applications Surjections. Recall that the number of surjections from [n] onto an initial segment of the integers is R n = r=0 r!s n,r where S n,r is the Stirling number of the second kind the number of partitions of [n] into r non-empty sets. As a power series R(X) with coefficients R n, we get using exponential generating functions: R(X) = n=0 r=0 r! S n,r n! Xn = r=0 (exp(x) )r r! r! = 2 exp(x). Now this is a meromorphic function with simple poles at log 2+2ikπ. The closest singularity to the origin is log 2 and all other singularties have modulus at least log 2 + 4π 2 > 6. Taking the circle z = 6 in the meromorphic asymptotics theorem, we get R n n! = P (log 2) (log 2) n + O(6 n ). To determine the constant we just compute the real limit lim z log 2 z log 2 2 exp(z) = 2 from which one obtains R n = n! 2 (log 2) n + O(n!6 n ). This is a striking example of how close we get to the actual number of surjections, with the error term 6 n explaining the precision. 3
4 Alignments. An alignment is an ordered sequence of cycles partitioning [n]. For instance, the permutation (2,, 3) gives rise to two alignments, namely (2, ), (3) and (3), (2, ). Let A n be the number of alignments of [n]. By the product lemma, the exponential generating function for alignments satisfies Ψ(X) = + log( X) since log( X) is the exponential generating function for cycles. A singularity lies at z = /e, coming from log( z) =. According to the meromorphic asymptotics theorem, A n n! e ( e ) n. A tiling example. On exercise sheet, it was required to find a recurrence relation for the number of domino tilings of a 3 n grid. If a n is the number of tilings, one finds a n = 4a n 2 a n 4. Note that a n = 0 if n is odd. One can solve this recurrence relation, but instead we move directly to the asymptotic behavior of a n. The characteristic equation is x 4 4x 2 + = 0. The two roots closest to the origin are ± 2 3 and each is a simple pole of the generating function. By the rational function asymptotics theorem, a n c (2 3) n/2. The generating function is (with initial conditions a 0 = 0 = a = a 3 and a 2 = 3: Φ(X) = 3X 4X 2 + X 4 Taking limits of (x 2 3)Φ(x) as x 2 3 we get a n 3 2 (2 3) n/2 = 3 2 (2 + 3) n/2. For the 4 n grid, it can be shown that the number a n of tilings satisfies a n = a n + 5a n 2 + a n 3 a n 4. 4
5 The root of the characteristic equation closest to the origin is α = ( (7 + ) 29) 4 and therefore for some constant β > 0, a n βα n. The value of β is found as above and is left as an exercise. Compositions into primes. Let P be the set of primes. The number a n of compositions of an integer n into primes is generated by Φ(X) = Φ P (X) = X 2 X 3 X An approximation to the smallest root α of the denominator is found by considering A(X) = X p and Then for any x [0, ), B(X) = p P :p r p P :p r X p + Xr+ X. A(x) Φ(x) B(x) and if α m is the smallest real root of A(x) = and β m is the smallest real root of B(x) =, then lim m α m = lim m β m = α. So we can find α = and then a n γα n where γ = A similar approach can be used for compositions into parts from other sequences of integers. For instance, one could let Q be the set of prime numbers of the form k 2 + with k N. Then we have Φ(X) = X 2 X 3 X 5 X 7 X We can approximate the smallest root α = of the denominator as above, and so obtain an approximate asymptotic formula for the number of compositions of an integer n into primes of the form k 2 + : k N. This is despite the notorious open question of determining whether there are infinitely many primes which are one more than an integer square. 5
6 7.4 Strings with forbidden substrings The autocorrelation polynomial for a string σ of letters from a finite alphabet Σ is the polynomial c(x) defined by c i = [X i ]c(x) = σ j = σ i+j for j =, 2,..., σ i where i = 0,,..., σ. So for instance, for binary strings, if σ = 00 then c(x) = + X 3, if σ = 000 then c(x) = + X + X 2 and if σ = 00 then c(x) = + X 2. Observe that if S is a set of strings avoiding σ and T is the set of strings with σ at the end and no prior appearance of σ, then S T = {ε} SΣ and if σ = σ σ 2... σ k are the letters of σ, then ( ) Sσ = T (σ k i+ σ k i+2... σ k ). c i = In the latter equality, we decompose strings in Sσ by their leftmost appearance of σ as a substring. Combining the formal equations gives Φ S + Φ T = + Σ XΦ S and Solving the equations we get Φ S (X) = X k Φ S = Φ T c(x). c(x) X k + ( Σ X)c(X). This is a rational function to which the rational function asymptotics theorem can be applied to get asymptotics. For instance, suppose we want to consider the number of strings of length n from the alphabet Σ = {, 2, 3} that do not contain 232 (contiguously). Then c(x) = + X 4 and Φ S (X) = + X 4 X 5 + ( 3X)( + X 4 ) = + X 4 3X + X 4 2X 5. The denominator has a unique root α = and this is a dominant singularity. The next nearest one to the origin has modulus about Taking ρ =.05 say, we get that the number of strings of length n with no 232 is asymptotic to a constant times α n and we find that constant in the usual way using limits. 6
7 7.5 A statistical theorem We recall that if Φ S (X) is the generating function for a finite set S of configurations, then Φ (X)/Φ(X) at X = is the expected weight or average weight of configurations in S. A power series A(z) is called aperiodic if A(z) is not identically equal to B(z d ) for any d 2 and B analytic at the origin. In this section, if T is a set of configurations with weight function ω, then T is implicitly assumed to have a weight function that is additive with respect to T, so that Φ T (X) = /( Φ T (X) by the product lemma. Theorem 3 Let T be a set of configurations with weight function ω and suppose that Φ T (z) has radius of convergence ρ > 0 and Φ T (ρ) > and Φ is aperiodic. Let α (0, ρ) be the unique root of Φ T (x) =. Then [X n ]Φ T (X) α n+ Φ T (α). Furthermore, the average number of parts in a string from T of weight n is asymptotic to n + Φ T + (α). (α) (α)2 αφ T Φ T Proof Since Φ T has non-negative coefficients, Φ T (z) > 0 for z (0, ρ) so α is well-defined. Furthermore Φ T (z) is analytic on (0, α) and has a simple pole at z = α since Φ T (z) > 0 for z (0, ρ). Pringsheim s Theorem shows that Φ T (z) has radius of convergence α and Φ T (z) (z α)φ T (α) as z α. Now one can show using the aperiodicity of Φ T that there exists r > α such that Φ T (z) has only one pole, α, in the disc z α r, and therefore Φ T (z) is meromorphic and the meromorphic functions theorem applies. One computes [X n ]Φ T (X) = ] αφ T (α)[xn z/α + O(r n ) α n+ Φ T (α) as required. The average number of parts is ] [X n ]Φ Y = T (X)[Xn Y Φ T (X) Y = Φ T (X) ] [X n ]Φ T (X)[Xn ( Φ T (X)) 2 where Y as usual marks parts. Now Φ T /( Φ T ) 2 as a pole of order two at α. By the meromorphic functions theorem, Φ T (z) ( Φ T (z)) 2 α 2 Φ T (α)2 ( z/α) 2 as z α. Computing the coefficients and using the first part of the theorem gives the result. 7
8 The reader should check what happens if A(z) is not aperiodic, and what the appropriate version of the above theorem would be in that case (and why it does not hold as stated if A(z) is not aperiodic). One also can compute higher moments: for example one can compute the variance of the number of parts in compositions, and so on. There are many other asymptotic statistical theorems that can be derived from generating functions, for now these are beyond the scope of this course. Average number of parts in compositions. If we consider compositions of n, then there are 2 n compositions in total, and the average number of parts by the last theorem is asymptotic to n/2. This is confirmed by the exact average which is n k= ( ) n k k 2 = n +. n 2 Suppose we consider now the average number of parts in a composition of n in which all parts have size at least two. If T = {2, 3, 4,... } then Φ T (X) = Φ T (X) =. X2 X Clearly Φ T (z) is aperiodic with radius of convergence ρ =. The unique root of Φ T (X) = in (0, ) is α = ( 5 )/2. Therefore the number of compositions is asymptotic to α n+ Φ T (α) = ( 5 + ) n. 5 2 The average number of parts in these compositions is computed from the theorem: it is asymptotically equal to ( )n 5( ) 0.276n. We recall we also computed statistics for binary strings on exercise sheet, for example, the average number of blocks in a binary string of length n, or the average number of occurrences of a particular substring. One can develop similar theorems to the one given here for various other statistics of T. 8
Recommended questions: a-d 4f 5 9a a 27.
Sheet jacques@ucsdedu Recommended questions: 2 3 4a-d 4f 5 9a 0 2 3 5 6 8 9 20 22 23 24 25a 27 Recommended reading for this assignment: Aigner Chapter, Chapter 2-24 Formal power series Question Let R be
More informationNATIONAL UNIVERSITY OF SINGAPORE Department of Mathematics MA4247 Complex Analysis II Lecture Notes Part II
NATIONAL UNIVERSITY OF SINGAPORE Department of Mathematics MA4247 Complex Analysis II Lecture Notes Part II Chapter 2 Further properties of analytic functions 21 Local/Global behavior of analytic functions;
More information13 Maximum Modulus Principle
3 Maximum Modulus Principle Theorem 3. (maximum modulus principle). If f is non-constant and analytic on an open connected set Ω, then there is no point z 0 Ω such that f(z) f(z 0 ) for all z Ω. Remark
More informationTheorem [Mean Value Theorem for Harmonic Functions] Let u be harmonic on D(z 0, R). Then for any r (0, R), u(z 0 ) = 1 z z 0 r
2. A harmonic conjugate always exists locally: if u is a harmonic function in an open set U, then for any disk D(z 0, r) U, there is f, which is analytic in D(z 0, r) and satisfies that Re f u. Since such
More informationSolutions to Complex Analysis Prelims Ben Strasser
Solutions to Complex Analysis Prelims Ben Strasser In preparation for the complex analysis prelim, I typed up solutions to some old exams. This document includes complete solutions to both exams in 23,
More informationComplex Analysis Math 185A, Winter 2010 Final: Solutions
Complex Analysis Math 85A, Winter 200 Final: Solutions. [25 pts] The Jacobian of two real-valued functions u(x, y), v(x, y) of (x, y) is defined by the determinant (u, v) J = (x, y) = u x u y v x v y.
More informationPart IB. Further Analysis. Year
Year 2004 2003 2002 2001 10 2004 2/I/4E Let τ be the topology on N consisting of the empty set and all sets X N such that N \ X is finite. Let σ be the usual topology on R, and let ρ be the topology on
More informationPOWER SERIES AND ANALYTIC CONTINUATION
POWER SERIES AND ANALYTIC CONTINUATION 1. Analytic functions Definition 1.1. A function f : Ω C C is complex-analytic if for each z 0 Ω there exists a power series f z0 (z) := a n (z z 0 ) n which converges
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 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 informationF (z) =f(z). f(z) = a n (z z 0 ) n. F (z) = a n (z z 0 ) n
6 Chapter 2. CAUCHY S THEOREM AND ITS APPLICATIONS Theorem 5.6 (Schwarz reflection principle) Suppose that f is a holomorphic function in Ω + that extends continuously to I and such that f is real-valued
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 informationSolutions to practice problems for the final
Solutions to practice problems for the final Holomorphicity, Cauchy-Riemann equations, and Cauchy-Goursat theorem 1. (a) Show that there is a holomorphic function on Ω = {z z > 2} whose derivative is z
More informationNPTEL web course on Complex Analysis. A. Swaminathan I.I.T. Roorkee, India. and. V.K. Katiyar I.I.T. Roorkee, India
NPTEL web course on Complex Analysis A. Swaminathan I.I.T. Roorkee, India and V.K. Katiyar I.I.T. Roorkee, India A.Swaminathan and V.K.Katiyar (NPTEL) Complex Analysis 1 / 17 Complex Analysis Module: 5:
More informationDepartment of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2014
Department of Mathematics, University of California, Berkeley YOUR 1 OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2014 1. Please write your 1- or 2-digit exam number on
More informationComplex Variables. Instructions Solve any eight of the following ten problems. Explain your reasoning in complete sentences to maximize credit.
Instructions Solve any eight of the following ten problems. Explain your reasoning in complete sentences to maximize credit. 1. The TI-89 calculator says, reasonably enough, that x 1) 1/3 1 ) 3 = 8. lim
More informationDepartment of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Spring Semester 2015
Department of Mathematics, University of California, Berkeley YOUR OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Spring Semester 205. Please write your - or 2-digit exam number on this
More informationMA3111S COMPLEX ANALYSIS I
MA3111S COMPLEX ANALYSIS I 1. The Algebra of Complex Numbers A complex number is an expression of the form a + ib, where a and b are real numbers. a is called the real part of a + ib and b the imaginary
More information1 Introduction. or equivalently f(z) =
Introduction In this unit on elliptic functions, we ll see how two very natural lines of questions interact. The first, as we have met several times in Berndt s book, involves elliptic integrals. In particular,
More informationMORE CONSEQUENCES OF CAUCHY S THEOREM
MOE CONSEQUENCES OF CAUCHY S THEOEM Contents. The Mean Value Property and the Maximum-Modulus Principle 2. Morera s Theorem and some applications 3 3. The Schwarz eflection Principle 6 We have stated Cauchy
More informationINTRODUCTION TO REAL ANALYTIC GEOMETRY
INTRODUCTION TO REAL ANALYTIC GEOMETRY KRZYSZTOF KURDYKA 1. Analytic functions in several variables 1.1. Summable families. Let (E, ) be a normed space over the field R or C, dim E
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 informationMath Final Exam.
Math 106 - Final Exam. This is a closed book exam. No calculators are allowed. The exam consists of 8 questions worth 100 points. Good luck! Name: Acknowledgment and acceptance of honor code: Signature:
More informationMath 220A - Fall Final Exam Solutions
Math 22A - Fall 216 - Final Exam Solutions Problem 1. Let f be an entire function and let n 2. Show that there exists an entire function g with g n = f if and only if the orders of all zeroes of f are
More informationMOMENTS OF HYPERGEOMETRIC HURWITZ ZETA FUNCTIONS
MOMENTS OF HYPERGEOMETRIC HURWITZ ZETA FUNCTIONS ABDUL HASSEN AND HIEU D. NGUYEN Abstract. This paper investigates a generalization the classical Hurwitz zeta function. It is shown that many of the properties
More informationand the compositional inverse when it exists is A.
Lecture B jacques@ucsd.edu Notation: R denotes a ring, N denotes the set of sequences of natural numbers with finite support, is a generic element of N, is the infinite zero sequence, n 0 R[[ X]] denotes
More 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 information. Then g is holomorphic and bounded in U. So z 0 is a removable singularity of g. Since f(z) = w 0 + 1
Now we describe the behavior of f near an isolated singularity of each kind. We will always assume that z 0 is a singularity of f, and f is holomorphic on D(z 0, r) \ {z 0 }. Theorem 4.2.. z 0 is a removable
More informationNotes on Complex Analysis
Michael Papadimitrakis Notes on Complex Analysis Department of Mathematics University of Crete Contents The complex plane.. The complex plane...................................2 Argument and polar representation.........................
More informationComplex Analysis for F2
Institutionen för Matematik KTH Stanislav Smirnov stas@math.kth.se Complex Analysis for F2 Projects September 2002 Suggested projects ask you to prove a few important and difficult theorems in complex
More informationConsidering our result for the sum and product of analytic functions, this means that for (a 0, a 1,..., a N ) C N+1, the polynomial.
Lecture 3 Usual complex functions MATH-GA 245.00 Complex Variables Polynomials. Construction f : z z is analytic on all of C since its real and imaginary parts satisfy the Cauchy-Riemann relations and
More informationCONSEQUENCES OF POWER SERIES REPRESENTATION
CONSEQUENCES OF POWER SERIES REPRESENTATION 1. The Uniqueness Theorem Theorem 1.1 (Uniqueness). Let Ω C be a region, and consider two analytic functions f, g : Ω C. Suppose that S is a subset of Ω that
More informationContinued fractions for complex numbers and values of binary quadratic forms
arxiv:110.3754v1 [math.nt] 18 Feb 011 Continued fractions for complex numbers and values of binary quadratic forms S.G. Dani and Arnaldo Nogueira February 1, 011 Abstract We describe various properties
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 informationMath 520a - Final take home exam - solutions
Math 52a - Final take home exam - solutions 1. Let f(z) be entire. Prove that f has finite order if and only if f has finite order and that when they have finite order their orders are the same. Solution:
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 informationUNCC 2001 Algebra II
UNCC 2001 Algebra II March 5, 2001 1. Compute the sum of the roots of x 2 5x + 6 = 0. (A) 3 (B) 7/2 (C) 4 (D) 9/2 (E) 5 (E) The sum of the roots of the quadratic ax 2 + bx + c = 0 is b/a which, for this
More informationFINAL EXAM MATH 220A, UCSD, AUTUMN 14. You have three hours.
FINAL EXAM MATH 220A, UCSD, AUTUMN 4 You have three hours. Problem Points Score There are 6 problems, and the total number of points is 00. Show all your work. Please make your work as clear and easy to
More information(i) Represent discrete-time signals using transform. (ii) Understand the relationship between transform and discrete-time Fourier transform
z Transform Chapter Intended Learning Outcomes: (i) Represent discrete-time signals using transform (ii) Understand the relationship between transform and discrete-time Fourier transform (iii) Understand
More informationProblem Set 5 Solution Set
Problem Set 5 Solution Set Anthony Varilly Math 113: Complex Analysis, Fall 2002 1. (a) Let g(z) be a holomorphic function in a neighbourhood of z = a. Suppose that g(a) = 0. Prove that g(z)/(z a) extends
More informationFinal Exam - MATH 630: Solutions
Final Exam - MATH 630: Solutions Problem. Find all x R satisfying e xeix e ix. Solution. Comparing the moduli of both parts, we obtain e x cos x, and therefore, x cos x 0, which is possible only if x 0
More informationSPRING 2006 PRELIMINARY EXAMINATION SOLUTIONS
SPRING 006 PRELIMINARY EXAMINATION SOLUTIONS 1A. Let G be the subgroup of the free abelian group Z 4 consisting of all integer vectors (x, y, z, w) such that x + 3y + 5z + 7w = 0. (a) Determine a linearly
More informationConformal maps. Lent 2019 COMPLEX METHODS G. Taylor. A star means optional and not necessarily harder.
Lent 29 COMPLEX METHODS G. Taylor A star means optional and not necessarily harder. Conformal maps. (i) Let f(z) = az + b, with ad bc. Where in C is f conformal? cz + d (ii) Let f(z) = z +. What are the
More information1. If 1, ω, ω 2, -----, ω 9 are the 10 th roots of unity, then (1 + ω) (1 + ω 2 ) (1 + ω 9 ) is A) 1 B) 1 C) 10 D) 0
4 INUTES. If, ω, ω, -----, ω 9 are the th roots of unity, then ( + ω) ( + ω ) ----- ( + ω 9 ) is B) D) 5. i If - i = a + ib, then a =, b = B) a =, b = a =, b = D) a =, b= 3. Find the integral values for
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 informationTaylor and Laurent Series
Chapter 4 Taylor and Laurent Series 4.. Taylor Series 4... Taylor Series for Holomorphic Functions. In Real Analysis, the Taylor series of a given function f : R R is given by: f (x + f (x (x x + f (x
More informationQualifying Exams I, 2014 Spring
Qualifying Exams I, 2014 Spring 1. (Algebra) Let k = F q be a finite field with q elements. Count the number of monic irreducible polynomials of degree 12 over k. 2. (Algebraic Geometry) (a) Show that
More informationRiemann sphere and rational maps
Chapter 3 Riemann sphere and rational maps 3.1 Riemann sphere It is sometimes convenient, and fruitful, to work with holomorphic (or in general continuous) functions on a compact space. However, we wish
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 informationMATH 185: COMPLEX ANALYSIS FALL 2009/10 PROBLEM SET 9 SOLUTIONS. and g b (z) = eπz/2 1
MATH 85: COMPLEX ANALYSIS FALL 2009/0 PROBLEM SET 9 SOLUTIONS. Consider the functions defined y g a (z) = eiπz/2 e iπz/2 + Show that g a maps the set to D(0, ) while g maps the set and g (z) = eπz/2 e
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 informationQualifying Exam Complex Analysis (Math 530) January 2019
Qualifying Exam Complex Analysis (Math 53) January 219 1. Let D be a domain. A function f : D C is antiholomorphic if for every z D the limit f(z + h) f(z) lim h h exists. Write f(z) = f(x + iy) = u(x,
More informationX.9 Revisited, Cauchy s Formula for Contours
X.9 Revisited, Cauchy s Formula for Contours Let G C, G open. Let f be holomorphic on G. Let Γ be a simple contour with range(γ) G and int(γ) G. Then, for all z 0 int(γ), f (z 0 ) = 1 f (z) dz 2πi Γ z
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 informationFRACTIONAL HYPERGEOMETRIC ZETA FUNCTIONS
FRACTIONAL HYPERGEOMETRIC ZETA FUNCTIONS HUNDUMA LEGESSE GELETA, ABDULKADIR HASSEN Both authors would like to dedicate this in fond memory of Marvin Knopp. Knop was the most humble and exemplary teacher
More informationComplex Analysis Qualifying Exam Solutions
Complex Analysis Qualifying Exam Solutions May, 04 Part.. Let log z be the principal branch of the logarithm defined on G = {z C z (, 0]}. Show that if t > 0, then the equation log z = t has exactly one
More informationMath 61CM - Solutions to homework 2
Math 61CM - Solutions to homework 2 Cédric De Groote October 5 th, 2018 Problem 1: Let V be the vector space of polynomials of degree at most 5, with coefficients in a field F Let U be the subspace of
More informationMATH 722, COMPLEX ANALYSIS, SPRING 2009 PART 5
MATH 722, COMPLEX ANALYSIS, SPRING 2009 PART 5.. The Arzela-Ascoli Theorem.. The Riemann mapping theorem Let X be a metric space, and let F be a family of continuous complex-valued functions on X. We have
More 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 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 informationMASTERS EXAMINATION IN MATHEMATICS SOLUTIONS
MASTERS EXAMINATION IN MATHEMATICS PURE MATHEMATICS OPTION SPRING 010 SOLUTIONS Algebra A1. Let F be a finite field. Prove that F [x] contains infinitely many prime ideals. Solution: The ring F [x] of
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 informationPUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES. Notes
PUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES Notes. x n+ = ax n has the general solution x n = x a n. 2. x n+ = x n + b has the general solution x n = x + (n )b. 3. x n+ = ax n + b (with a ) can be
More informationProblem Set 5. 2 n k. Then a nk (x) = 1+( 1)k
Problem Set 5 1. (Folland 2.43) For x [, 1), let 1 a n (x)2 n (a n (x) = or 1) be the base-2 expansion of x. (If x is a dyadic rational, choose the expansion such that a n (x) = for large n.) Then the
More informationChapter 6: The metric space M(G) and normal families
Chapter 6: The metric space MG) and normal families Course 414, 003 04 March 9, 004 Remark 6.1 For G C open, we recall the notation MG) for the set algebra) of all meromorphic functions on G. We now consider
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 informationLecture 4: Counting, Pigeonhole Principle, Permutations, Combinations Lecturer: Lale Özkahya
BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 4: Counting, Pigeonhole Principle, Permutations, Combinations Lecturer: Lale Özkahya Resources: Kenneth
More informationINDIAN INSTITUTE OF TECHNOLOGY BOMBAY MA205 Complex Analysis Autumn 2012
INDIAN INSTITUTE OF TECHNOLOGY BOMBAY MA205 Complex Analysis Autumn 2012 September 5, 2012 Mapping Properties Lecture 13 We shall once again return to the study of general behaviour of holomorphic functions
More informationMA30056: Complex Analysis. Exercise Sheet 7: Applications and Sequences of Complex Functions
MA30056: Complex Analysis Exercise Sheet 7: Applications and Sequences of Complex Functions Please hand solutions in at the lecture on Monday 6th March..) Prove Gauss Fundamental Theorem of Algebra. Hint:
More informationA = A U. U [n] P(A U ). n 1. 2 k(n k). k. k=1
Lecture I jacques@ucsd.edu Notation: Throughout, P denotes probability and E denotes expectation. Denote (X) (r) = X(X 1)... (X r + 1) and let G n,p denote the Erdős-Rényi model of random graphs. 10 Random
More informationSupplement. The Extended Complex Plane
The Extended Complex Plane 1 Supplement. The Extended Complex Plane Note. In section I.6, The Extended Plane and Its Spherical Representation, we introduced the extended complex plane, C = C { }. We defined
More informationComplex Analysis MATH 6300 Fall 2013 Homework 4
Complex Analysis MATH 6300 Fall 2013 Homework 4 Due Wednesday, December 11 at 5 PM Note that to get full credit on any problem in this class, you must solve the problems in an efficient and elegant manner,
More informationChapter Intended Learning Outcomes: (i) Understanding the relationship between transform and the Fourier transform for discrete-time signals
z Transform Chapter Intended Learning Outcomes: (i) Understanding the relationship between transform and the Fourier transform for discrete-time signals (ii) Understanding the characteristics and properties
More informationz b k P k p k (z), (z a) f (n 1) (a) 2 (n 1)! (z a)n 1 +f n (z)(z a) n, where f n (z) = 1 C
. Representations of Meromorphic Functions There are two natural ways to represent a rational function. One is to express it as a quotient of two polynomials, the other is to use partial fractions. The
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More informationPower series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) a n z n. n=0
Lecture 22 Power series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) Recall a few facts about power series: a n z n This series in z is centered at z 0. Here z can
More informationImmerse Metric Space Homework
Immerse Metric Space Homework (Exercises -2). In R n, define d(x, y) = x y +... + x n y n. Show that d is a metric that induces the usual topology. Sketch the basis elements when n = 2. Solution: Steps
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 informationComplex Analysis, Stein and Shakarchi Meromorphic Functions and the Logarithm
Complex Analysis, Stein and Shakarchi Chapter 3 Meromorphic Functions and the Logarithm Yung-Hsiang Huang 217.11.5 Exercises 1. From the identity sin πz = eiπz e iπz 2i, it s easy to show its zeros are
More 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 informationNOTES ON RIEMANN S ZETA FUNCTION. Γ(z) = t z 1 e t dt
NOTES ON RIEMANN S ZETA FUNCTION DRAGAN MILIČIĆ. Gamma function.. Definition of the Gamma function. The integral Γz = t z e t dt is well-defined and defines a holomorphic function in the right half-plane
More informationCMSC Discrete Mathematics SOLUTIONS TO FIRST MIDTERM EXAM October 18, 2005 posted Nov 2, 2005
CMSC-37110 Discrete Mathematics SOLUTIONS TO FIRST MIDTERM EXAM October 18, 2005 posted Nov 2, 2005 Instructor: László Babai Ryerson 164 e-mail: laci@cs This exam contributes 20% to your course grade.
More informationThe Residue Theorem. Integration Methods over Closed Curves for Functions with Singularities
The Residue Theorem Integration Methods over losed urves for Functions with Singularities We have shown that if f(z) is analytic inside and on a closed curve, then f(z)dz = 0. We have also seen examples
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 informationPaul-Eugène Parent. March 12th, Department of Mathematics and Statistics University of Ottawa. MAT 3121: Complex Analysis I
Paul-Eugène Parent Department of Mathematics and Statistics University of Ottawa March 12th, 2014 Outline 1 Holomorphic power Series Proposition Let f (z) = a n (z z o ) n be the holomorphic function defined
More informationEconomics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011
Economics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011 Section 2.6 (cont.) Properties of Real Functions Here we first study properties of functions from R to R, making use of the additional structure
More informationarxiv:math.cv/ v1 23 Dec 2003
EXPONENTIAL GELFOND-KHOVANSKII FORMULA IN DIMENSION ONE arxiv:math.cv/0312433 v1 23 Dec 2003 EVGENIA SOPRUNOVA Abstract. Gelfond and Khovanskii found a formula for the sum of the values of a Laurent polynomial
More informationCourse 214 Section 2: Infinite Series Second Semester 2008
Course 214 Section 2: Infinite Series Second Semester 2008 David R. Wilkins Copyright c David R. Wilkins 1989 2008 Contents 2 Infinite Series 25 2.1 The Comparison Test and Ratio Test.............. 26
More information1. The COMPLEX PLANE AND ELEMENTARY FUNCTIONS: Complex numbers; stereographic projection; simple and multiple connectivity, elementary functions.
Complex Analysis Qualifying Examination 1 The COMPLEX PLANE AND ELEMENTARY FUNCTIONS: Complex numbers; stereographic projection; simple and multiple connectivity, elementary functions 2 ANALYTIC FUNCTIONS:
More informationPart II. Riemann Surfaces. Year
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 96 Paper 2, Section II 23F State the uniformisation theorem. List without proof the Riemann surfaces which are uniformised
More informationEGMO 2016, Day 1 Solutions. Problem 1. Let n be an odd positive integer, and let x1, x2,..., xn be non-negative real numbers.
EGMO 2016, Day 1 Solutions Problem 1. Let n be an odd positive integer, and let x1, x2,..., xn be non-negative real numbers. Show that min (x2i + x2i+1 ) max (2xj xj+1 ), j=1,...,n i=1,...,n where xn+1
More informationLecture 9. = 1+z + 2! + z3. 1 = 0, it follows that the radius of convergence of (1) is.
The Exponential Function Lecture 9 The exponential function 1 plays a central role in analysis, more so in the case of complex analysis and is going to be our first example using the power series method.
More informationMATH COMPLEX ANALYSIS. Contents
MATH 3964 - OMPLEX ANALYSIS ANDREW TULLOH AND GILES GARDAM ontents 1. ontour Integration and auchy s Theorem 2 1.1. Analytic functions 2 1.2. ontour integration 3 1.3. auchy s theorem and extensions 3
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 information2 Write down the range of values of α (real) or β (complex) for which the following integrals converge. (i) e z2 dz where {γ : z = se iα, < s < }
Mathematical Tripos Part II Michaelmas term 2007 Further Complex Methods, Examples sheet Dr S.T.C. Siklos Comments and corrections: e-mail to stcs@cam. Sheet with commentary available for supervisors.
More information1 Basic Combinatorics
1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set
More informationMATH 566 LECTURE NOTES 4: ISOLATED SINGULARITIES AND THE RESIDUE THEOREM
MATH 566 LECTURE NOTES 4: ISOLATED SINGULARITIES AND THE RESIDUE THEOREM TSOGTGEREL GANTUMUR 1. Functions holomorphic on an annulus Let A = D R \D r be an annulus centered at 0 with 0 < r < R
More informationChapter 8. P-adic numbers. 8.1 Absolute values
Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.
More informationBernstein s analytic continuation of complex powers
(April 3, 20) Bernstein s analytic continuation of complex powers Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/. Analytic continuation of distributions 2. Statement of the theorems
More informationComplex Analysis Important Concepts
Complex Analysis Important Concepts Travis Askham April 1, 2012 Contents 1 Complex Differentiation 2 1.1 Definition and Characterization.............................. 2 1.2 Examples..........................................
More information