AbstractWe study generating functions for the number of n-long k-ary words that avoid both 132 and an arbitrary ℓ-ary pattern. In several interesting cases the generating function depends only on ℓ and is expressed via Chebyshev polynomials of the second kind and continued fractions
International audienceIt is commonly admitted that the origin of combinatorics on words goes back to...
International audienceIt is commonly admitted that the origin of combinatorics on words goes back to...
AbstractWe exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijectio...
AbstractWe study generating functions for the number of n-long k-ary words that avoid both 132 and a...
AbstractWe study generating functions for the number of permutations on n letters avoiding 132 and a...
AbstractWe present an algorithm for finding a system of recurrence relations for the number of k-ary...
AbstractWe study generating functions for the number of even (odd) permutations on n letters avoidin...
AbstractSeveral authors have examined connections among restricted permutations, continued fractions...
AbstractSeveral authors have examined connections among 132-avoiding permutations, continued fractio...
Abstract. We study generating functions for the number of involutions of length n avoiding (or conta...
AbstractBabson and Steingrimsson (2000, Séminaire Lotharingien de Combinatoire, B44b, 18) introduced...
A 321-k-gon-avoiding permutation avoids 321 and the following four patterns: (k + 1)(k + 2)(k + ...
We find a generating function expressed as a continued fraction that enumerates ordered trees by the...
AbstractWe say that a permutation π is a Motzkin permutation if it avoids 132 and there do not exist...
International audienceIt is commonly admitted that the origin of combinatorics on words goes back to...
International audienceIt is commonly admitted that the origin of combinatorics on words goes back to...
International audienceIt is commonly admitted that the origin of combinatorics on words goes back to...
AbstractWe exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijectio...
AbstractWe study generating functions for the number of n-long k-ary words that avoid both 132 and a...
AbstractWe study generating functions for the number of permutations on n letters avoiding 132 and a...
AbstractWe present an algorithm for finding a system of recurrence relations for the number of k-ary...
AbstractWe study generating functions for the number of even (odd) permutations on n letters avoidin...
AbstractSeveral authors have examined connections among restricted permutations, continued fractions...
AbstractSeveral authors have examined connections among 132-avoiding permutations, continued fractio...
Abstract. We study generating functions for the number of involutions of length n avoiding (or conta...
AbstractBabson and Steingrimsson (2000, Séminaire Lotharingien de Combinatoire, B44b, 18) introduced...
A 321-k-gon-avoiding permutation avoids 321 and the following four patterns: (k + 1)(k + 2)(k + ...
We find a generating function expressed as a continued fraction that enumerates ordered trees by the...
AbstractWe say that a permutation π is a Motzkin permutation if it avoids 132 and there do not exist...
International audienceIt is commonly admitted that the origin of combinatorics on words goes back to...
International audienceIt is commonly admitted that the origin of combinatorics on words goes back to...
International audienceIt is commonly admitted that the origin of combinatorics on words goes back to...
AbstractWe exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijectio...
DOI
Add to ORKG