Finitely labeled generating trees and restricted permutations
From MaRDI portal
Publication:2457348
DOI10.1016/j.jsc.2005.10.003zbMath1124.05004arXivmath/0309238OpenAlexW1974162764MaRDI QIDQ2457348
Publication date: 23 October 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0309238
Exact enumeration problems, generating functions (05A15) Nonnumerical algorithms (68W05) Permutations, words, matrices (05A05)
Related Items (12)
Locally convex words and permutations ⋮ Subregularity in infinitely labeled generating trees of restricted permutations ⋮ Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels ⋮ The weak order on pattern-avoiding permutations ⋮ Automatic discovery of structural rules of permutation classes ⋮ Generating permutations with restricted containers ⋮ Ascent sequences avoiding pairs of patterns ⋮ Enumeration Schemes for Restricted Permutations ⋮ Unnamed Item ⋮ Finding regular insertion encodings for permutation classes ⋮ Permutation patterns and cell decompositions ⋮ Stack-sorting for Words
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The tennis ball problem
- Partially well-ordered closed sets of permutations
- Matchings avoiding partial patterns
- Symmetric functions and P-recursiveness
- The number of Baxter permutations
- Forbidden subsequences and Chebyshev polynomials
- Enumeration schemes and, more importantly, their automatic generation
- Forbidden subsequences
- Generating functions for generating trees
- Finite transition matrices for permutations avoiding pairs of length four patterns
- Counting 1324-avoiding permutations
- Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
- A combinatorial proof of J. West's conjecture
- Enumeration of vexillary involutions which are equal to their mirror/complement
- An algebraic characterization of the set of succession rules
- Explicit enumeration of 321, hexagon-avoiding permutations
- Permutations avoiding two patterns of length three
- From object grammars to ECO systems
- Generating trees and the Catalan and Schröder numbers
- Permutations with forbidden subsequences and nonseparable planar maps
- Classification of forbidden subsequences of length 4
- Generating trees and forbidden subsequences
- Permutations with forbidden subsequences and a generalized Schröder number
- From Motzkin to Catalan permutations
- The insertion encoding of permutations
- ECO:a methodology for the enumeration of combinatorial objects
- Restricted permutations
- ECO method and hill-free generalized Motzkin paths
This page was built for publication: Finitely labeled generating trees and restricted permutations
