231-Avoiding Involutions and Fibonacci Numbers

Simple item page
dc.creatorEgge, Eric S.
dc.creatorMansour, Toufik
dc.date2002-09-19
dc.date.accessioned2026-07-07T04:51:03Z
dc.date.available2026-07-07T04:51:03Z
dc.descriptionWe 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.
dc.description9 pages
dc.identifierhttps://arxiv.org/abs/math/0209255
dc.identifierhttp://arxiv.org/abs/math/0209255
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/65010
dc.subjectCombinatorics
dc.subject05A15
dc.title231-Avoiding Involutions and Fibonacci Numbers
dc.typetext

Files

Collections

arXiv