Restricted k-ary words and functional equations
From MaRDI portal
Restricted \(k\)-ary words and functional equations
Recommendations
- Restricted 132-avoiding \(k\)-ary words, Chebyshev polynomials, and continued fractions
- Counting occurrences of a pattern of length three with at most two distinct letters in a k-ary word
- Longest alternating subsequences in pattern-restricted \(k\)-ary words
- On avoiding 1233
- Three-letter-pattern avoiding permutations and functional equations
Cites work
- A holonomic systems approach to special functions identities
- Counting occurrences of 132 in a permutation
- Enumeration schemes and, more importantly, their automatic generation
- Enumeration Schemes for Restricted Permutations
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Finite automata and pattern avoidance in words
- Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
- Generalized permutation patterns and a classification of the Mahonian statistics
- Generating functions for generating trees
- Generating trees and the Catalan and Schröder numbers
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 1047749 (Why is no real title available?)
- On the number of permutations avoiding a given pattern
- Restricted 132-avoiding \(k\)-ary words, Chebyshev polynomials, and continued fractions
- Restricted 132-avoiding permutations
- Restricted permutations
- Restricted permutations
- The enumeration of permutations with a prescribed number of ``forbidden patterns
- The number of permutations containing exactly one increasing subsequence of length three
- Three-letter-pattern avoiding permutations and functional equations
- Words restricted by 3-letter generalized multipermutation patterns
- Words restricted by patterns with at most 2 distinct letters
Cited in
(10)- Restricted 132-avoiding \(k\)-ary words, Chebyshev polynomials, and continued fractions
- Pattern restricted Stirling \(k\)-ary words, the plateau statistic and the kernel method
- Longest alternating subsequences in pattern-restricted \(k\)-ary words
- Counting words with Laguerre series
- The \(\mu\) pattern in words
- Computation of k-ary Lyndon words using generating functions and their differential equations
- Generalized Jacobsthal numbers and restricted k-ary words
- Counting occurrences of a pattern of length three with at most two distinct letters in a k-ary word
- Counting words with Laguerre polynomials
- Criteria for the matrix equivalence of words
This page was built for publication: Restricted \(k\)-ary words and functional equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028452)
