Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials

Authors:
Qing-Hu Hou;Toufik Mansour
Affiliations:
Center for Combinatorics, LPMC, Nankai University, Tianjin 300071, PR China;Center for Combinatorics, LPMC, Nankai University, Tianjin 300071, PR China and Department of Mathematics, University of Haifa, 31905 Haifa, Israel
Venue:
Discrete Applied Mathematics
Year:
2006

Citing 8
Cited 0

Generating trees and the Catalan and Schro¨der numbers

Discrete Mathematics
Generating trees and forbidden subsequences

Proceedings of the 6th conference on Formal power series and algebraic combinatorics
Forbidden subsequences and Chebyshev polynomials

Discrete Mathematics - Special issue on selected papers in honor of Henry W. Gould
Regular Article: Restricted 132-Avoiding Permutations

Advances in Applied Mathematics
Permutations with Restricted Patterns and Dyck Paths

Advances in Applied Mathematics
Continued fractions and generalized patterns

European Journal of Combinatorics
Multi-avoidance of generalised patterns

Discrete Mathematics
Consecutive patterns in permutations

Advances in Applied Mathematics - Special issue on: Formal power series and algebraic combinatorics in memory of Rodica Simion, 1955-2000

Quantified Score

Hi-index	0.04

Visualization

Abstract

Several authors have examined connections among 132-avoiding permutations, continued fractions, and Chebyshev polynomials of the second kind. In this paper we find analogues for some of these results for permutations @p avoiding 132 and 1@?23 (there is no occurrence @p"i