Fibonacci sequences in groupoids

dc.contributor.author	Han, Jeong Soon
dc.contributor.author	Kim, Hee Sik
dc.contributor.author	Neggers, Joseph
dc.contributor.other	Hanyang University
dc.contributor.other	University of Alabama Tuscaloosa
dc.date.accessioned	2021-07-13T14:30:42Z
dc.date.available	2021-07-13T14:30:42Z
dc.date.issued	2012
dc.description.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. 2000 Mathematics Subject Classification: 20N02; 11B39.	en_US
dc.format.mimetype	application/pdf
dc.identifier.citation	Han, J., Kim, H., Neggers, J. (2012): Fibonacci Sequences in Groupoids. Advances in Difference Equations. Volume 19.
dc.identifier.doi	10.1186/1687-1847-2012-19
dc.identifier.uri	http://ir.ua.edu/handle/123456789/7976
dc.language	English
dc.language.iso	en_US
dc.publisher	Springer
dc.rights.uri	https://creativecommons.org/licenses/by/2.0
dc.subject	fibonacci sequences
dc.subject	groupoid
dc.subject	flexible
dc.subject	wrapped around
dc.subject	Mathematics, Applied
dc.subject	Mathematics
dc.title	Fibonacci sequences in groupoids	en_US
dc.type	text
dc.type	Article