Regular Article: Restricted 132-Avoiding Permutations

Authors:
Toufik Mansour;Alek Vainshtein
Affiliations:
Department of Mathematics, University of Haifa, Haifa, Israel, 31905f1tmansur@study.haifa.ac.ilf1;Departments of Mathematics and Computer Science, University of Haifa, Haifa, Israel, 31905f2alek@mathcs.haifa.ac.ilf2
Venue:
Advances in Applied Mathematics
Year:
2001

Citing 0
Cited 9

On the diagram of 132-avoiding permutations

European Journal of Combinatorics
Regular closed sets of permutations

Theoretical Computer Science
132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers

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

Discrete Applied Mathematics
Dyck paths and restricted permutations

Discrete Applied Mathematics
Introduction to partially ordered patterns

Discrete Applied Mathematics
Simple permutations and algebraic generating functions

Journal of Combinatorial Theory Series A
Restricted k-ary words and functional equations

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

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study generating functions for the number of permutations on n letters avoiding 132 and an arbitrary permutation @t on k letters, or containing @t exactly once. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second kind.