Forbidden subsequences and Chebyshev polynomials

DOI10.1016/S0012-365X(98)00384-7MaRDI QIDQ1300970zbMATH OpenFDO

Authors Julian West, Timothy Y. Chow

Publication date 13 March 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(98)00384-7

zbMATH Keywords

Catalan numberChebyshev polynomialsdirected animalsexcluded subsequencesFibonacci numbergenerating functionlattice pathspermutationsplane trees

Mathematics Subject Classification ID

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

Recommendations

• Permutations which avoid 1243 and 2143, continued fractions, and Chebyshev polynomials
• scientific article; zbMATH DE number 2127715
• Restricted permutations and Chebyshev polynomials
• Restricted even permutations and Chebyshev polynomials
• Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials

Cites work

• Generating trees and forbidden subsequences
• Generating trees and the Catalan and Schröder numbers
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• Restricted permutations
• The number of Baxter permutations

Cited in

(34)

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

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)