DOCSLIB.ORG

Introductions to Factorial Introduction to the Factorials and Binomials

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Introductions to Factorial Introduction to the Factorials and Binomials Introductions to Factorial Introduction to the factorials and binomials General The factorials and binomials have a very long history connected with their natural appearance in combinatorial problems. Such combinatorial-type problems were known and partially solved even in ancient times. The first mathematical descriptions of binomial coefficients arising from expansions of a + b n for n 2, 3, 4, ¼ appeared in the works of Chia Hsien (1050), al-Karaji (about 1100), Omar al-Khayyami (1080), Bhaskara Acharya (1150), al- Samaw'al (1175), Yang Hui (1261), Tshu shi Kih (1303), Shih–Chieh Chu (1303), M. Stifel (1544), Cardano (1545), Scheubel (1545), Peletier (1549), Tartaglia (1556), Cardan (1570), StevinH (1585),L Faulhaber (1615), Girard (1629), Oughtred (1631), Briggs (1633), Mersenne (1636), Fermat (1636), Wallis (1656), Montmort (1708), and De Moivre (1730). B. Pascal (1653) gave a recursion relation for the binomial, and I. Newton (1676) studied its cases with fractional arguments. It was known that the factorial n! grows very fast. Its growth speed was estimated by J. Stirling (1730) who found the famous asymptotic formula for the factorial named after him. A special role in the history of the factorial and binomial belongs to L. Euler, who introduced the gamma function G z as the natural extension of factorial (n != G n + 1 ) for noninteger arguments and used notations with parentheses for the binomials (1774, 1781). C. F. Hindenburg (1779) used not only binomials but introduced multinomials as their generalizations. The modern H L notation n! was suggested by C. Kramp (1808, 1816). C. F. Gauss (1812) also widely used binomials in his mathe- H L n matical research, but the modern binomial symbol k was introduced by A. von Ettinghausen (1826); later Förstemann (1835) gave the combinatorial interpretation of the binomial coefficients. A. L. Crelle (1831) used a symbol that notates the generalizedJ N factorial a a + 1 a + 2 ¼ a + n - 1 . Later P. E. Appell (1880) ascribed the name Pochhammer symbol for the notation of this product because it was widely used in the research of L. A. Pochhammer (1890). H L H L H L While the double factorial n!! was introduced long ago, its extension for complex arguments was suggested only several years ago by J. Keiper and O. I. Marichev (1994) during the implementation of the function Factorial2 in Mathematica. The classical combinatorial applications of the factorial and binomial functions are the following: è The factorial n! gives the number of possible placements of n people on n chairs. n è The binomial k gives the number of possible selections of k numbers from a larger group of n numbers, for instance on a lotto strip. J N http://functions.wolfram.com 2 è The multinomial n; n1, n2, ¼, nm is the number of ways of putting n n1 + n2 + ¼ nm different objects into th m different boxes with nk in the k box, k 1, 2, ¼, m. H L Definitions of factorials and binomials n The factorial n!, double factorial n!!, Pochhammer symbol a n, binomial coefficient k , and multinomial coeffi- cient n1 + n2 + ¼ + nm; n1, n2, ¼, nm are defined by the following formulas. The first formula is a general definition for the complex arguments, and the second one is HforL positive integer arguments:J N n! GH n + 1 L n n! k ; n Î N+ H L k=1 1 1-cos p n ä2 4 n n!! 2n 2 G + 1 p 2 H H LL G a + n a n ; Ø -a ÎK Z -Oa ³ 0 n Î Z n £ -a G a n-H1 L H L H H + ß ß ß LL a n Ha L+ k ; n Î N k=0 H nL äH G Ln+ 1 n! ; Ø n Î Z k Î Z k £ n < 0 k G k + 1 G n - k + 1 k! n - k ! n H L 0 ; n Î Z k Î Z k £ n < 0 H H ì ì LL k H L H L H L G n + 1 m n + n +¼ + n ì; n , n , ¼ì , n ; -n Ï N+ n n 1 2 m 1 2 m m k k=1 G nk + 1 k=1 H L m H L + í â n1 + n2 + ¼ + nm; n1, n2, ¼, nm 0Û; -nHÎ N L n nk. k=1 HRemark about values at specialL points: For aí= a andâ n n integers with a £ 0 and n £ -a, the Pochhammer symbol a n cannot be uniquely defined by a limiting procedure based on the previous definition because the two variables a and n can approach the integers a and n with a £ 0 and n £ -a at different speeds. For such integers with a £ 0, n £ -a, the following definition is used: H L -1 n -a ! a n ; -a Î N n Î Z n £ -a. -a - n ! H L H L H L ß ß H L http://functions.wolfram.com 3 n Similarly, for n = n, k k negative integers with k £ n, the binomial coefficient k cannot be uniquely defined by a limiting procedure based on the previous definition because the two variables n, k can approach negative integers n, k with k £ n at different speeds. For negative integers with k £ n, the followingJ definitionN is used: n 0 ; n Î Z k Î Z k £ n < 0. k The previous symbols are interconnected and belong to one group that can be called factorials and binomials. ì ì These symbols are widely used in the coefficients of series expansions for the majority of mathematical functions. A quick look at the factorials and binomials Here is a quick look at the graphics for the factorial the real axis. 7.5 5 x ! 2.5 f 0 x !! -2.5 -5 -7.5 -6 -4 -2 0 2 4 x And here is a quick view of the bivariate binomial and Pochhammer functions. For positive arguments, both functions are free of singularities. For negative arguments, the functions have a complicated structure with many singularities. x x y y i y H L j z k { 5 5 2.5 4 2.5 4 0 0 -2.5 2 -2.5 2 - -5 5 -4 0 -4 0 y y -2 -2 - 0 -2 0 2 x 2 x 2 - - 4 4 4 4 Connections within the group of factorials and binomials and with other function groups Representations through more general functions Two factorials n! and n!! are the particular cases of the incomplete gamma function G a, z with the second argument being 0: n! G n + 1, 0 ; Re n > -1 H L H L H L http://functions.wolfram.com 4 1 1-cos p n 2 4 n n!! 2n 2 G + 1, 0 ; Re n > -2. p 2 H H LL Representations through related equivalent functions K O H L n The factorial n!, double factorial n!!, Pochhammer symbol a n, binomial coefficient k , and multinomial coeffi- cient n1 + n2 + ¼ + nm; n1, n2, ¼, nm can be represented through the gamma function by the following formulas: n! G n + 1 H L J N H L 1 cos p n -1 p 4 n n!! 2Hn 2 L G + 1 2 2 H H L L G a + n a n K O G a -H1 n GL1 - a HaLn ; n Î Z G 1H -L a - n GH aL+ nH L HaLn GH a L -H1 n GL1 - a HaLn ; n Î Z G 1H -L a - n n H L GH n + 1L H L k G Hk + 1 G 1L- k + n H L G n + 1 m n + n + ¼ + n ; n , n , ¼, n ; -n Ï N+ n n . 1 2 H L mH 1 2 L m m k k=1 G nk + 1 k=1 H L HMany of these formulas are usedL as the main elements of theí definitionsâ of many functions. Û H L Representations through other factorials and binomials n The factorials and binomials n!, n!!, a n, k , and n1 + n2 + ¼ + nm; n1, n2, ¼, nm are interconnected by the following formulas: 1 1 H L J N H L cos 2 n p -1 -n sin2 n p n! 2 4 p 2 2 n !! n! n -H 1H !! nL !!L H L H L n! 1 n H L 1 cos p n -1 p 4 n n!! H2Ln 2 ! 2 2 H H L L 1 p cos p n -1 n 2 4 K O n!! 2 1 n 2 2 H H L L H L http://functions.wolfram.com 5 m + n - 1 ! m n ; Ø -m Î N -m - n Î N m - 1 ! H -1 n m!L H L H ß L -m n ; m Î N n Î N Hm - nL ! H a +L k - 1 a + k - 1 Ha k L k! k! ß H kL a - 1 a n n! a - 1 + n; a - 1, n H L n n! H kL nH- k ! k! L n 1 - k + n k k H kL! H L n k + 1 n-k k n - k ! H k L n -1 -n k ; k Î Z k H k!L n H L H L n; n - k, k k n! m n + n H+ ¼ + n ;Ln , n , ¼, n ; n n 1 2 m 1 2 m m k k=1 nk ! k=1 nm + 1 m H L n-nm â n1 + n2 + ¼ + nm; n1, n2, ¼, nm Û ; n nk. m-1 k=1 nk ! k=1 H L TheH best-known propertiesL and formulas âfor factorials and binomials Û Real values for real arguments n For real values of arguments, the values of the factorials and binomials n!, n!!, a , , and n k n1 + n2 + ¼ + nm; n1, n2, ¼, nm are real (or infinity).
Load more

Recommended publications
  • On the Stability of a Cauchy Type Functional Equation
    Demonstr. Math. 2018; 51:323–331 Research Article Open Access Abbas Najati, Jung Rye Lee*, Choonkil Park, and Themistocles M. Rassias On the stability of a Cauchy type functional equation https://doi.org/10.1515/dema-2018-0026 Received May 31, 2018; accepted November 11, 2018 Abstract: In this work, the Hyers-Ulam type stability and the hyperstability of the functional equation (︁ x + y )︁ (︁ x − y )︁ f + xy + f − xy = f(x) 2 2 are proved. Keywords: Hyers-Ulam stability, additive mapping, hyperstability, topological vector space MSC: 39B82, 34K20, 26D10 1 Introduction The functional equation (ξ) is called stable if any function g satisfying the equation (ξ) approximately, is near to a true solution of (ξ). Ulam, in 1940 [1], introduced the stability of homomorphisms between two groups. More precisely, he proposed the following problem: given a group (G1,.), a metric group (G2, *, d) and a positive number ϵ, does there exist a δ > 0 such that if a function f : G1 ! G2 satisfies the inequal- ity d(f (x.y), f (x) * f(y)) < δ for all x, y 2 G1, then there exists a homomorphism T : G1 ! G2 such that d(f(x), T(x)) < ϵ for all x 2 G1? If this problem has a solution, we say that the homomorphisms from G1 to G2 are stable. In 1941, Hyers [2] gave a partial solution of Ulam’s problem for the case of approximate addi- tive mappings under the assumption that G1 and G2 are Banach spaces. Aoki [3] and Rassias [4] provided a generalization of the Hyers’ theorem for additive and linear mappings, respectively, by allowing the Cauchy difference to be unbounded.
    [Show full text]
  • Square Series Generating Function Transformations 127
    Journal of Inequalities and Special Functions ISSN: 2217-4303, URL: www.ilirias.com/jiasf Volume 8 Issue 2(2017), Pages 125-156. SQUARE SERIES GENERATING FUNCTION TRANSFORMATIONS MAXIE D. SCHMIDT Abstract. We construct new integral representations for transformations of the ordinary generating function for a sequence, hfni, into the form of a gen- erating function that enumerates the corresponding \square series" generating n2 function for the sequence, hq fni, at an initially fixed non-zero q 2 C. The new results proved in the article are given by integral{based transformations of ordinary generating function series expanded in terms of the Stirling num- bers of the second kind. We then employ known integral representations for the gamma and double factorial functions in the construction of these square series transformation integrals. The results proved in the article lead to new applications and integral representations for special function series, sequence generating functions, and other related applications. A summary Mathemat- ica notebook providing derivations of key results and applications to specific series is provided online as a supplemental reference to readers. 1. Notation and conventions Most of the notational conventions within the article are consistent with those employed in the references [11, 15]. Additional notation for special parameterized classes of the square series expansions studied in the article is defined in Table 1 on page 129. We utilize this notation for these generalized classes of square series functions throughout the article. The following list provides a description of the other primary notations and related conventions employed throughout the article specific to the handling of sequences and the coefficients of formal power series: I Sequences and Generating Functions: The notation hfni ≡ ff0; f1; f2;:::g is used to specify an infinite sequence over the natural numbers, n 2 N, where we define N = f0; 1; 2;:::g and Z+ = f1; 2; 3;:::g.
    [Show full text]
  • Convolution on the N-Sphere with Application to PDF Modeling Ivan Dokmanic´, Student Member, IEEE, and Davor Petrinovic´, Member, IEEE
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 58, NO. 3, MARCH 2010 1157 Convolution on the n-Sphere With Application to PDF Modeling Ivan Dokmanic´, Student Member, IEEE, and Davor Petrinovic´, Member, IEEE Abstract—In this paper, we derive an explicit form of the convo- emphasis on wavelet transform in [8]–[12]. Computation of the lution theorem for functions on an -sphere. Our motivation comes Fourier transform and convolution on groups is studied within from the design of a probability density estimator for -dimen- the theory of noncommutative harmonic analysis. Examples sional random vectors. We propose a probability density function (pdf) estimation method that uses the derived convolution result of applications of noncommutative harmonic analysis in engi- on . Random samples are mapped onto the -sphere and esti- neering are analysis of the motion of a rigid body, workspace mation is performed in the new domain by convolving the samples generation in robotics, template matching in image processing, with the smoothing kernel density. The convolution is carried out tomography, etc. A comprehensive list with accompanying in the spectral domain. Samples are mapped between the -sphere theory and explanations is given in [13]. and the -dimensional Euclidean space by the generalized stereo- graphic projection. We apply the proposed model to several syn- Statistics of random vectors whose realizations are observed thetic and real-world data sets and discuss the results. along manifolds embedded in Euclidean spaces are commonly termed directional statistics. An excellent review may be found Index Terms—Convolution, density estimation, hypersphere, hy- perspherical harmonics, -sphere, rotations, spherical harmonics. in [14]. It is of interest to develop tools for the directional sta- tistics in analogy with the ordinary Euclidean.
    [Show full text]
  • Notes on Euler's Work on Divergent Factorial Series and Their Associated
    Indian J. Pure Appl. Math., 41(1): 39-66, February 2010 °c Indian National Science Academy NOTES ON EULER’S WORK ON DIVERGENT FACTORIAL SERIES AND THEIR ASSOCIATED CONTINUED FRACTIONS Trond Digernes¤ and V. S. Varadarajan¤¤ ¤University of Trondheim, Trondheim, Norway e-mail: [email protected] ¤¤University of California, Los Angeles, CA, USA e-mail: [email protected] Abstract Factorial series which diverge everywhere were first considered by Euler from the point of view of summing divergent series. He discovered a way to sum such series and was led to certain integrals and continued fractions. His method of summation was essentialy what we call Borel summation now. In this paper, we discuss these aspects of Euler’s work from the modern perspective. Key words Divergent series, factorial series, continued fractions, hypergeometric continued fractions, Sturmian sequences. 1. Introductory Remarks Euler was the first mathematician to develop a systematic theory of divergent se- ries. In his great 1760 paper De seriebus divergentibus [1, 2] and in his letters to Bernoulli he championed the view, which was truly revolutionary for his epoch, that one should be able to assign a numerical value to any divergent series, thus allowing the possibility of working systematically with them (see [3]). He antic- ipated by over a century the methods of summation of divergent series which are known today as the summation methods of Cesaro, Holder,¨ Abel, Euler, Borel, and so on. Eventually his views would find their proper place in the modern theory of divergent series [4]. But from the beginning Euler realized that almost none of his methods could be applied to the series X1 1 ¡ 1!x + 2!x2 ¡ 3!x3 + ::: = (¡1)nn!xn (1) n=0 40 TROND DIGERNES AND V.
    [Show full text]
  • Applied Mathematics Letters Exponential Functional Equation On
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Applied Mathematics Letters 23 (2010) 156–160 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml Exponential functional equation on spheres Justyna Sikorska Institute of Mathematics, Silesian University, Bankowa 14, PL-40-007 Katowice, Poland article info a b s t r a c t Article history: We study the exponential functional equation f .x C y/ D f .x/f .y/ on spheres in real Received 28 February 2009 normed linear spaces. Regardless of the solutions of this equation, which are already Received in revised form 4 September 2009 known, we investigate its stability and consider the pexiderized version of it. Accepted 4 September 2009 ' 2009 Elsevier Ltd. All rights reserved. Keywords: Conditional exponential functional equation Stability Approximation 1. Introduction Alsina and Garcia-Roig [1] considered the conditional functional equation f .x C y/ D f .x/ C f .y/ whenever kxk D kyk (1) with a continuous function f : X ! Y mapping a real inner product space .X; h·; ·i/ with dim X ≥ 2 into a real topological vector space Y . In [2], Szabó solved (1) in case where .X; k · k/ is a real normed linear space with dim X ≥ 3 and .Y ; C/ is an Abelian group. In [3], Ger and the author proceeded with the study of (1) with the norm replaced by an abstract function fulfilling suitable conditions. We dealt also with more general structures than those considered in [1,2].
    [Show full text]
  • Calculus Terminology
    AP Calculus BC Calculus Terminology Absolute Convergence Asymptote Continued Sum Absolute Maximum Average Rate of Change Continuous Function Absolute Minimum Average Value of a Function Continuously Differentiable Function Absolutely Convergent Axis of Rotation Converge Acceleration Boundary Value Problem Converge Absolutely Alternating Series Bounded Function Converge Conditionally Alternating Series Remainder Bounded Sequence Convergence Tests Alternating Series Test Bounds of Integration Convergent Sequence Analytic Methods Calculus Convergent Series Annulus Cartesian Form Critical Number Antiderivative of a Function Cavalieri’s Principle Critical Point Approximation by Differentials Center of Mass Formula Critical Value Arc Length of a Curve Centroid Curly d Area below a Curve Chain Rule Curve Area between Curves Comparison Test Curve Sketching Area of an Ellipse Concave Cusp Area of a Parabolic Segment Concave Down Cylindrical Shell Method Area under a Curve Concave Up Decreasing Function Area Using Parametric Equations Conditional Convergence Definite Integral Area Using Polar Coordinates Constant Term Definite Integral Rules Degenerate Divergent Series Function Operations Del Operator e Fundamental Theorem of Calculus Deleted Neighborhood Ellipsoid GLB Derivative End Behavior Global Maximum Derivative of a Power Series Essential Discontinuity Global Minimum Derivative Rules Explicit Differentiation Golden Spiral Difference Quotient Explicit Function Graphic Methods Differentiable Exponential Decay Greatest Lower Bound Differential
    [Show full text]
  • Euler and His Work on Infinite Series
    BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 44, Number 4, October 2007, Pages 515–539 S 0273-0979(07)01175-5 Article electronically published on June 26, 2007 EULER AND HIS WORK ON INFINITE SERIES V. S. VARADARAJAN For the 300th anniversary of Leonhard Euler’s birth Table of contents 1. Introduction 2. Zeta values 3. Divergent series 4. Summation formula 5. Concluding remarks 1. Introduction Leonhard Euler is one of the greatest and most astounding icons in the history of science. His work, dating back to the early eighteenth century, is still with us, very much alive and generating intense interest. Like Shakespeare and Mozart, he has remained fresh and captivating because of his personality as well as his ideas and achievements in mathematics. The reasons for this phenomenon lie in his universality, his uniqueness, and the immense output he left behind in papers, correspondence, diaries, and other memorabilia. Opera Omnia [E], his collected works and correspondence, is still in the process of completion, close to eighty volumes and 31,000+ pages and counting. A volume of brief summaries of his letters runs to several hundred pages. It is hard to comprehend the prodigious energy and creativity of this man who fueled such a monumental output. Even more remarkable, and in stark contrast to men like Newton and Gauss, is the sunny and equable temperament that informed all of his work, his correspondence, and his interactions with other people, both common and scientific. It was often said of him that he did mathematics as other people breathed, effortlessly and continuously.
    [Show full text]
  • On the Euler Integral for the Positive and Negative Factorial
    On the Euler Integral for the positive and negative Factorial Tai-Choon Yoon ∗ and Yina Yoon (Dated: Dec. 13th., 2020) Abstract We reviewed the Euler integral for the factorial, Gauss’ Pi function, Legendre’s gamma function and beta function, and found that gamma function is defective in Γ(0) and Γ( x) − because they are undefined or indefinable. And we came to a conclusion that the definition of a negative factorial, that covers the domain of the negative space, is needed to the Euler integral for the factorial, as well as the Euler Y function and the Euler Z function, that supersede Legendre’s gamma function and beta function. (Subject Class: 05A10, 11S80) A. The positive factorial and the Euler Y function Leonhard Euler (1707–1783) developed a transcendental progression in 1730[1] 1, which is read xedx (1 x)n. (1) Z − f From this, Euler transformed the above by changing e to g for generalization into f x g dx (1 x)n. (2) Z − Whence, Euler set f = 1 and g = 0, and got an integral for the factorial (!) 2, dx ( lx )n, (3) Z − where l represents logarithm . This is called the Euler integral of the second kind 3, and the equation (1) is called the Euler integral of the first kind. 4, 5 Rewriting the formula (3) as follows with limitation of domain for a positive half space, 1 1 n ln dx, n 0. (4) Z0 x ≥ ∗ Electronic address: [email protected] 1 “On Transcendental progressions that is, those whose general terms cannot be given algebraically” by Leonhard Euler p.3 2 ibid.
    [Show full text]
  • A5730107.Pdf
    International OPEN ACCESS Journal Of Modern Engineering Research (IJMER) Applications of Bipartite Graph in diverse fields including cloud computing 1Arunkumar B R, 2Komala R Prof. and Head, Dept. of MCA, BMSIT, Bengaluru-560064 and Ph.D. Research supervisor, VTU RRC, Belagavi Asst. Professor, Dept. of MCA, Sir MVIT, Bengaluru and Ph.D. Research Scholar,VTU RRC, Belagavi ABSTRACT: Graph theory finds its enormous applications in various diverse fields. Its applications are evolving as it is perfect natural model and able to solve the problems in a unique way.Several disciplines even though speak about graph theory that is only in wider context. This paper pinpoints the applications of Bipartite graph in diverse field with a more points stressed on cloud computing. KEY WORDS: Graph theory, Bipartite graph cloud computing, perfect matching applications I. INTRODUCTION Graph theory has emerged as most approachable for all most problems in any field. In recent years, graph theory has emerged as one of the most sociable and fruitful methods for analyzing chemical reaction networks (CRNs). Graph theory can deal with models for which other techniques fail, for example, models where there is incomplete information about the parameters or that are of high dimension. Models with such issues are common in CRN theory [16]. Graph theory can find its applications in all most all disciplines of science, engineering, technology and including medical fields. Both in the view point of theory and practical bipartite graphs are perhaps the most basic of entities in graph theory. Until now, several graph theory structures including Bipartite graph have been considered only as a special class in some wider context in the discipline such as chemistry and computer science [1].
    [Show full text]
  • H:\My Documents\AAOF\Front and End Material\AAOF2-Preface
    The factorial function occurs widely in function theory; especially in the denominators of power series expansions of many transcendental functions. It also plays an important role in combinatorics [Section 2:14]. Because they too arise in the context of combinatorics, Stirling numbers of the second kind are discussed in Section 2:14 [those of the first kind find a home in Chapter 18]. Double and triple factorial functions are described in Section 2:14. 2:1 NOTATION The factorial function of n, also spoken of as “n factorial”, is generally given the symbol n!. It is represented byn in older literature. The symbol (n) is occasionally encountered. 2:2 BEHAVIOR The factorial function is defined only for nonnegative integer argument and is itself a positive integer. Because of its explosive increase, a plot of n!versusn is not very informative. Figure 2-1 is a graph of the logarithm (to base 10) of n!versusn. Note that 70! 10100. 2:3 DEFINITIONS The factorial function of the positive integer n equals the product of all positive integers up to and including n: n 2:3:1 nnnjn!123 u u uu ( 1) u 1,2,3, j 1 This definition is supplemented by the value 2:3:2 0! 1 conventionally accorded to zero factorial. K.B. Oldham et al., An Atlas of Functions, Second Edition, 21 DOI 10.1007/978-0-387-48807-3_3, © Springer Science+Business Media, LLC 2009 22 THE FACTORIAL FUNCTION n!2:4 The exponential function [Chapter 26] is a generating function [Section 0:3] for the reciprocal of the factorial function f 1 2:3:3 exp(tt ) ¦ n n 0 n! 2:4 SPECIAL CASES There are none.
    [Show full text]
  • Square Root Singularities of Infinite Systems of Functional Equations Johannes F
    Square root singularities of infinite systems of functional equations Johannes F. Morgenbesser To cite this version: Johannes F. Morgenbesser. Square root singularities of infinite systems of functional equations. 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA’10), 2010, Vienna, Austria. pp.513-526. hal-01185580 HAL Id: hal-01185580 https://hal.inria.fr/hal-01185580 Submitted on 20 Aug 2015 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. AofA’10 DMTCS proc. AM, 2010, 513–526 Square root singularities of infinite systems of functional equations Johannes F. Morgenbesser† Institut f¨ur Diskrete Mathematik und Geometrie, Technische Universit¨at Wien, Wiedner Hauptstraße 8-10, A-1040 Wien, Austria Infinite systems of equations appear naturally in combinatorial counting problems. Formally, we consider functional equations of the form y(x) = F (x, y(x)), where F (x, y) : C × ℓp → ℓp is a positive and nonlinear function, and analyze the behavior of the solution y(x) at the boundary of the domain of convergence. In contrast to the finite dimensional case different types of singularities are possible. We show that if the Jacobian operator of the function F is compact, then the occurring singularities are of square root type, as it is in the finite dimensional setting.
    [Show full text]
  • Double Factorial Binomial Coefficients Mitsuki Hanada Submitted in Partial Fulfillment of the Prerequisite for Honors in The
    Double Factorial Binomial Coefficients Mitsuki Hanada Submitted in Partial Fulfillment of the Prerequisite for Honors in the Wellesley College Department of Mathematics under the advisement of Alexander Diesl May 2021 c 2021 Mitsuki Hanada ii Double Factorial Binomial Coefficients Abstract Binomial coefficients are a concept familiar to most mathematics students. In particular, n the binomial coefficient k is most often used when counting the number of ways of choosing k out of n distinct objects. These binomial coefficients are well studied in mathematics due to the many interesting properties they have. For example, they make up the entries of Pascal's Triangle, which has many recursive and combinatorial properties regarding different columns of the triangle. Binomial coefficients are defined using factorials, where n! for n 2 Z>0 is defined to be the product of all the positive integers up to n. One interesting variation of the factorial is the double factorial (n!!), which is defined to be the product of every other positive integer up to n. We can use double factorials in the place of factorials to define double factorial binomial coefficients (DFBCs). Though factorials and double factorials look very similar, when we use double factorials to define binomial coefficients, we lose many important properties that traditional binomial coefficients have. For example, though binomial coefficients are always defined to be integers, we can easily determine that this is not the case for DFBCs. In this thesis, we will discuss the different forms that these coefficients can take. We will also focus on different properties that binomial coefficients have, such as the Chu-Vandermonde Identity and the recursive relation illustrated by Pascal's Triangle, and determine whether there exists analogous results for DFBCs.
    [Show full text]