Generating trees and the Catalan and Schröder numbers
From MaRDI portal
Publication:1903733
DOI10.1016/0012-365X(94)00067-1zbMath0841.05002MaRDI QIDQ1903733
Publication date: 14 July 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Trees (05C05) Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)
Related Items (only showing first 100 items - show all)
Equivalence of the descents statistic on some (4,4)-avoidance classes of permutations ⋮ The 𝑚=2 amplituhedron and the hypersimplex: Signs, clusters, tilings, Eulerian numbers ⋮ Unnamed Item ⋮ Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels ⋮ Some \(\gamma \)-positive polynomials arising from enumerations of the pseudo Schröder paths ⋮ Unnamed Item ⋮ A technology for reverse-engineering a combinatorial problem from a rational generating function ⋮ Restricted permutations ⋮ Generalized pattern avoidance ⋮ Permutations of a multiset avoiding permutations of length 3 ⋮ Permutations with restricted patterns and Dyck paths ⋮ Approximating algebraic functions by means of rational ones ⋮ Enumeration Schemes for Restricted Permutations ⋮ ECO:a methodology for the enumeration of combinatorial objects ⋮ The CDE property for skew vexillary permutations ⋮ Unnamed Item ⋮ On the centrosymmetric permutations in a class ⋮ Nine classes of permutations enumerated by binomial transform of Fine's sequence ⋮ Continued fractions and generalized patterns ⋮ A combinatorial bijection on di-sk trees ⋮ From object grammars to ECO systems ⋮ Uniform generation of a Schröder tree ⋮ Pattern matching for permutations ⋮ Restricted permutations and queue jumping ⋮ Chain blockers and convoluted Catalan numbers ⋮ On two-sided gamma-positivity for simple permutations ⋮ A generating tree approach to \(k\)-nonnesting partitions and permutations ⋮ On \(\gamma\)-positive polynomials arising in pattern avoidance ⋮ Wilf-equivalence for singleton classes ⋮ Subregularity in infinitely labeled generating trees of restricted permutations ⋮ Restricted Dumont permutations, Dyck paths, and noncrossing partitions ⋮ Semi-Baxter and Strong-Baxter: Two Relatives of the Baxter Sequence ⋮ Sorting by shuffling methods and a queue ⋮ Permutation pattern avoidance and the Catalan triangle ⋮ Bijections for refined restricted permutations ⋮ Wilf equivalences between vincular patterns in inversion sequences ⋮ Sorting with networks of data structures ⋮ Catalan intervals and uniquely sorted permutations ⋮ Impulse parameter and a new equivalence between 123- and 132-avoiding permutations ⋮ Restricted colored permutations and Chebyshev polynomials ⋮ Avoiding a pair of patterns in multisets and compositions ⋮ Generating trees and forbidden subsequences ⋮ The kernel method and systems of functional equations with several conditions ⋮ Free rises, restricted partitions, and \(q\)-Fibonacci polynomials ⋮ Generalized Schröder permutations ⋮ Partial permutations avoiding pairs of patterns ⋮ Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths ⋮ Parametric Catalan numbers and Catalan triangles ⋮ Beyond alternating permutations: pattern avoidance in Young diagrams and tableaux ⋮ The shape of random pattern-avoiding permutations ⋮ Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry ⋮ A sextuple equidistribution arising in pattern avoidance ⋮ Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers ⋮ Inversion formulae on permutations avoiding 321 ⋮ Finite transition matrices for permutations avoiding pairs of length four patterns ⋮ On the diagram of 132-avoiding permutations ⋮ Jumping succession rules and their generating functions ⋮ Pattern avoidance for alternating permutations and Young tableaux ⋮ On the likelihood of single-peaked preferences ⋮ Permutation patterns and statistics ⋮ The \(m\)-Schröder paths and \(m\)-Schröder numbers ⋮ Regular closed sets of permutations. ⋮ Combinatorial Gray codes for classes of pattern avoiding permutations ⋮ On the sub-permutations of pattern avoiding permutations ⋮ Counting signed vexillary permutations ⋮ An infinite family of inv-Wilf-equivalent permutation pairs ⋮ Production matrices and riordan arrays ⋮ Wilf classification of three and four letter signed patterns ⋮ Diffusion on an Ising chain with kinks ⋮ Finitely labeled generating trees and restricted permutations ⋮ On the vector space of the automatic reals ⋮ On the log-convexity of combinatorial sequences ⋮ Bijective proofs of recurrences involving two Schröder triangles ⋮ Counting matrices over finite fields with support on skew Young diagrams and complements of Rothe diagrams ⋮ Proper generating trees and their internal path length ⋮ Avoiding patterns and making the best choice ⋮ Mixed succession rules: the commutative case ⋮ Counting permutations with no long monotone subsequence via generating trees and the kernel method ⋮ Vexillary signed permutations revisited ⋮ The tennis ball problem ⋮ Separable elements and splittings of Weyl groups ⋮ Waiting patterns for a printer ⋮ Restricted signed permutations counted by the Schröder numbers ⋮ Counting occurrences of 231 in an involution ⋮ A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations ⋮ Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials ⋮ Production matrices ⋮ Exhaustive generation for permutations avoiding (colored) regular sets of patterns ⋮ A bijection between permutations and floorplans, and its applications ⋮ (2+2)-free posets, ascent sequences and pattern avoiding permutations ⋮ On the number of rectangulations of a planar point set ⋮ More restrictive Gray codes for some classes of pattern avoiding permutations ⋮ Separable elements in Weyl groups ⋮ On two unimodal descent polynomials ⋮ A general exhaustive generation algorithm for Gray structures ⋮ Catalan and Schröder permutations sortable by two restricted stacks ⋮ Patterns in random permutations avoiding some sets of multiple patterns ⋮ Refined Wilf-equivalences by Comtet statistics ⋮ Restricted \(k\)-ary words and functional equations ⋮ Slicings of parallelogram polyominoes: Catalan, Schröder, Baxter, and other sequences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Symmetric functions and P-recursiveness
- Schubert polynomials and the Littlewood-Richardson rule
- Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths
- The number of Baxter permutations
- Forbidden subsequences
- Asymptotic values for degrees associated with strips of Young diagrams
- Classification of forbidden subsequences of length 4
- Longest Increasing and Decreasing Subsequences
- Deux propriétés combinatoires des nombres de Schröder
- Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
- Restricted permutations
This page was built for publication: Generating trees and the Catalan and Schröder numbers
