scientific article; zbMATH DE number 986989
From MaRDI portal
Publication:3122908
asymptotic expansionscontext-free languagesfunctional equationsgenerating functionsimplcittree enumeration
Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Implicit function theorems, Jacobians, transformations with several variables (26B10) Functional equations for complex functions (39B32) Functional inequalities, including subadditivity, convexity, etc. (39B62) Series expansions (e.g., Taylor, Lidstone series, but not Fourier series) (41A58) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Multidimensional problems (41A63) Formal languages and automata (68Q45)
Recommendations
Cites work
- A bivariate asymptotic expansion of coefficients of powers of generating functions
- Asymptotic distributions and a multivariate Darboux method in enumeration problems
- Central and local limit theorems applied to asymptotic enumeration
- Central and local limit theorems applied to asymptotic enumeration. II: Multivariate generating functions
- Erratum: On an asymptotic method in enumeration
- Holomorphic functions of several variables. An introduction to the fundamental theory. With the assist. of Gottfried Barthel transl. by Michael Bridgland
- scientific article; zbMATH DE number 4183468 (Why is no real title available?)
- On maximal independent sets of nodes in trees
- On the Altitude of Nodes in Random Trees
- Singularity Analysis of Generating Functions
Cited in
(72)- Transversal structures on triangulations: A combinatorial study and straight-line drawings
- Analytic combinatorics of non-crossing configurations
- Performance analysis of a single-server ATM queue with a priority scheduling.
- Growth-sensitivity of context-free languages.
- Structure and enumeration of \(K_{4}\)-minor-free links and link diagrams
- Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs
- Performance analysis of a \(GI-Geo-1\) buffer with a preemptive resume priority scheduling discipline
- Method of function systems and its application
- Equilibrium value and measure of systems of functions
- Characteristic points of recursive systems
- From implicit to recursive equations
- Functional equations with multiple recursive terms
- Analysis of an efficient reduction algorithm for random regular expressions based on universality detection
- Scaling limits of permutation classes with a finite specification: a dichotomy
- Structure and enumeration of \(K_4\)-minor-free links and link-diagrams
- Counting and sampling gene family evolutionary histories in the duplication-loss and duplication-loss-transfer models
- Statistical properties of lambda terms
- On the limiting distribution of the metric dimension for random forests
- Asymptotic enumeration and limit laws for graphs of fixed genus
- Combinatorics of locally optimal RNA secondary structures
- Asymptotic number of hairpins of saturated RNA secondary structures
- Analysis of a discrete-time preemptive resume priority buffer
- Recursion and growth estimates in renormalizable quantum field theory
- Spanning trees in random series-parallel graphs
- Priority queueing systems: from probability generating functions to tail probabilities
- Analysis of steady-state and transient delay in discrete-time single-arrival and batch-arrival systems
- Infinite systems of functional equations and Gaussian limiting distributions
- Square root singularities of infinite systems of functional equations
- Spectra and systems of equations
- Growth and ergodicity of context-free languages
- On solving some functional equations
- scientific article; zbMATH DE number 3869890 (Why is no real title available?)
- On Two Subclasses of Motzkin Paths and Their Relation to Ternary Trees
- Complexity and Limiting Ratio of Boolean Functions over Implication
- Limit distributions and scaling functions
- scientific article; zbMATH DE number 4035167 (Why is no real title available?)
- scientific article; zbMATH DE number 4075068 (Why is no real title available?)
- Non-redundant random generation algorithms for weighted context-free grammars
- Combinatorics of Poincaré's and Schröder's equations
- Counting, Generating, Analyzing and Sampling Tree Alignments
- Asymptotic distribution of motifs in a stochastic context-free grammar model of RNA folding
- Spanning forests in regular planar maps
- The vectorial kernel method for walks with longer steps
- Uniform random expressions lack expressivity
- Combinatorial functional equations. Volume 1. Basic theory
- Formulae and asymptotics for coefficients of algebraic functions
- Degree distribution in random planar graphs
- The asymptotic value of the Randić index for trees
- Hypergraphs and a functional equation of Bouwkamp and de Bruijn
- Structural theorems for multiplicative systems of functions
- Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
- On a system of functional equations
- Functional equations for data structures
- A power series satisfying a certain functional equation
- Fast Algorithms for Discrete Differential Equations
- The kernel method and systems of functional equations with several conditions
- Universal asymptotic properties of positive functional equations with one catalytic variable
- Simplifications of Uniform Expressions Specified by Systems
- Rare event asymptotics for a random walk in the quarter plane
- Minor-obstructions for apex sub-unicyclic graphs
- Undesignable motifs in structural RNAs and combinatorial consequences
- Heuristic universality detection over regular expressions specified by systems
- Controlled non-uniform random generation of decomposable structures
- Asymptotics for coefficients of algebraic functions
- Minor-obstructions for apex sub-unicyclic graphs
- Analytic solutions of systems of functional equations
- A modified HOL priority scheduling discipline: performance analysis
- On the number of matchings of a tree
- The asymptotic number of non-isomorphic rooted trees obtained by rooting a tree
- Many 2-level polytopes from matroids
- Trees, functional equations, and combinatorial Hopf algebras
- On \(q\)-functional equations and excursion moments
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3122908)
