14 search results - page 1 / 3 » Permutation Patterns and Continued Fractions |
COMBINATORICS
1999
13 years 4 months ago
1999
We find, in the form of a continued fraction, the generating function for the number of (132)-avoiding permutations that have a given number of (123) patterns, and show how to ext...
COMBINATORICS
2002
13 years 4 months ago
2002
Several authors have examined connections between permutations which avoid 132, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues...
COMBINATORICS
2000
13 years 4 months ago
2000
We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to...
COMBINATORICS
2000
13 years 4 months ago
2000
Let fr n(k) be the number of 132-avoiding permutations on n letters that contain exactly r occurrences of 12 . . . k, and let Fr(x; k) and F (x, y; k) be the generating functions d...
DGCI
2008
Springer
13 years 6 months ago
2008
Springer
This paper extends, in a multi-dimensional framework, pattern recognition techniques for generation or recognition of digital lines. More precisely, we show how the connection bet...