Restricted even permutations and Chebyshev polynomials

Toufik Mansour

doi:10.1016/j.disc.2006.03.001

Restricted even permutations and Chebyshev polynomials

Toufik Mansour

Department of Mathematics

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

Abstract

We study generating functions for the number of even (odd) 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)	1161-1176
Number of pages	16
Journal	Discrete Mathematics
Volume	306
Issue number	12
DOIs	https://doi.org/10.1016/j.disc.2006.03.001
State	Published - 28 Jun 2006

Keywords

Chebyshev polynomial
Even/odd permutation
Forbidden subsequence
Pattern-avoiding permutation
Restricted permutation

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2006.03.001

Cite this

@article{4490d21080dc4d0db8e66423512869f6,

title = "Restricted even permutations and Chebyshev polynomials",

abstract = "We study generating functions for the number of even (odd) 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.",

keywords = "Chebyshev polynomial, Even/odd permutation, Forbidden subsequence, Pattern-avoiding permutation, Restricted permutation",

author = "Toufik Mansour",

year = "2006",

month = jun,

day = "28",

doi = "10.1016/j.disc.2006.03.001",

language = "English",

volume = "306",

pages = "1161--1176",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "12",

}

TY - JOUR

T1 - Restricted even permutations and Chebyshev polynomials

AU - Mansour, Toufik

PY - 2006/6/28

Y1 - 2006/6/28

N2 - We study generating functions for the number of even (odd) 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 even (odd) 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.

KW - Chebyshev polynomial

KW - Even/odd permutation

KW - Forbidden subsequence

KW - Pattern-avoiding permutation

KW - Restricted permutation

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

U2 - 10.1016/j.disc.2006.03.001

DO - 10.1016/j.disc.2006.03.001

M3 - Article

AN - SCOPUS:33646858573

SN - 0012-365X

VL - 306

SP - 1161

EP - 1176

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 12

ER -

Restricted even permutations and Chebyshev polynomials

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this