Counting occurrences of 231 in an involution

Toufik Mansour; Sherry H.F. Yan; Laura L.M. Yang

doi:10.1016/j.disc.2006.01.011

Counting occurrences of 231 in an involution

Toufik Mansour, Sherry H.F. Yan, Laura L.M. Yang

Department of Mathematics

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

Abstract

We study the generating function for the number of involutions on n letters containing exactly r≥0 occurrences of 231. It is shown that finding this function for a given r amounts to a routine check of all involutions of length at most 2r+2.

Original language	English
Pages (from-to)	564-572
Number of pages	9
Journal	Discrete Mathematics
Volume	306
Issue number	6
DOIs	https://doi.org/10.1016/j.disc.2006.01.011
State	Published - 6 Apr 2006

Keywords

Generating functions
Restricted involutions
Restricted permutations

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2006.01.011

Cite this

@article{314cc068fe814feea53e5ff9583d182a,

title = "Counting occurrences of 231 in an involution",

abstract = "We study the generating function for the number of involutions on n letters containing exactly r≥0 occurrences of 231. It is shown that finding this function for a given r amounts to a routine check of all involutions of length at most 2r+2.",

keywords = "Generating functions, Restricted involutions, Restricted permutations",

author = "Toufik Mansour and Yan, {Sherry H.F.} and Yang, {Laura L.M.}",

year = "2006",

month = apr,

day = "6",

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

language = "English",

volume = "306",

pages = "564--572",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "6",

}

TY - JOUR

T1 - Counting occurrences of 231 in an involution

AU - Mansour, Toufik

AU - Yan, Sherry H.F.

AU - Yang, Laura L.M.

PY - 2006/4/6

Y1 - 2006/4/6

N2 - We study the generating function for the number of involutions on n letters containing exactly r≥0 occurrences of 231. It is shown that finding this function for a given r amounts to a routine check of all involutions of length at most 2r+2.

AB - We study the generating function for the number of involutions on n letters containing exactly r≥0 occurrences of 231. It is shown that finding this function for a given r amounts to a routine check of all involutions of length at most 2r+2.

KW - Generating functions

KW - Restricted involutions

KW - Restricted permutations

UR - http://www.scopus.com/inward/record.url?scp=33645387487&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2006.01.011

DO - 10.1016/j.disc.2006.01.011

M3 - Article

AN - SCOPUS:33645387487

SN - 0012-365X

VL - 306

SP - 564

EP - 572

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 6

ER -

Counting occurrences of 231 in an involution

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this