The Electronic Journal of Combinatorics · 2000 · 77 citations · 12 references
Natural SciencesMathematicsCombinatoricsCryptographyNumber TheoryAlgebraic CombinatoricsCombinatorial Number TheoryGenerating FunctionsChebyshev PolynomialsContinued Fraction ExpansionsContinued Fraction IdentitiesContinued-fraction ExpansionPermutationsRational Generating Functions
Let $f_n^r(k)$ be the number of 132-avoiding permutations on $n$ letters that contain exactly $r$ occurrences of $12\dots k$, and let $F_r(x;k)$ and $F(x,y;k)$ be the generating functions defined by $F_r(x;k)=\sum_{n\ge 0} f_n^r(k)x^n$ and $F(x,y;k)=\sum_{r\ge 0}F_r(x;k)y^r$. We find an explicit expression for $F(x,y;k)$ in the form of a continued fraction. This allows us to express $F_r(x;k)$ for $1\le r\le k$ via Chebyshev polynomials of the second kind.
12
The Art of Computer Programming
G.E. Whitesides · Nuclear Science and Engineering · 1970 · 6.1K citations
Rodica Simion, Frank Schmidt · European Journal of Combinatorics · 1985 · 348 citations
Zvezdelina Stankova · Discrete Mathematics · 1994 · 156 citations