DOCSLIB.ORG

THE Q-SERIES in COMBINATORICS; PERMUTATION STATISTICS (Preliminary Version) May 5, 2011

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
THE Q-SERIES in COMBINATORICS; PERMUTATION STATISTICS (Preliminary Version) May 5, 2011 THE q-SERIES IN COMBINATORICS; PERMUTATION STATISTICS (Preliminary version) May 5, 2011 Dominique Foata and Guo-Niu Han Dominique Foata Guo-Niu Han D´epartement de math´ematique I.R.M.A. UMR 7501 Universit´eLouis Pasteur Universit´eLouis Pasteur et CNRS 7, rue Ren´e-Descartes 7, rue Ren´e-Descartes F-67084 Strasbourg, France F-67084 Strasbourg, France [email protected] [email protected] c These Lecture Notes cannot be reproduced without permission of the authors. Please, send remarks and corrections to: [email protected] or [email protected]. 1 Table of Contents Introduction 1. The q-binomial theorem 2. Mahonian Statistics 2.1. The inv-coding 2.2. The maj-coding 2.3. The den-coding 3. The algebra of q-binomial coefficients 4. The q-binomial structures 4.1. Partitions of integers 4.2. Nondecreasing sequences of integers 4.3. Binary words 4.4. Ordered Partitions into two blocks 5. The q-multinomial coefficients 6. The MacMahon Verfahren 7. A refinement of the MacMahon Verfahren 8. The Euler-Mahonian polynomials 8.1. A finite difference q-calculus 8.2. A q-iteration method 9. The Insertion technique 10. The two classes of q-Eulerian polynomials 11. Major Index and Inversion Number 11.1. How to construct a bijection 11.2. The binary case 11.3. From the binary to the general case 11.4. Further properties of the transformation 11.5. Applications to permutations 12. Major and Inverse Major Indices 12.1. The biword expansion 12.2. Another application of the MacMahon Verfahren 13. A four-variable distribution 14. Symmetric Functions 14.1. Partitions of integers 14.2. The algebra of symmetric functions 14.3. The classical bases 15. The Schur Functions 3 D. FOATA AND G.-N. HAN 16. The Cauchy Identity 17. The Combinatorial definition of the Schur Functions 18. The inverse ligne route of a standard tableau 19. The Robinson-Schensted correspondence 19.1. The Schensted-Knuth algorithm 19.2. A combinatorial proof of the Cauchy identity 19.3. Geometric properties of the correspondence 19.4. A permutation statistic distribution 20. Eulerian Calculus; the first extensions 20.1. The signed permutations 20.2. Pairs of permutations 20.3. The q-extension 20.4. The t, q-maj extension for signed permutations 20.5. A first inversion number for signed permutations 21. Eulerian Calculus; the analytic choice 21.1. Inversions for signed permutations 21.2. Basic Bessel Functions 21.3. The iterative method 22. Eulerian Calculus; finite analogs of Bessel functions 22.1. Signed biwords 22.2. Signed bipermutations 22.3. Signed biwords and compatible bipermutations 22.4. The last specializations 23. Eulerian Calculus; multi-indexed polynomials 23.1. The bi-indexed Eulerian polynomials 23.2. The D´esarm´enien Verfahren 23.3. Congruences for bi-indexed polynomials 23.4. The signed Eulerian Numbers 24. The basic and bibasic trigonometric Functions 24.1. The basic and bibasic tangent and secant functions 24.2. Alternating permutations 24.3. Combinatorics of the bibasic secant and tangent Examples and Exercises Answers to the Exercises Notes References 4 Introduction The inverse Laplace transform maps each formal power series a(n)un n≥0 in one variable u into another series (a(n)/n!)un, whose coefficient of n≥0 order n is normalized by the factor n! We then obtain the so-called expo- nential generating function for the sequence (a(n)) (n 0). The normal- ization has numerous advantages: the derivative is obtaine≥ d by a simple shift of the coefficients; the exponential of a series can be explicitly calcu- lated; there are closed formulas for the exponential generating functions for several classical orthogonal polynomials, ... However the algebra of expo- nential generating functions cannot be regarded as the universal panacea. Further kinds of series are needed, for instance to express some generating series for the symmetric groups by certain statistics. In the middle of the eighteenth century Heine introduced a new class of series in which the normalized factor n! was replaced by a polynomial of degree n in another variable, more precisely, the series where the coefficient of order n is normalized by the polynomial denoted by (q; q)n, in another variable q, defined by 1, if n = 0; (0.1) (q; q) := n (1 q)(1 q2) (1 qn), if n 1. − − ··· − ≥ The algebra of those series has been largely developed by Jackson in the beginning of the twentieth century. It has then fallen into disuse, except perhaps in the field of Partition Theory, but has vigorously come back in several mathematical domains, in particular in the theory of Quantum Groups and naturally in Combinatorics. Those series have been named q-series. They are simply formal power series in two variables, say, u and q, where the latter variable q, used for the normalization, plays a privileged role. Let Ω[[u, q]] denote the algebra of formal series in two variables u and q, with coefficients in a ring Ω. Each element of that algebra can be expressed as a series (0.2) a = a(n, m) un qm, n≥0,m≥0 5 D. FOATA AND G.-N. HAN where, for each ordered pair (n, m), the symbol a(n, m) belongs to Ω. Such a series can be seen as a series in one variable u, with coefficients in the ring Ω[[q]] of series in one variable q, i. e., (0.3) a = un a(n, m) qm . n≥0 m≥0 For each integer n 0 the expression (q; q)n is a polynomial in q, which is invertible in Ω[[q≥]], since its constant coefficient is 1. Thus the series a can be rewritten as un (0.4) a = b(n; q), (q; q)n n≥0 where b(n; q) is the formal series in the variable q (0.5) b(n; q):=(q; q) a(n, m) qm . n · m≥0 Each formal series a written in the form (0.4) is called a q-series. The n coefficient u /(q; q)n is then a formal series in the unique variable q. The purpose of this memoir is to give a basic description of the algebra of those series and describe the use that has been made of them in Combinatorics, in particular for expressing the generating functions for certain statistics defined on permutations, words, multipermutations, signed permutations and other finite structures. It has been customary to regroup all the techniques that have been developed under the name of Permutation Statistic Study, even though the group of permutations is not the only group structure involved. The statistics themselves can be uni- or several-variable, or even set-valued. As will be seen, the q-series enter into the picture in a very natural way. The q-binomial theorem, which is stated and proved in the first section, is the basic tool in q-Calculus. It opens the door to all the q-series identities and also gives rise to two expansions of the q-exponential, as a q-series itself, and also as an infinite product. The polynomial (q; q)n, defined above, is next studied in a combinatorial context. This leads to a discussion of the so-called Mahonian statistics, especially the Major Index and the Inversion Number that will play an essential role in this memoir. One of our goals, indeed, is to try to understand why the so-called natural q-analogs of various numbers or polynomials can be derived by means of either one of those statistics. The Major Index is strongly related to the combinatorial theory of the representation of finite groups, particularly when dealing with various tableaux (standard, semi-standard, ... ). The inversion number requires 6 INTRODUCTION other techniques, in particular the so-called q-iteration method, that will be used on several occasions. The q-binomial coefficients or Gaussian polynomials that appear in many identities on q-series are studied in several combinatorial environ- ments, as is done in section 4. With the study of the q-multinomial co- efficient we are led to introduce the statistic “number of inversions” for classes of permutations with repetitions. We prefer to use the term “rear- rangement” (of a given finite sequence) or “word.” This is the content of section 5. The MacMahon Verfahren, introduced in section 6, is the first tool that makes possible the transcription of properties of certain statistics defined on the symmetric group or on some classes of rearrangements to the algebra of q-series. As a first application, it is shown that the Major Index has the same distribution as the number of inversions on each class of rearrangements. A careful study of the MacMahon Verfahren serves to find a q-extension of the traditional Eulerian polynomials, namely the Euler-Mahonian poly- nomials Am(t, q), that appear to be generating polynomials for classes of rearrangements by the bivariable statistic (des, maj). The statistic “des” is the number of descents that has been studied in several combinatorial contexts and “maj” is the Major Index. As shown in section 8, there are four equivalent definitions of the Euler-Mahonian polynomials. The proofs of those equivalences are based on fundamental techniques in q-Calculus, finite difference and iterative methods. The insertion technique that looks so natural when dealing with univariable statistics on the symmetric group becomes intricate for several- variable statistics. A marked word technique is presented in section 9 and appears to be successful for deriving a recurrence relation for the Euler- Mahonian polynomials Am(t, q). When the class of rearrangements is reduced to the symmetric group, the Euler-Mahonian polynomials become the so-called q-maj-Eulerian maj polynomials An(t, q), as they form a first q-analog of the traditional Eulerian polynomials An(t) in one variable t.
Load more

Recommended publications
  • An Appreciation of Euler's Formula
    Rose-Hulman Undergraduate Mathematics Journal Volume 18 Issue 1 Article 17 An Appreciation of Euler's Formula Caleb Larson North Dakota State University Follow this and additional works at: https://scholar.rose-hulman.edu/rhumj Recommended Citation Larson, Caleb (2017) "An Appreciation of Euler's Formula," Rose-Hulman Undergraduate Mathematics Journal: Vol. 18 : Iss. 1 , Article 17. Available at: https://scholar.rose-hulman.edu/rhumj/vol18/iss1/17 Rose- Hulman Undergraduate Mathematics Journal an appreciation of euler's formula Caleb Larson a Volume 18, No. 1, Spring 2017 Sponsored by Rose-Hulman Institute of Technology Department of Mathematics Terre Haute, IN 47803 [email protected] a scholar.rose-hulman.edu/rhumj North Dakota State University Rose-Hulman Undergraduate Mathematics Journal Volume 18, No. 1, Spring 2017 an appreciation of euler's formula Caleb Larson Abstract. For many mathematicians, a certain characteristic about an area of mathematics will lure him/her to study that area further. That characteristic might be an interesting conclusion, an intricate implication, or an appreciation of the impact that the area has upon mathematics. The particular area that we will be exploring is Euler's Formula, eix = cos x + i sin x, and as a result, Euler's Identity, eiπ + 1 = 0. Throughout this paper, we will develop an appreciation for Euler's Formula as it combines the seemingly unrelated exponential functions, imaginary numbers, and trigonometric functions into a single formula. To appreciate and further understand Euler's Formula, we will give attention to the individual aspects of the formula, and develop the necessary tools to prove it.
    [Show full text]
  • Newton and Leibniz: the Development of Calculus Isaac Newton (1642-1727)
    Newton and Leibniz: The development of calculus Isaac Newton (1642-1727) Isaac Newton was born on Christmas day in 1642, the same year that Galileo died. This coincidence seemed to be symbolic and in many ways, Newton developed both mathematics and physics from where Galileo had left off. A few months before his birth, his father died and his mother had remarried and Isaac was raised by his grandmother. His uncle recognized Newton’s mathematical abilities and suggested he enroll in Trinity College in Cambridge. Newton at Trinity College At Trinity, Newton keenly studied Euclid, Descartes, Kepler, Galileo, Viete and Wallis. He wrote later to Robert Hooke, “If I have seen farther, it is because I have stood on the shoulders of giants.” Shortly after he received his Bachelor’s degree in 1665, Cambridge University was closed due to the bubonic plague and so he went to his grandmother’s house where he dived deep into his mathematics and physics without interruption. During this time, he made four major discoveries: (a) the binomial theorem; (b) calculus ; (c) the law of universal gravitation and (d) the nature of light. The binomial theorem, as we discussed, was of course known to the Chinese, the Indians, and was re-discovered by Blaise Pascal. But Newton’s innovation is to discuss it for fractional powers. The binomial theorem Newton’s notation in many places is a bit clumsy and he would write his version of the binomial theorem as: In modern notation, the left hand side is (P+PQ)m/n and the first term on the right hand side is Pm/n and the other terms are: The binomial theorem as a Taylor series What we see here is the Taylor series expansion of the function (1+Q)m/n.
    [Show full text]
  • Mathematics (MATH)
    Course Descriptions MATH 1080 QL MATH 1210 QL Mathematics (MATH) Precalculus Calculus I 5 5 MATH 100R * Prerequisite(s): Within the past two years, * Prerequisite(s): One of the following within Math Leap one of the following: MAT 1000 or MAT 1010 the past two years: (MATH 1050 or MATH 1 with a grade of B or better or an appropriate 1055) and MATH 1060, each with a grade of Is part of UVU’s math placement process; for math placement score. C or higher; OR MATH 1080 with a grade of C students who desire to review math topics Is an accelerated version of MATH 1050 or higher; OR appropriate placement by math in order to improve placement level before and MATH 1060. Includes functions and placement test. beginning a math course. Addresses unique their graphs including polynomial, rational, Covers limits, continuity, differentiation, strengths and weaknesses of students, by exponential, logarithmic, trigonometric, and applications of differentiation, integration, providing group problem solving activities along inverse trigonometric functions. Covers and applications of integration, including with an individual assessment and study inequalities, systems of linear and derivatives and integrals of polynomial plan for mastering target material. Requires nonlinear equations, matrices, determinants, functions, rational functions, exponential mandatory class attendance and a minimum arithmetic and geometric sequences, the functions, logarithmic functions, trigonometric number of hours per week logged into a Binomial Theorem, the unit circle, right functions, inverse trigonometric functions, and preparation module, with progress monitored triangle trigonometry, trigonometric equations, hyperbolic functions. Is a prerequisite for by a mentor. May be repeated for a maximum trigonometric identities, the Law of Sines, the calculus-based sciences.
    [Show full text]
  • The Discovery of the Series Formula for Π by Leibniz, Gregory and Nilakantha Author(S): Ranjan Roy Source: Mathematics Magazine, Vol
    The Discovery of the Series Formula for π by Leibniz, Gregory and Nilakantha Author(s): Ranjan Roy Source: Mathematics Magazine, Vol. 63, No. 5 (Dec., 1990), pp. 291-306 Published by: Mathematical Association of America Stable URL: http://www.jstor.org/stable/2690896 Accessed: 27-02-2017 22:02 UTC JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at http://about.jstor.org/terms Mathematical Association of America is collaborating with JSTOR to digitize, preserve and extend access to Mathematics Magazine This content downloaded from 195.251.161.31 on Mon, 27 Feb 2017 22:02:42 UTC All use subject to http://about.jstor.org/terms ARTICLES The Discovery of the Series Formula for 7r by Leibniz, Gregory and Nilakantha RANJAN ROY Beloit College Beloit, WI 53511 1. Introduction The formula for -r mentioned in the title of this article is 4 3 57 . (1) One simple and well-known moderm proof goes as follows: x I arctan x = | 1 +2 dt x3 +5 - +2n + 1 x t2n+2 + -w3 - +(-I)rl2n+1 +(-I)l?lf dt. The last integral tends to zero if Ix < 1, for 'o t+2dt < jt dt - iX2n+3 20 as n oo.
    [Show full text]
  • 1. More Examples Example 1. Find the Slope of the Tangent Line at (3,9)
    1. More examples Example 1. Find the slope of the tangent line at (3; 9) to the curve y = x2. P = (3; 9). So Q = (3 + ∆x; 9 + ∆y). 9 + ∆y = (3 + ∆x)2 = (9 + 6∆x + (∆x)2. Thus, we have ∆y = 6 + ∆x. ∆x If we let ∆ go to zero, we get ∆y lim = 6 + 0 = 6. ∆x→0 ∆x Thus, the slope of the tangent line at (3; 9) is 6. Let's consider a more abstract example. Example 2. Find the slope of the tangent line at an arbitrary point P = (x; y) on the curve y = x2. Again, P = (x; y), and Q = (x + ∆x; y + ∆y), where y + ∆y = (x + ∆x)2 = x2 + 2x∆x + (∆x)2. So we get, ∆y = 2x + ∆x. ∆x Letting ∆x go to zero, we get ∆y lim = 2x + 0 = 2x. ∆x→0 ∆x Thus, the slope of the tangent line at an arbitrary point (x; y) is 2x. Example 3. Find the slope of the tangent line at an arbitrary point P = (x; y) on the curve y = ax3, where a is a real number. Q = (x + ∆x; y + ∆y). We get, 1 2 y + ∆y = a(x + ∆x)3 = a(x3 + 3x2∆x + 3x(∆x)2 + (∆x)3). After simplifying we have, ∆y = 3ax2 + 3xa∆x + a(∆x)2. ∆x Letting ∆x go to 0 we conclude, ∆y 2 2 mP = lim = 3ax + 0 + 0 = 3ax . x→0 ∆x 2 Thus, the slope of the tangent line at a point (x; y) is mP = 3ax . Example 4.
    [Show full text]
  • Leonhard Euler: His Life, the Man, and His Works∗
    SIAM REVIEW c 2008 Walter Gautschi Vol. 50, No. 1, pp. 3–33 Leonhard Euler: His Life, the Man, and His Works∗ Walter Gautschi† Abstract. On the occasion of the 300th anniversary (on April 15, 2007) of Euler’s birth, an attempt is made to bring Euler’s genius to the attention of a broad segment of the educated public. The three stations of his life—Basel, St. Petersburg, andBerlin—are sketchedandthe principal works identified in more or less chronological order. To convey a flavor of his work andits impact on modernscience, a few of Euler’s memorable contributions are selected anddiscussedinmore detail. Remarks on Euler’s personality, intellect, andcraftsmanship roundout the presentation. Key words. LeonhardEuler, sketch of Euler’s life, works, andpersonality AMS subject classification. 01A50 DOI. 10.1137/070702710 Seh ich die Werke der Meister an, So sehe ich, was sie getan; Betracht ich meine Siebensachen, Seh ich, was ich h¨att sollen machen. –Goethe, Weimar 1814/1815 1. Introduction. It is a virtually impossible task to do justice, in a short span of time and space, to the great genius of Leonhard Euler. All we can do, in this lecture, is to bring across some glimpses of Euler’s incredibly voluminous and diverse work, which today fills 74 massive volumes of the Opera omnia (with two more to come). Nine additional volumes of correspondence are planned and have already appeared in part, and about seven volumes of notebooks and diaries still await editing! We begin in section 2 with a brief outline of Euler’s life, going through the three stations of his life: Basel, St.
    [Show full text]
  • The Legacy of Leonhard Euler: a Tricentennial Tribute (419 Pages)
    P698.TP.indd 1 9/8/09 5:23:37 PM This page intentionally left blank Lokenath Debnath The University of Texas-Pan American, USA Imperial College Press ICP P698.TP.indd 2 9/8/09 5:23:39 PM Published by Imperial College Press 57 Shelton Street Covent Garden London WC2H 9HE Distributed by World Scientific Publishing Co. Pte. Ltd. 5 Toh Tuck Link, Singapore 596224 USA office: 27 Warren Street, Suite 401-402, Hackensack, NJ 07601 UK office: 57 Shelton Street, Covent Garden, London WC2H 9HE British Library Cataloguing-in-Publication Data A catalogue record for this book is available from the British Library. THE LEGACY OF LEONHARD EULER A Tricentennial Tribute Copyright © 2010 by Imperial College Press All rights reserved. This book, or parts thereof, may not be reproduced in any form or by any means, electronic or mechanical, including photocopying, recording or any information storage and retrieval system now known or to be invented, without written permission from the Publisher. For photocopying of material in this volume, please pay a copying fee through the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923, USA. In this case permission to photocopy is not required from the publisher. ISBN-13 978-1-84816-525-0 ISBN-10 1-84816-525-0 Printed in Singapore. LaiFun - The Legacy of Leonhard.pmd 1 9/4/2009, 3:04 PM September 4, 2009 14:33 World Scientific Book - 9in x 6in LegacyLeonhard Leonhard Euler (1707–1783) ii September 4, 2009 14:33 World Scientific Book - 9in x 6in LegacyLeonhard To my wife Sadhana, grandson Kirin,and granddaughter Princess Maya, with love and affection.
    [Show full text]
  • Discrete Distributions: Empirical, Bernoulli, Binomial, Poisson
    Empirical Distributions An empirical distribution is one for which each possible event is assigned a probability derived from experimental observation. It is assumed that the events are independent and the sum of the probabilities is 1. An empirical distribution may represent either a continuous or a discrete distribution. If it represents a discrete distribution, then sampling is done “on step”. If it represents a continuous distribution, then sampling is done via “interpolation”. The way the table is described usually determines if an empirical distribution is to be handled discretely or continuously; e.g., discrete description continuous description value probability value probability 10 .1 0 – 10- .1 20 .15 10 – 20- .15 35 .4 20 – 35- .4 40 .3 35 – 40- .3 60 .05 40 – 60- .05 To use linear interpolation for continuous sampling, the discrete points on the end of each step need to be connected by line segments. This is represented in the graph below by the green line segments. The steps are represented in blue: rsample 60 50 40 30 20 10 0 x 0 .5 1 In the discrete case, sampling on step is accomplished by accumulating probabilities from the original table; e.g., for x = 0.4, accumulate probabilities until the cumulative probability exceeds 0.4; rsample is the event value at the point this happens (i.e., the cumulative probability 0.1+0.15+0.4 is the first to exceed 0.4, so the rsample value is 35). In the continuous case, the end points of the probability accumulation are needed, in this case x=0.25 and x=0.65 which represent the points (.25,20) and (.65,35) on the graph.
    [Show full text]
  • 8.6 the BINOMIAL THEOREM We Remake Nature by the Act of Discovery, in the Poem Or in the Theorem
    pg476 [V] G2 5-36058 / HCG / Cannon & Elich cr 11-30-95 MP1 476 Chapter 8 Discrete Mathematics: Functions on the Set of Natural Numbers (b) Based on your results for (a), guess the minimum number of handshakes. See Exercise 19, page 469. number of moves required if you start with an arbi- Show trary number of n disks. (Hint: Tohelpseeapat- n~n 2 1! tern,add1tothenumberofmovesforn51, 2, 3, f ~n! 5 for every positive integer n. 4.) 2 (c) A legend claims that monks in a remote monastery 56. Suppose n is an odd positive integer not divisible by 3. areworkingtomoveasetof64disks,andthatthe Show that n 2 2 1 is divisible by 24. (Hint: Consider the world will end when they complete their sacred three consecutive integers n 2 1, n, n 1 1. Explain task. Moving one disk per second without error, 24 why the product ~n 2 1!~n 1 1! must be divisible by 3 hours a day, 365 days a year, how long would it take andby8.) to move all 64 disks? 57. Finding Patterns If an 5 Ï24n 1 1, (a) write out 55. Number of Handshakes Suppose there are n people the first five terms of the sequence $an%. (b) What odd at a party and that each person shakes hands with every integers occur in $an%? (c) Explain why $an% contains all other person exactly once. Let f~n! denote the total primes greater than 3. (Hint: UseExercise56.) 8.6 THE BINOMIAL THEOREM We remake nature by the act of discovery, in the poem or in the theorem.
    [Show full text]
  • The Calculus of Newton and Leibniz CURRENT READING: Katz §16 (Pp
    Worksheet 13 TITLE The Calculus of Newton and Leibniz CURRENT READING: Katz §16 (pp. 543-575) Boyer & Merzbach (pp 358-372, 382-389) SUMMARY We will consider the life and work of the co-inventors of the Calculus: Isaac Newton and Gottfried Leibniz. NEXT: Who Invented Calculus? Newton v. Leibniz: Math’s Most Famous Prioritätsstreit Isaac Newton (1642-1727) was born on Christmas Day, 1642 some 100 miles north of London in the town of Woolsthorpe. In 1661 he started to attend Trinity College, Cambridge and assisted Isaac Barrow in the editing of the latter’s Geometrical Lectures. For parts of 1665 and 1666, the college was closed due to The Plague and Newton went home and studied by himself, leading to what some observers have called “the most productive period of mathematical discover ever reported” (Boyer, A History of Mathematics, 430). During this period Newton made four monumental discoveries 1. the binomial theorem 2. the calculus 3. the law of gravitation 4. the nature of colors Newton is widely regarded as the most influential scientist of all-time even ahead of Albert Einstein, who demonstrated the flaws in Newtonian mechanics two centuries later. Newton’s epic work Philosophiæ Naturalis Principia Mathematica (Mathematical Principles of Natural Philosophy) more often known as the Principia was first published in 1687 and revolutionalized science itself. Infinite Series One of the key tools Newton used for many of his mathematical discoveries were power series. He was able to show that he could expand the expression (a bx) n for any n He was able to check his intuition that this result must be true by showing that the power series for (1+x)-1 could be used to compute a power series for log(1+x) which he then used to calculate the logarithms of several numbers close to 1 to over 50 decimal paces.
    [Show full text]
  • Taylor Series and Mclaurin Series • Definition of a Power Series
    Learning Goals: Taylor Series and McLaurin series • Definition of a power series expansion of a function at a. • Learn to calculate the Taylor series expansion of a function at a. • Know that if a function has a power series expansion at a, then that power series must be the Taylor series expansion at a. • Be aware that the Taylor series expansion of a function f(x) at a does not always sum to f(x) in an interval around a and know what is involved in checking whether it does or not. • Remainder Theorem: Know how to get an upper bound for the remainder. • Know the power series expansions for sin(x), cos(x) and (1 + x)k and be familiar with how they were derived. • Become familiar with how to apply previously learned methods to these new power series: i.e. methods such as substitution, integration, differentiation, limits, polynomial approximation. 1 Taylor Series and McLaurin series: Stewart Section 11.10 We have seen already that many functions have a power series representation on part of their domain. For example function Power series Repesentation Interval 1 1 X xn −1 < x < 1 1 − x n=0 1 1 X (−1)nxkn −1 < x < 1 1 + xk n=0 1 X xn+1 ln(1 + x) (−1)n −1 < x ≤ 1 n + 1 n=0 1 X x2n+1 ? ? arctan(x) (−1)n −1 < x < 1 2n + 1 n=0 1 X xn ex −∞ < x < 1 n! n=0 Now that you are comfortable with the idea of a power series representation for a function, you may be wondering if such a power series representation is unique and is there a systematic way of finding a power series representation for a function.
    [Show full text]
  • MATHEMATICAL THEORY for SOCIAL SCIENTISTS the BINOMIAL THEOREM Pascal's Triangle and the Binomial Expansion Consider the Follo
    MATHEMATICAL THEORY FOR SOCIAL SCIENTISTS THE BINOMIAL THEOREM Pascal’s Triangle and the Binomial Expansion Consider the following binomial expansions: (p + q)0 =1, (p+q)1 =p+q, (p + q)2 = p2 +2pq + q2, (p + q)3 = p3 +3p2q+3pq2 + q3, (p + q)4 = p4 +4p3q+6p2q2 +4pq3 + q4, (p + q)5 = p5 +5p4q+10p3q2 +10p2q3 +5pq4 + q5. The generic expansion is in the form of n(n 1) n(n 1)(n 2) (p + q)n =pn + npn1q + pn2q2 + pn3q3+ 2 3! n(n1) (nr+1) + pnrqr + r! n(n1)(n 2) n(n 1) + p3qn3 + p2qn2 + npqn1 + pn. 3! 2 In a tidier notation, this becomes Xn n! (p + q)n = pxqnx. (n x)!x! x=0 We can nd the coecient of the binomial expansions of successive degrees by the simple device known as Pascal’s triangle: 1 11 121 1331 14641 15101051 The numbers in each row but the rst are obtained by adding two adjacent numbers in the row above. The rule is true even for the units which border the triangle if we suppose that there are some invisible zeros extending indenitely on either side of each row. Instead of relying merely upon observation to establish the formula for the bino- mial expansion, we should prefer to derive the formula by algebraic methods. Before 1 MATHEMATICAL THEORY FOR SOCIAL SCIENTISTS we do so, we must rearm some notions concerning permutations and combinations which are essential to a proper derivation. Permutations Let us consider a set of three letters {a, b, c} and let us nd the number of ways in which they can be can arranged in a distinct order.
    [Show full text]