Counting occurrences of 231 in an involution

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

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Pages (from-to)564-572
Number of pages9
JournalDiscrete Mathematics
Issue number6
StatePublished - 6 Apr 2006


  • Generating functions
  • Restricted involutions
  • Restricted permutations

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Counting occurrences of 231 in an involution'. Together they form a unique fingerprint.

Cite this