Generating trees and the Catalan and Schröder numbers
From MaRDI portal
(Redirected from Publication:1903733)
Recommendations
Cites work
- scientific article; zbMATH DE number 3165539 (Why is no real title available?)
- scientific article; zbMATH DE number 4168687 (Why is no real title available?)
- scientific article; zbMATH DE number 17784 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3448641 (Why is no real title available?)
- Asymptotic values for degrees associated with strips of Young diagrams
- Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
- Classification of forbidden subsequences of length 4
- Deux propriétés combinatoires des nombres de Schröder
- Forbidden subsequences
- Longest Increasing and Decreasing Subsequences
- Restricted permutations
- Schubert polynomials and the Littlewood-Richardson rule
- Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths
- Symmetric functions and P-recursiveness
- The number of Baxter permutations
Cited in
(only showing first 100 items - show all)- Catalan intervals and uniquely sorted permutations
- Partial permutations avoiding pairs of patterns
- Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths
- Semi-Baxter and strong-Baxter: two relatives of the Baxter sequence
- Regular closed sets of permutations.
- scientific article; zbMATH DE number 7731162 (Why is no real title available?)
- Distributions of statistics on separable permutations
- Equivalence of the descents statistic on some (4,4)-avoidance classes 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
- Mixed succession rules: the commutative case
- A general exhaustive generation algorithm for Gray structures
- Bijections for refined restricted permutations
- A technology for reverse-engineering a combinatorial problem from a rational generating function
- Explicit enumeration of 321, hexagon-avoiding permutations
- Restricted permutations
- 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
- Jumping succession rules and their generating functions
- On the number of rectangulations of a planar point set
- Bijective proofs of recurrences involving two Schröder triangles
- Restricted permutations
- Separable elements and splittings of Weyl groups
- On the likelihood of single-peaked preferences
- Vexillary signed permutations revisited
- Generalized Schröder permutations
- Finite transition matrices for permutations avoiding pairs of length four patterns
- Enumeration and Wilf-classification of permutations avoiding four patterns of length 4
- A combinatorial bijection on di-sk trees
- A sextuple equidistribution arising in pattern avoidance
- Separable elements in Weyl groups
- Restricted permutations and queue jumping
- A new class of Wilf-equivalent permutations
- Pattern matching for permutations
- Permutations with restricted patterns and Dyck paths
- Generating trees and forbidden subsequences
- Counting occurrences of 231 in an involution
- Production matrices
- Continued fractions and Catalan problems
- On two unimodal descent polynomials
- On the equivalence problem for succession rules
- Sorting with networks of data structures
- Counting signed vexillary permutations
- Permutations of a multiset avoiding permutations of length 3
- A combinatorial proof of J. West's conjecture
- Forbidden subsequences and Chebyshev polynomials
- Restricted k-ary words and functional equations
- Chain blockers and convoluted Catalan numbers
- A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations
- Lattices of lattice paths
- The 𝑚=2 amplituhedron and the hypersimplex: Signs, clusters, tilings, Eulerian numbers
- Permutation patterns and statistics
- Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations
- The kernel method and systems of functional equations with several conditions
- Generating functions for generating trees
- Waiting patterns for a printer
- On the vector space of the automatic reals
- Avoiding a pair of patterns in multisets and compositions
- ECO:a methodology for the enumeration of combinatorial objects
- On the sub-permutations of pattern avoiding permutations
- Some \(\gamma \)-positive polynomials arising from enumerations of the pseudo Schröder paths
- Subregularity in infinitely labeled generating trees of restricted permutations
- Approximating algebraic functions by means of rational ones
- Permutations, parenthesis words, and Schröder numbers
- Pattern avoidance for alternating permutations and Young tableaux
- Counting matrices over finite fields with support on skew Young diagrams and complements of Rothe diagrams
- Wilf-equivalence for singleton classes
- Uniform generation of a Schröder tree
- Exhaustive generation for permutations avoiding (colored) regular sets of patterns
- A bijection between permutations and floorplans, and its applications
- Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations
- An infinite family of inv-Wilf-equivalent permutation pairs
- Forbidden subsequences
- On \(d\)-permutations and pattern avoidance classes
- Restricted signed permutations counted by the Schröder numbers
- Simple permutations and pattern restricted permutations
- Counting permutations with no long monotone subsequence via generating trees and the kernel method
- Parametric Catalan numbers and Catalan triangles
- On the centrosymmetric permutations in a class
- On the diagram of 132-avoiding permutations
- A Tree for Generating Bernoulli Numbers
- A generating tree approach to k-nonnesting partitions and permutations
- On -positive polynomials arising in pattern avoidance
- Generating trees and proper Riordan arrays
- Wilf equivalences between vincular patterns in inversion sequences
- Generalized pattern avoidance
- Refined enumeration of permutations sorted with two stacks and a D₈-symmetry
- From object grammars to ECO systems
- Proper generating trees and their internal path length
- A partition of the Catalan numbers and enumeration of genealogical trees
- Permutation patterns and cell decompositions
- Wilf classification of three and four letter signed patterns
- Refined Wilf-equivalences by Comtet statistics
- Permutation pattern avoidance and the Catalan triangle
- Equipopularity classes in the separable permutations
- Meeting covered elements in \(\nu\)-Tamari lattices
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)
