Permutations with forbidden subsequences and a generalized Schröder number

DOI10.1016/S0012-365X(99)00302-7zbMATH Open0949.05003OpenAlexW2056117952MaRDI QIDQ1978151FDOQ1978151

Authors: Darla Kremer 

Publication date: 3 December 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00302-7

Recommendations

• Generalized Schröder permutations
• Generating trees and the Catalan and Schröder numbers
• Forbidden subsequences

zbMATH Keywords

Catalan numberspolyominoesgenerating treespattern avoiding permutationsforbidden subsequencesSchröder numbers

Mathematics Subject Classification ID

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

Cited In (44)

• Partial permutations avoiding pairs of patterns
• Equivalence of the descents statistic on some (4,4)-avoidance classes of permutations
• Passing through a stack \(k\) times with reversals
• Counting \(\mathbf {(3+1)}\)-avoiding permutations
• Counting 3-stack-sortable permutations
• Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
• Two stacks in series: a decreasing stack followed by an increasing stack
• Restricted 132-avoiding permutations
• Generating permutations with restricted containers
• The enumeration of permutations avoiding 3124 and 4312
• Upper bounds of Schubert polynomials
• A family of Bell transformations
• Postscript: ``Permutations with forbidden subsequences and a generalized Schröder number [Discrete Mathematics 218 (2000) 121--130]
• Generalized Schröder permutations
• Finite transition matrices for permutations avoiding pairs of length four patterns
• A sextuple equidistribution arising in pattern avoidance
• Restricted permutations and queue jumping
• Catalan pairs: a relational-theoretic approach to Catalan numbers
• Stack sorting with increasing and decreasing stacks
• Passing through a stack k times
• Bijections on pattern avoiding inversion sequences and related objects
• Permutations, parenthesis words, and Schröder numbers
• Generating trees and the Catalan and Schröder numbers
• Simple permutations and pattern restricted permutations
• Restricted signed permutations counted by the Schröder numbers
• Stack-sortable permutations and beyond
• Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polyno\-mials
• Finitely labeled generating trees and restricted permutations
• Schubert polynomials as projections of Minkowski sums of Gelfand-Tsetlin polytopes
• Enumeration Schemes for Restricted Permutations
• Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations
• Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels
• Signed Mahonian identities on permutations with subsequence restrictions
• Symmetric Schröder paths and restricted involutions
• Title not available (Why is that?)
• Cyclic pattern containment and avoidance
• Stack-sorting preimages of permutation classes
• Combinatorial Gray codes for classes of pattern avoiding permutations
• More restrictive Gray codes for some classes of pattern avoiding permutations
• Restricted colored permutations and Chebyshev polynomials
• Refined restricted inversion sequences
• On a conjecture of Lin and Kim concerning a refinement of Schröder numbers
• Title not available (Why is that?)
• Permutations restricted by two distinct patterns of length three

This page was built for publication: Permutations with forbidden subsequences and a generalized Schröder number

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