Forbidden subsequences and Chebyshev polynomials

DOI10.1016/S0012-365X(98)00384-7zbMATH Open0932.05007MaRDI QIDQ1300970FDOQ1300970

Timothy Y. Chow, Julian West

Publication date: 13 March 2000

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

zbMATH Keywords

Catalan numberpermutationsgenerating functionChebyshev polynomialslattice pathsFibonacci numberplane treesdirected animalsexcluded subsequences

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Restricted permutations
• Generating trees and the Catalan and Schröder numbers
• The number of Baxter permutations
• Generating trees and forbidden subsequences

Cited In (34)

• Regular closed sets of permutations.
• Counting occurrences of 132 in a permutation
• Variations of the Catalan numbers from some nonassociative binary operations
• Restricted 132-avoiding permutations
• Continued fractions and generalized patterns
• Generating permutations with restricted containers
• Sequences of non-Gegenbauer-Humbert polynomials meet the generalized Gegenbauer-Humbert polynomials
• Permutations with restricted patterns and Dyck paths
• Counting occurrences of 231 in an involution
• 132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers
• The Möbius function of a composition poset
• Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences
• Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations
• On Stanley-Wilf limit of the pattern 1324
• Semi-perimeter and inner site-perimeter of k-ary words and bargraphs
• Approximating algebraic functions by means of rational ones
• Dyck paths and restricted permutations
• Subregularity in infinitely labeled generating trees of restricted permutations
• Exhaustive generation for permutations avoiding (colored) regular sets of patterns
• Simple permutations and pattern restricted permutations
• On the diagram of 132-avoiding permutations
• A general theory of Wilf-equivalence for Catalan structures
• Restricted 132-avoiding \(k\)-ary words, Chebyshev polynomials, and continued fractions
• Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polyno\-mials
• Finitely labeled generating trees and restricted permutations
• Enumeration Schemes for Restricted Permutations
• Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials
• Restricted even permutations and Chebyshev polynomials
• Calculating genus polynomials via string operations and matrices
• Combinatorial Gray codes for classes of pattern avoiding permutations
• More restrictive Gray codes for some classes of pattern avoiding permutations
• Patterns in Random Permutations Avoiding the Pattern 132
• Restricted colored permutations and Chebyshev polynomials
• Permutations restricted by two distinct patterns of length three

This page was built for publication: Forbidden subsequences and Chebyshev polynomials

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