Generating functions for generating trees
From MaRDI portal
Publication:1348138
DOI10.1016/S0012-365X(01)00250-3zbMath0997.05007arXivmath/0411250OpenAlexW2067239301WikidataQ56028214 ScholiaQ56028214MaRDI QIDQ1348138
Philippe Flajolet, Cyril Banderier, Alain Denise, Dominique Gouyou-Beauchamps, Daniéle Gardy, Mireille Bousquet-Mélou
Publication date: 15 May 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0411250
Related Items
Counting covered fixed points and covered arcs in an involution, Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels, Restricted inversion sequences and Schröder paths, Grand Dyck paths with air pockets, Recovering hierarchies in terms of content similarity, Wireless 3-hop Networks with Stealing Revisited: A Kernel Approach, An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences, Unnamed Item, Bell numbers, their relatives, and algebraic differential equations, The kernel method tail asymptotics analytic approach for stationary probabilities of two-dimensional queueing systems, Pattern restricted Stirling \(k\)-ary words, the plateau statistic and the kernel method, From object grammars to ECO systems, Walks confined in a quadrant are not always D-finite, Unnamed Item, Arithmetics properties of substitutions and infinite automata, Generation and enumeration of some classes of interval orders, Avoiding cross-bifix-free binary words, An elementary solution of Gessel's walks in the quadrant, A generating tree approach to \(k\)-nonnesting partitions and permutations, A decomposition of column-convex polyominoes and two vertex statistics, Subregularity in infinitely labeled generating trees of restricted permutations, On the Importance Sampling of Self-Avoiding Walks, Semi-Baxter and Strong-Baxter: Two Relatives of the Baxter Sequence, The enumeration of permutations whose posets have a maximum element, Smooth column convex polyominoes, Wilf equivalences between vincular patterns in inversion sequences, Enumeration of various animals on the triangular lattice, Catalan intervals and uniquely sorted permutations, Exact tail asymptotics for a two-stage queue: Complete solution via kernel method, Highly sorted permutations and Bell numbers, Vertically constrained Motzkin-like paths inspired by bobbin lace, Some enumerative results related to ascent sequences, Solving multivariate functional equations, Lattice paths with catastrophes, Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers, Young tableaux with periodic walls: counting with the density method, Formulae bringing to light from certain classes of numbers and polynomials, On directed lattice paths with vertical steps, Partially directed paths in a wedge, The site-perimeter of bargraphs, Formulae and Asymptotics for Coefficients of Algebraic Functions, The representation of the symmetric group on \(m\)-Tamari intervals, Weakly directed self-avoiding walks, Knight's paths towards Catalan numbers, Enumeration formulæ for pattern restricted Stirling permutations, Catalan numbers and pattern restricted set partitions, Convex polyominoes revisited: enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees, On the sub-permutations of pattern avoiding permutations, Unnamed Item, Pattern avoiding partitions and Motzkin left factors, Production matrices and riordan arrays, Fertility monotonicity and average complexity of the stack-sorting map, Tail asymptotics for a generalized two-demand queueing model -- a kernel method, Finitely labeled generating trees and restricted permutations, Enumeration of compact coalescent histories for matching gene trees and species trees, Enumeration of \((k,2)\)-noncrossing partitions, Longest alternating subsequences of \(k\)-ary words, Semi-Baxter and strong-Baxter permutations, Proper generating trees and their internal path length, Three Hoppy path problems and ternary paths, Words in linear groups, random walks, automata and P-recursiveness, Families of prudent self-avoiding walks, Counting permutations with no long monotone subsequence via generating trees and the kernel method, Kernel method and linear recurrence system, Waiting patterns for a printer, Unnamed Item, A history and a survey of lattice path enumeration, Restricted signed permutations counted by the Schröder numbers, Unnamed Item, On the number of walks in a triangular domain, Minimal permutations with \(d\) descents, Walks in the quarter plane: Kreweras' algebraic model, A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations, Finite automata and pattern avoidance in words, Production matrices, Asymptotics of lattice walks via analytic combinatorics in several variables, Polynomial equations with one catalytic variable, algebraic series and map enumeration, Integral Representation and Algorithms for Closed Form Summation, Counting colored planar maps: algebraicity results, Approximating algebraic functions by means of rational ones, A general exhaustive generation algorithm for Gray structures, Tableau sequences, open diagrams, and Baxter families, Unnamed Item, Kernel method and system of functional equations, Bounds on the number of numerical semigroups of a given genus, Combinatorial methods and recurrence relations with two indices, New permutation statistics: Variation and a variant, Restricted \(k\)-ary words and functional equations, Slicings of parallelogram polyominoes: Catalan, Schröder, Baxter, and other sequences, Meeting covered elements in \(\nu\)-Tamari lattices, On column-convex and convex Carlitz polyominoes, Exactly Solved Models, Cyclic pattern containment and avoidance, On the equivalence problem for succession rules, Exact tail asymptotics for fluid models driven by an \textit{M/M/c} queue, Poincaré polynomial at \(-1\) associated with a Young diagram of three rows, Recurrence relations with two indices and even trees, Algebraic entropy of a class of five-point differential-difference equations, Comments on: Light tail asymptotics in multidimensional reflecting processes for queueing networks, Enumeration of L-convex polyominoes by rows and columns, Description trees and Tutte formulas., A solution to the tennis ball problem, Basic analytic combinatorics of directed lattice paths, An algebraic characterization of the set of succession rules, Stack-sorting for Words, Kernel Method for Stationary Tails: From Discrete to Continuous, Exact tail asymptotics for a three-dimensional Brownian-driven tandem queue with intermediate inputs, Troupes, cumulants, and stack-sorting
