231-avoiding involutions and Fibonacci numbers

Eric S. Egge, Toufik Mansour

Research output: Contribution to journalArticlepeer-review


We use combinatorial and generating function techniques to enumerate various sets of involutions which avoid 231 or contain 231 exactly once. Interestingly, many of these enumerations can be given in terms of kgeneralized Fibonacci numbers.

Original languageEnglish
Pages (from-to)75-84
Number of pages10
JournalAustralasian Journal of Combinatorics
StatePublished - 2004
Externally publishedYes

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics


Dive into the research topics of '231-avoiding involutions and Fibonacci numbers'. Together they form a unique fingerprint.

Cite this