231-Avoiding Involutions and Fibonacci Numbers
classification
🧮 math.CO
keywords
fibonacciinvolutionsnumbersavoidavoidingcombinatorialcontainenumerate
read the original 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 $k$-generalized Fibonacci numbers.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.