Pages that link to "Item:Q1348138"

The following pages link to Generating functions for generating trees (Q1348138):

Displaying 50 items.

• Pattern restricted Stirling \(k\)-ary words, the plateau statistic and the kernel method (Q277629) (← links)
• An elementary solution of Gessel's walks in the quadrant (Q323719) (← links)
• A generating tree approach to \(k\)-nonnesting partitions and permutations (Q331488) (← links)
• Some enumerative results related to ascent sequences (Q393161) (← links)
• Solving multivariate functional equations (Q394345) (← links)
• The uplift principle for ordered trees (Q419136) (← links)
• Enumeration formulæ for pattern restricted Stirling permutations (Q456658) (← links)
• Catalan numbers and pattern restricted set partitions (Q456885) (← links)
• On the sub-permutations of pattern avoiding permutations (Q465287) (← links)
• Words in linear groups, random walks, automata and P-recursiveness (Q528822) (← links)
• Counting permutations with no long monotone subsequence via generating trees and the kernel method (Q536566) (← links)
• Walks in the quarter plane: Kreweras' algebraic model (Q558684) (← links)
• Weakly directed self-avoiding walks (Q640847) (← links)
• Pattern avoiding partitions and Motzkin left factors (Q657426) (← links)
• Production matrices and riordan arrays (Q659779) (← links)
• Tail asymptotics for a generalized two-demand queueing model -- a kernel method (Q660141) (← links)
• Tableau sequences, open diagrams, and Baxter families (Q739059) (← links)
• The enumeration of permutations whose posets have a maximum element (Q867908) (← links)
• On directed lattice paths with vertical steps (Q897305) (← links)
• Enumeration of \((k,2)\)-noncrossing partitions (Q941401) (← links)
• Families of prudent self-avoiding walks (Q965213) (← links)
• A history and a survey of lattice path enumeration (Q972828) (← links)
• Minimal permutations with \(d\) descents (Q976167) (← links)
• A general exhaustive generation algorithm for Gray structures (Q995753) (← links)
• Bounds on the number of numerical semigroups of a given genus (Q1008747) (← links)
• New permutation statistics: Variation and a variant (Q1026169) (← links)
• Restricted \(k\)-ary words and functional equations (Q1028452) (← links)
• The site-perimeter of bargraphs (Q1408282) (← links)
• Basic analytic combinatorics of directed lattice paths (Q1603684) (← links)
• An algebraic characterization of the set of succession rules (Q1603697) (← links)
• Lattice paths with catastrophes (Q1687786) (← links)
• Enumeration of compact coalescent histories for matching gene trees and species trees (Q1738019) (← links)
• Semi-Baxter and strong-Baxter permutations (Q1745110) (← links)
• Generating functions for multi-labeled trees (Q1759869) (← links)
• Waiting patterns for a printer (Q1765244) (← links)
• Finite automata and pattern avoidance in words (Q1775550) (← links)
• Production matrices (Q1775729) (← links)
• Description trees and Tutte formulas. (Q1853738) (← links)
• Bell numbers, their relatives, and algebraic differential equations (Q1873813) (← links)
• From object grammars to ECO systems (Q1884915) (← links)
• Walks confined in a quadrant are not always D-finite (Q1885016) (← links)
• Generating trees and forbidden subsequences (Q1924376) (← links)
• Generating trees and proper Riordan arrays (Q1978153) (← links)
• Meeting covered elements in \(\nu\)-Tamari lattices (Q2070083) (← links)
• On column-convex and convex Carlitz polyominoes (Q2071544) (← links)
• Cyclic pattern containment and avoidance (Q2078930) (← links)
• Poincaré polynomial at \(-1\) associated with a Young diagram of three rows (Q2084691) (← links)
• Troupes, cumulants, and stack-sorting (Q2118918) (← links)
• The kernel method tail asymptotics analytic approach for stationary probabilities of two-dimensional queueing systems (Q2124905) (← links)
• A decomposition of column-convex polyominoes and two vertex statistics (Q2155173) (← links)