Generating trees and the Catalan and Schröder numbers

DOI10.1016/0012-365X(94)00067-1zbMATH Open0841.05002MaRDI QIDQ1903733FDOQ1903733

Authors: Julian West

Publication date: 14 July 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

Permutations with forbidden subsequences and a generalized Schröder number
Forbidden subsequences
Publication:4954008
Permutations, parenthesis words, and Schröder numbers
Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps

zbMATH Keywords

Catalan number permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Trees (05C05) Exact enumeration problems, generating functions (05A15)

Cites Work

Cited In (only showing first 100 items - show all)

Partial permutations avoiding pairs of patterns
Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths
Regular closed sets of permutations.
Beyond alternating permutations: pattern avoidance in Young diagrams and tableaux
The shape of random pattern-avoiding permutations
Surprising symmetries in objects counted by Catalan numbers
Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
Restricted permutations
A general exhaustive generation algorithm for Gray structures
Bijections for refined restricted permutations
Explicit enumeration of 321, hexagon-avoiding permutations
Restricted permutations
On the number of rectangulations of a planar point set
Generalized Schröder permutations
Finite transition matrices for permutations avoiding pairs of length four patterns
A sextuple equidistribution arising in pattern avoidance
A new class of Wilf-equivalent permutations
Permutations with restricted patterns and Dyck paths
Generating trees and forbidden subsequences
Counting occurrences of 231 in an involution
Pattern matching for permutations
Production matrices
On the equivalence problem for succession rules
Permutations of a multiset avoiding permutations of length 3
Sorting with networks of data structures
A combinatorial proof of J. West's conjecture
Forbidden subsequences and Chebyshev polynomials
Restricted \(k\)-ary words and functional equations
A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations
Chain blockers and convoluted Catalan numbers
Lattices of lattice paths
Permutation patterns and statistics
Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations
Generating functions for generating trees
The kernel method and systems of functional equations with several conditions
Waiting patterns for a printer
ECO:a methodology for the enumeration of combinatorial objects
On the vector space of the automatic reals
Approximating algebraic functions by means of rational ones
On the sub-permutations of pattern avoiding permutations
Permutations, parenthesis words, and Schröder numbers
Pattern avoidance for alternating permutations and Young tableaux
Wilf-equivalence for singleton classes
Counting matrices over finite fields with support on skew Young diagrams and complements of Rothe diagrams
A bijection between permutations and floorplans, and its applications
Uniform generation of a Schröder tree
Simple permutations and pattern restricted permutations
Forbidden subsequences
A Tree for Generating Bernoulli Numbers
An infinite family of inv-Wilf-equivalent permutation pairs
Generalized pattern avoidance
Parametric Catalan numbers and Catalan triangles
Counting permutations with no long monotone subsequence via generating trees and the kernel method
On the diagram of 132-avoiding permutations
Generating trees and proper Riordan arrays
A generating tree approach to \(k\)-nonnesting partitions and permutations
On \(\gamma\)-positive polynomials arising in pattern avoidance
Proper generating trees and their internal path length
Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry
Wilf classification of three and four letter signed patterns
Permutation pattern avoidance and the Catalan triangle
Finitely labeled generating trees and restricted permutations
Enumeration Schemes for Restricted Permutations
Production matrices and riordan arrays
An algebraic characterization of the set of succession rules
Patterns in random permutations avoiding some other patterns
Enumeration schemes and, more importantly, their automatic generation
(2+2)-free posets, ascent sequences and pattern avoiding permutations
The tennis ball problem
Combinatorial Gray codes for classes of pattern avoiding permutations
Patterns in random permutations avoiding some sets of multiple patterns
On Catalan trees and the Jacobian conjecture
More restrictive Gray codes for some classes of pattern avoiding permutations
On the log-convexity of combinatorial sequences
Restricted colored permutations and Chebyshev polynomials
Inversion formulae on permutations avoiding 321
Free rises, restricted partitions, and \(q\)-Fibonacci polynomials
Title not available (Why is that?)
Semi-Baxter and strong-Baxter: two relatives of the Baxter sequence
Equivalence of the descents statistic on some (4,4)-avoidance classes of permutations
Mixed succession rules: the commutative case
A technology for reverse-engineering a combinatorial problem from a rational generating function
Avoiding patterns and making the best choice
Nine classes of permutations enumerated by binomial transform of Fine's sequence
Continued fractions and generalized patterns
Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
Bijective proofs of recurrences involving two Schröder triangles
Jumping succession rules and their generating functions
Separable elements and splittings of Weyl groups
On the likelihood of single-peaked preferences
Enumeration and Wilf-classification of permutations avoiding four patterns of length 4
Vexillary signed permutations revisited
A combinatorial bijection on di-sk trees
Separable elements in Weyl groups
Restricted permutations and queue jumping
Continued fractions and Catalan problems
On two unimodal descent polynomials
Counting signed vexillary permutations
The 𝑚=2 amplituhedron and the hypersimplex: Signs, clusters, tilings, Eulerian numbers
Avoiding a pair of patterns in multisets and compositions

This page was built for publication: Generating trees and the Catalan and Schröder numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1903733)