Counting occurrences of 231 in an involution

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

Counting occurrences of 231 in an involution

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

Department of Mathematics

Research output: Contribution to conference › Paper › 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	787-795
Number of pages	9
State	Published - 2005
Event	17th Annual International Conference on Algebraic Combinatorics and Formal Power Series, FPSAC'05 - Taormina, Italy Duration: 20 Jun 2005 → 25 Jun 2005

Conference

Conference	17th Annual International Conference on Algebraic Combinatorics and Formal Power Series, FPSAC'05
Country/Territory	Italy
City	Taormina
Period	20/06/05 → 25/06/05

ASJC Scopus subject areas

Algebra and Number Theory

Cite this

@conference{00c8beb24abf415bb940dd318a2e15d2,

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.",

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

year = "2005",

language = "English",

pages = "787--795",

note = "17th Annual International Conference on Algebraic Combinatorics and Formal Power Series, FPSAC'05 ; Conference date: 20-06-2005 Through 25-06-2005",

}

TY - CONF

T1 - Counting occurrences of 231 in an involution

AU - Mansour, Toufik

AU - Yan, Sherry H.F.

AU - Yang, Laura L.M.

PY - 2005

Y1 - 2005

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.

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

M3 - Paper

AN - SCOPUS:84861132311

SP - 787

EP - 795

T2 - 17th Annual International Conference on Algebraic Combinatorics and Formal Power Series, FPSAC'05

Y2 - 20 June 2005 through 25 June 2005

ER -

Counting occurrences of 231 in an involution

Abstract

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this