Fibonacci sequences in groupoids

Abstract

In this article, we consider several properties of Fibonacci sequences in arbitrary groupoids (i.e., binary systems). Such sequences can be defined in a left-hand way and a right-hand way. Thus, it becomes a question of interest to decide when these two ways are equivalent, i.e., when they produce the same sequence for the same inputs. The problem has a simple solution when the groupoid is flexible. The Fibonacci sequences for several groupoids and for the class of groups as special cases are also discussed.