Restricted \(k\)-ary words and functional equations
From MaRDI portal
Publication:1028452
DOI10.1016/j.dam.2008.08.029zbMath1186.68345OpenAlexW1989189798MaRDI QIDQ1028452
Publication date: 30 June 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.08.029
Related Items
Pattern restricted Stirling \(k\)-ary words, the plateau statistic and the kernel method, Criteria for the matrix equivalence of words
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Excluded permutation matrices and the Stanley-Wilf conjecture
- The enumeration of permutations with a prescribed number of ``forbidden patterns
- Counting occurrences of 132 in a permutation
- A holonomic systems approach to special functions identities
- Enumeration schemes and, more importantly, their automatic generation
- Generating functions for generating trees
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Words restricted by 3-letter generalized multipermutation patterns
- Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
- Generalized permutation patterns and a classification of the Mahonian statistics
- Finite automata and pattern avoidance in words
- Words restricted by patterns with at most 2 distinct letters
- Generating trees and the Catalan and Schröder numbers
- The number of permutations containing exactly one increasing subsequence of length three
- On the number of permutations avoiding a given pattern
- Restricted 132-avoiding \(k\)-ary words, Chebyshev polynomials, and continued fractions
- Three-letter-pattern avoiding permutations and functional equations
- Enumeration Schemes for Restricted Permutations
- Restricted permutations
- Restricted permutations
- Restricted 132-avoiding permutations
