Abstract
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 language | English |
|---|---|
| Pages (from-to) | 75-84 |
| Number of pages | 10 |
| Journal | Australasian Journal of Combinatorics |
| Volume | 30 |
| State | Published - 2004 |
| Externally published | Yes |
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics