231-Avoiding Involutions and Fibonacci Numbers

Autor: Egge, E., Ronit Mansour
Rok vydání: 2002
Předmět:
Zdroj: Scopus-Elsevier
Toufik Mansour
Ronit Mansour
DOI: 10.48550/arxiv.math/0209255
Popis: 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 $k$-generalized Fibonacci numbers.
Comment: 9 pages
Databáze: OpenAIRE