Forbidden subsequences and Chebyshev polynomials
From MaRDI portal
Publication:1300970
DOI10.1016/S0012-365X(98)00384-7zbMath0932.05007MaRDI QIDQ1300970
Publication date: 13 March 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
permutationsCatalan numberChebyshev polynomialsgenerating functiondirected animalslattice pathsplane treesFibonacci numberexcluded subsequences
Related Items
Continued fractions and generalized patterns ⋮ 132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers ⋮ Subregularity in infinitely labeled generating trees of restricted permutations ⋮ Restricted colored permutations and Chebyshev polynomials ⋮ On the diagram of 132-avoiding permutations ⋮ A general theory of Wilf-equivalence for Catalan structures ⋮ Patterns in Random Permutations Avoiding the Pattern 132 ⋮ Regular closed sets of permutations. ⋮ Combinatorial Gray codes for classes of pattern avoiding permutations ⋮ Calculating genus polynomials via string operations and matrices ⋮ Finitely labeled generating trees and restricted permutations ⋮ Semi-perimeter and inner site-perimeter of k-ary words and bargraphs ⋮ Generating permutations with restricted containers ⋮ Counting occurrences of 132 in a permutation ⋮ Restricted 132-avoiding permutations ⋮ Counting occurrences of 231 in an involution ⋮ Restricted 132-avoiding \(k\)-ary words, Chebyshev polynomials, and continued fractions ⋮ Sequences of non-Gegenbauer-Humbert polynomials meet the generalized Gegenbauer-Humbert polynomials ⋮ Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials ⋮ Restricted even permutations and Chebyshev polynomials ⋮ Exhaustive generation for permutations avoiding (colored) regular sets of patterns ⋮ Dyck paths and restricted permutations ⋮ More restrictive Gray codes for some classes of pattern avoiding permutations ⋮ The Möbius function of a composition poset ⋮ Permutations with restricted patterns and Dyck paths ⋮ Permutations restricted by two distinct patterns of length three ⋮ Approximating algebraic functions by means of rational ones ⋮ Enumeration Schemes for Restricted Permutations ⋮ Variations of the Catalan numbers from some nonassociative binary operations ⋮ On Stanley-Wilf limit of the pattern 1324 ⋮ Simple permutations and pattern restricted permutations ⋮ Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polyno\-mials ⋮ Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations
Cites Work
