Restricted 132-Avoiding Permutations

Toufik Mansour; Alek Vainshtein

doi:10.1006/aama.2000.0719

Restricted 132-Avoiding Permutations

Research output: Contribution to journal › Article › peer-review

Abstract

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

Original language	English
Pages (from-to)	258-269
Number of pages	12
Journal	Advances in Applied Mathematics
Volume	26
Issue number	3
DOIs	https://doi.org/10.1006/aama.2000.0719
State	Published - Apr 2001

ASJC Scopus subject areas

Applied Mathematics

Access to Document

10.1006/aama.2000.0719

Cite this

@article{062582636ead4adeb9ae223a5ebd184e,

title = "Restricted 132-Avoiding Permutations",

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

author = "Toufik Mansour and Alek Vainshtein",

year = "2001",

month = apr,

doi = "10.1006/aama.2000.0719",

language = "English",

volume = "26",

pages = "258--269",

journal = "Advances in Applied Mathematics",

issn = "0196-8858",

publisher = "Academic Press Inc.",

number = "3",

}

TY - JOUR

T1 - Restricted 132-Avoiding Permutations

AU - Mansour, Toufik

AU - Vainshtein, Alek

PY - 2001/4

Y1 - 2001/4

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

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

UR - https://www.scopus.com/pages/publications/0037891640

U2 - 10.1006/aama.2000.0719

DO - 10.1006/aama.2000.0719

M3 - Article

AN - SCOPUS:0037891640

SN - 0196-8858

VL - 26

SP - 258

EP - 269

JO - Advances in Applied Mathematics

JF - Advances in Applied Mathematics

IS - 3

ER -

Restricted 132-Avoiding Permutations

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this