
TL;DR
This paper introduces and classifies universal Fibonacci sequence groupoids, revealing their structural properties, classification criteria, and relationships with other algebraic structures, both finite and infinite.
Contribution
It provides a comprehensive classification of UFS-groupoids, explores their properties, and constructs explicit examples, advancing understanding of Fibonacci-like sequences in algebraic systems.
Findings
Every nontrivial UFS-groupoid is at most countable and locally cyclic.
UFS-groupoids are closed under subgroupoids and homomorphic images.
Finite UFS-groupoids are characterized via de Bruijn sequences.
Abstract
In a binary groupoid , a Fibonacci sequence is a recurrent sequence defined by . A universal Fibonacci sequence (UFS) is a singly or doubly infinite sequence whose set of suffixes coincides precisely with the set of all Fibonacci sequences in the groupoid. This paper studies UFS-groupoids, i.e., groupoids that admit a universal Fibonacci sequence. It is shown that every nontrivial UFS-groupoid is at most countable, locally cyclic, and non-power-associative; that the right cancellation property and the right quasigroup property hold for all pairs of elements except possibly one and two, respectively; that no neutral element or zero element exists; and that there is at most one idempotent element. It is proved that any UFS-groupoid whose universal Fibonacci sequence is not doubly infinite strictly preperiodic is cyclic. It…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
