| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649295 | Discrete Mathematics | 2006 | 9 Pages |
Abstract
We study the generating function for the number of involutions on n letters containing exactly r⩾0r⩾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+22r+2.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Toufik Mansour, Sherry H.F. Yan, Laura L.M. Yang,