231-Avoiding Involutions and Fibonacci Numbers
Combinatorics
2007-05-23 v1
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 -generalized Fibonacci numbers.
Cite
@article{arxiv.math/0209255,
title = {231-Avoiding Involutions and Fibonacci Numbers},
author = {Eric S. Egge and Toufik Mansour},
journal= {arXiv preprint arXiv:math/0209255},
year = {2007}
}
Comments
9 pages