Generating Functions and Analytic Combinatorics

2020 ◽  
pp. 21-91
Author(s):  
Stephen Melczer
Keyword(s):  
Generating Functions ◽  
Analytic Combinatorics

scholarly journals Isomorphism and Symmetries in Random Phylogenetic Trees

2009 ◽  
Vol 46 (04) ◽  
pp. 1005-1019 ◽  
Author(s):  
Miklós Bóna ◽  
Philippe Flajolet
Keyword(s):  
Phylogenetic Tree ◽  
Gaussian Distribution ◽  
Generating Functions ◽  
Phylogenetic Trees ◽  
Singularity Analysis ◽  
Square Root ◽  
Analytic Combinatorics ◽  
Large Size ◽  
Polynomial Factor

The probability that two randomly selected phylogenetic trees of the same size are isomorphic is found to be asymptotic to a decreasing exponential modulated by a polynomial factor. The number of symmetrical nodes in a random phylogenetic tree of large size obeys a limiting Gaussian distribution, in the sense of both central and local limits. The probability that two random phylogenetic trees have the same number of symmetries asymptotically obeys an inverse square-root law. Precise estimates for these problems are obtained by methods of analytic combinatorics, involving bivariate generating functions, singularity analysis, and quasi-powers approximations.

scholarly journals Asymptotics of lattice walks via analytic combinatorics in several variables

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Stephen Melczer ◽  
Mark C. Wilson
Keyword(s):  
Generating Functions ◽  
Kernel Method ◽  
Rational Functions ◽  
Two Dimensional ◽  
Combinatorial Properties ◽  
Analytic Combinatorics ◽  
Several Variables ◽  
Algebra Approach ◽  
Finite Set ◽  
International Audience

International audience We consider the enumeration of walks on the two-dimensional non-negative integer lattice with steps defined by a finite set S ⊆ {±1, 0}2 . Up to isomorphism there are 79 unique two-dimensional models to consider, and previous work in this area has used the kernel method, along with a rigorous computer algebra approach, to show that 23 of the 79 models admit D-finite generating functions. In 2009, Bostan and Kauers used Pade ́-Hermite approximants to guess differential equations which these 23 generating functions satisfy, in the process guessing asymptotics of their coefficient sequences. In this article we provide, for the first time, a complete rigorous verification of these guesses. Our technique is to use the kernel method to express 19 of the 23 generating functions as diagonals of tri-variate rational functions and apply the methods of analytic combinatorics in several variables (the remaining 4 models have algebraic generating functions and can thus be handled by univariate techniques). This approach also shows the link between combinatorial properties of the models and features of its asymptotics such as asymptotic and polynomial growth factors. In addition, we give expressions for the number of walks returning to the x-axis, the y-axis, and the origin, proving recently conjectured asymptotics of Bostan, Chyzak, van Hoeij, Kauers, and Pech.

scholarly journals Isomorphism and Symmetries in Random Phylogenetic Trees

2009 ◽  
Vol 46 (4) ◽  
pp. 1005-1019 ◽  
Author(s):  
Miklós Bóna ◽  
Philippe Flajolet
Keyword(s):  
Phylogenetic Tree ◽  
Gaussian Distribution ◽  
Generating Functions ◽  
Phylogenetic Trees ◽  
Singularity Analysis ◽  
Square Root ◽  
Analytic Combinatorics ◽  
Large Size ◽  
Polynomial Factor

The probability that two randomly selected phylogenetic trees of the same size are isomorphic is found to be asymptotic to a decreasing exponential modulated by a polynomial factor. The number of symmetrical nodes in a random phylogenetic tree of large size obeys a limiting Gaussian distribution, in the sense of both central and local limits. The probability that two random phylogenetic trees have the same number of symmetries asymptotically obeys an inverse square-root law. Precise estimates for these problems are obtained by methods of analytic combinatorics, involving bivariate generating functions, singularity analysis, and quasi-powers approximations.

On Average Behaviour of Regular Expressions in Strong Star Normal Form

2019 ◽  
Vol 30 (06n07) ◽  
pp. 899-920 ◽  
Author(s):  
Sabine Broda ◽  
António Machiavelo ◽  
Nelma Moreira ◽  
Rogério Reis
Keyword(s):  
Normal Form ◽  
Generating Functions ◽  
Finite Automata ◽  
Regular Expressions ◽  
Large Set ◽  
Asymptotic Estimates ◽  
Analytic Combinatorics ◽  
Average Complexity ◽  
Average Behaviour ◽  
Puiseux Expansions

For regular expressions in (strong) star normal form a large set of efficient algorithms is known, from conversions into finite automata to characterisations of unambiguity. In this paper we study the average complexity of this class of expressions using analytic combinatorics. As it is not always feasible to obtain explicit expressions for the generating functions involved, here we show how to get the required information for the asymptotic estimates with an indirect use of the existence of Puiseux expansions at singularities. We study, asymptotically and on average, the alphabetic size, the size of the [Formula: see text]-follow automaton and of the position automaton, as well as the ratio and the size of these expressions to standard regular expressions.

scholarly journals The probability of planarity of a random graph near the critical point

2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Marc Noy ◽  
Vlady Ravelomanana ◽  
Juanjo Rué
Keyword(s):  
Critical Point ◽  
Random Graph ◽  
Random Graphs ◽  
Generating Functions ◽  
Exact Expression ◽  
Critical Window ◽  
Analytic Combinatorics ◽  
Analytic Methods ◽  
International Audience ◽  
Standing Question

International audience Erdős and Rényi conjectured in 1960 that the limiting probability $p$ that a random graph with $n$ vertices and $M=n/2$ edges is planar exists. It has been shown that indeed p exists and is a constant strictly between 0 and 1. In this paper we answer completely this long standing question by finding an exact expression for this probability, whose approximate value turns out to be $p ≈0.99780$. More generally, we compute the probability of planarity at the critical window of width $n^{2/3}$ around the critical point $M=n/2$. We extend these results to some classes of graphs closed under taking minors. As an example, we show that the probability of being series-parallel converges to 0.98003. Our proofs rely on exploiting the structure of random graphs in the critical window, obtained previously by Janson, Łuczak and Wierman, by means of generating functions and analytic methods. This is a striking example of how analytic combinatorics can be applied to classical problems on random graphs.

Short Generating Functions for some Semigroup Algebras

10.37236/1729 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
Graham Denham
Keyword(s):  
Rational Function ◽  
Generating Functions ◽  
Hilbert Series ◽  
Simple Expression ◽  
Arbitrary Field ◽  
Graded Algebra ◽  
Semigroup Algebras ◽  
Positive Integers

Let $a_1,\ldots,a_n$ be distinct, positive integers with $(a_1,\ldots,a_n)=1$, and let k be an arbitrary field. Let $H(a_1,\ldots,a_n;z)$ denote the Hilbert series of the graded algebra k$[t^{a_1},t^{a_2},\ldots,t^{a_n}]$. We show that, when $n=3$, this rational function has a simple expression in terms of $a_1,a_2,a_3$; in particular, the numerator has at most six terms. By way of contrast, it is known that no such expression exists for any $n\geq4$.

New family of Whitney numbers

Filomat ◽  
2017 ◽  
Vol 31 (2) ◽  
pp. 309-320 ◽  
Author(s):  
B.S. El-Desouky ◽  
Nenad Cakic ◽  
F.A. Shiha
Keyword(s):  
Generating Functions ◽  
Recurrence Relations ◽  
Stirling Numbers ◽  
Explicit Formulas ◽  
Basic Properties ◽  
New Family ◽  
Whitney Numbers ◽  
Special Cases

In this paper we give a new family of numbers, called ??-Whitney numbers, which gives generalization of many types of Whitney numbers and Stirling numbers. Some basic properties of these numbers such as recurrence relations, explicit formulas and generating functions are given. Finally many interesting special cases are derived.

Identities related to special polynomials and combinatorial numbers

Filomat ◽  
2017 ◽  
Vol 31 (15) ◽  
pp. 4833-4844 ◽  
Author(s):  
Eda Yuluklu ◽  
Yilmaz Simsek ◽  
Takao Komatsu
Keyword(s):  
Generating Functions ◽  
Functional Equations ◽  
Stirling Numbers ◽  
Bernoulli Numbers ◽  
Euler Numbers ◽  
Special Polynomials ◽  
Central Factorial Numbers

The aim of this paper is to give some new identities and relations related to the some families of special numbers such as the Bernoulli numbers, the Euler numbers, the Stirling numbers of the first and second kinds, the central factorial numbers and also the numbers y1(n,k,?) and y2(n,k,?) which are given Simsek [31]. Our method is related to the functional equations of the generating functions and the fermionic and bosonic p-adic Volkenborn integral on Zp. Finally, we give remarks and comments on our results.

Symplectic capacities

2017 ◽  
Author(s):  
Dusa McDuff ◽  
Dietmar Salamon
Keyword(s):  
Euclidean Space ◽  
Generating Functions ◽  
Weinstein Conjecture ◽  
Finite Dimensional ◽  
Hofer Metric

This chapter returns to the problems which were formulated in Chapter 1, namely the Weinstein conjecture, the nonsqueezing theorem, and symplectic rigidity. These questions are all related to the existence and properties of symplectic capacities. The chapter begins by discussing some of the consequences which follow from the existence of capacities. In particular, it establishes symplectic rigidity and discusses the relation between capacities and the Hofer metric on the group of Hamiltonian symplectomorphisms. The chapter then introduces the Hofer–Zehnder capacity, and shows that its existence gives rise to a proof of the Weinstein conjecture for hypersurfaces of Euclidean space. The last section contains a proof that the Hofer–Zehnder capacity satisfies the required axioms. This proof translates the Hofer–Zehnder variational argument into the setting of (finite-dimensional) generating functions.

Poisson Brackets & Angular Momentum

2018 ◽  
Author(s):  
Peter Mann
Keyword(s):  
Generating Functions ◽  
First Integrals ◽  
Lagrangian Mechanics ◽  
Poisson Brackets ◽  
Coordinate Transformations ◽  
Canonical Transformations ◽  
Gauge Transformations ◽  
The Third ◽  
Point Transformations ◽  
Canonical Coordinate

This chapter discusses canonical transformations and gauge transformations and is divided into three sections. In the first section, canonical coordinate transformations are introduced to the reader through generating functions as the extension of point transformations used in Lagrangian mechanics, with the harmonic oscillator being used as an example of a canonical transformation. In the second section, gauge theory is discussed in the canonical framework and compared to the Lagrangian case. Action-angle variables, direct conditions, symplectomorphisms, holomorphic variables, integrable systems and first integrals are examined. The third section looks at infinitesimal canonical transformations resulting from functions on phase space. Ostrogradsky equations in the canonical setting are also detailed.

Sign in / Sign up

Export Citation Format

Share Document