Formulae and Asymptotics for Coefficients of Algebraic Functions
From MaRDI portal
Publication:5364226
DOI10.1017/S0963548314000728zbMath1371.05009MaRDI QIDQ5364226
Michael Drmota, Cyril Banderier
Publication date: 4 October 2017
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Related Items
Graded algebras, algebraic functions, planar trees, and elliptic integrals, Self-avoiding walks and multiple context-free languages, On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations, Topology and counting of real algebraic curves, Scaling limits of permutation classes with a finite specification: a dichotomy, Computational aspects of sturdy and flimsy numbers, The vectorial kernel method for walks with longer steps, Renormalized asymptotic enumeration of Feynman diagrams, A half-normal distribution scheme for generating functions, The classical Artin approximation theorems, Lattice paths with catastrophes, Unnamed Item, Universal asymptotic properties of positive functional equations with one catalytic variable, Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations, Sofic-Dyck shifts, Simplifications of Uniform Expressions Specified by Systems, Generating functions for lattice paths with several forbidden patterns, Unnamed Item, Universal singular exponents in catalytic variable equations, On the number of unary-binary tree-like structures with restrictions on the unary height, Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata, Hilbert series in the category of trees with contractions, Limit laws of planar maps with prescribed vertex degrees, Unnamed Item, Graph limits of random graphs from a subset of connected k‐trees, Periodic Pólya urns, the density method and asymptotics of Young tableaux, Number of prefixes in trace monoids: clique polynomials and dependency graphs
Uses Software
Cites Work
- Context-free pairs of groups. I: Context-free pairs and graphs
- Algorithms for combinatorial structures: well-founded systems and Newton iterations
- Expected distance between terminal nucleotides of RNA secondary structures
- Context-free pairs of groups. II: Cuts, tree sets, and random walks
- On vanishing coefficients of algebraic power series over fields of positive characteristic
- Marking in combinatorial constructions: Generating functions and limiting distributions
- Handbook of weighted automata
- A ridiculously simple and explicit implicit function theorem
- Power series solutions of algebraic differential equations
- The reciprocals of solutions of linear ordinary differential equations
- Analytic models and ambiguity of context-free languages
- Prefixes of infinite words and ambiguous context-free languages
- On expansion of algebraic functions in power and Puiseux series. II
- Monodromy for the hypergeometric function \(_ nF_{n-1}\)
- A note on the density of inherently ambiguous context-free languages
- Une théorie combinatoire des séries formelles
- Positive rational sequences
- Uniform random generation of decomposable structures using floating-point arithmetic
- Analytic combinatorics of non-crossing configurations
- \(Q\)-grammars and wall polyominoes
- Finite range random walk on free groups and homogeneous trees
- Asymptotic distributions and a multivariate Darboux method in enumeration problems
- A calculus for the random generation of labelled combinatorial structures
- Generating functions for generating trees
- Algebraic languages and polyominoes enumeration
- Growth-sensitivity of context-free languages.
- Sur les séries de Taylor n'ayant que des singularites algebrico- logarithmiques sur leur cercle de convergence
- On the enumeration and generation of generalized Dyck words
- Basic analytic combinatorics of directed lattice paths
- Enumeration and asymptotics of restricted compositions having the same number of parts
- Walks on the slit plane
- On problems related to growth, entropy, and spectrum in group theory
- Regular languages and their generating functions: The inverse problem
- Polynomial equations with one catalytic variable, algebraic series and map enumeration
- Calcul pratique des coefficients de Taylor d'une fonction algébrique
- Algebraic functions over finite fields
- Why Delannoy numbers?
- Simple permutations and pattern restricted permutations
- Random maps, coalescing saddles, singularity analysis, and Airy phenomena
- Fully Analyzing an Algebraic Pólya Urn Model
- A Symbolic Summation Approach to Find Optimal Nested Sum Representations
- Uniform Random Generation of Strings in a Context-Free Language
- Random Generation for Finitely Ambiguous Context-free Languages
- Growth and ergodicity of context-free languages
- On the set of zero coefficients of a function satisfying a linear differential equation
- Automatic Classification of Restricted Lattice Walks
- On a Theorem of R. Jungen
- Singularity Analysis of Generating Functions
- Random Trees
- Extending Stochastic Context-Free Grammars for an Application in Bioinformatics
- Limit Distributions and Scaling Functions
- Algebraic Relations Among Solutions of Linear Differential Equations
- Suites algébriques, automates et substitutions
- Context-free languages, groups, the theory of ends, second-order logic, tiling problems, cellular automata, and vector addition systems
- On the Altitude of Nodes in Random Trees
- Coloring rules for finite trees, and probabilities of monadic second order sentences
- Automatic Sequences
- Distances in random Apollonian network structures
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- The complete generating function for Gessel walks is algebraic
- On Buffon Machines and Numbers
- Rational and algebraic series in combinatorial enumeration
- A technology for reverse-engineering a combinatorial problem from a rational generating function
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
