pith. sign in

arxiv: 2604.05754 · v2 · submitted 2026-04-07 · 🧮 math.GR · math.CO· math.RA

Universal Fibonacci sequences and UFS-groupoids

Petr Klimov This is my paper

Pith reviewed 2026-05-10 18:41 UTC · model grok-4.3

classification 🧮 math.GR math.COmath.RA
keywords universal Fibonacci sequenceUFS-groupoidgroupoidde Bruijn sequenceperiodicityclassificationrecurrent sequencebinary operation
0
0 comments X

The pith

Every groupoid that admits a universal Fibonacci sequence is classified by the cardinality of its set and the periodicity of that sequence.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper defines UFS-groupoids as binary groupoids that possess a universal Fibonacci sequence whose suffixes exactly match all possible Fibonacci sequences generated by the groupoid operation from any pair of elements. It proves these structures must be at most countable and locally cyclic, obey nearly full right cancellation and right quasigroup properties, and lack neutral or zero elements while having at most one idempotent. The work gives a complete classification according to set size and sequence periodicity, describes finite cases combinatorially via de Bruijn sequences, determines their exact numbers, and supplies explicit constructions for finite and infinite examples in every periodicity class along with embedding results. A sympathetic reader cares because the classification ties recurrent sequence generation directly to algebraic structure in a way that makes all such groupoids explicitly constructible.

Core claim

In a groupoid (G, *), a universal Fibonacci sequence is a (singly or doubly infinite) sequence whose set of suffixes coincides precisely with the set of all Fibonacci sequences defined by f1 = a, f2 = b, and fn = f_{n-2} * f_{n-1} for arbitrary a, b in G. The paper proves every nontrivial UFS-groupoid is at most countable, locally cyclic, and non-power-associative; satisfies right cancellation except possibly for one pair and right quasigroup except possibly for two pairs; has no neutral or zero element and at most one idempotent; and is cyclic whenever its universal Fibonacci sequence is not doubly infinite and strictly preperiodic. The class is closed under subgroupoids and homomorphic but

What carries the argument

The universal Fibonacci sequence, a sequence whose suffixes coincide exactly with all Fibonacci sequences generated by the groupoid operation from every pair of elements.

If this is right

  • Every nontrivial UFS-groupoid is at most countable and locally cyclic.
  • Right cancellation holds for all pairs except at most one, and the right quasigroup property holds for all pairs except at most two.
  • No neutral element or zero element exists, and there is at most one idempotent element.
  • Finite UFS-groupoids correspond combinatorially to de Bruijn sequences, and the number of distinct ones on any finite set is determined for each cardinality.
  • The class is closed under taking subgroupoids and homomorphic images, with explicit embeddings and infinitely generated examples available in every periodicity class.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The periodicity-based classification may extend to other linear recurrences, yielding analogous complete descriptions for broader families of algebraic structures generated by recurrent sequences.
  • The de Bruijn sequence description of finite cases suggests direct links to combinatorial word problems and shift spaces that could be studied by varying the underlying alphabet size.
  • Local cyclicity implies every element can be reached by iterating the operation on a fixed pair, which may allow algorithmic generation of all elements from a small seed set.

Load-bearing premise

That a nontrivial groupoid admits a universal Fibonacci sequence whose suffixes coincide precisely with every possible Fibonacci sequence generated by its binary operation.

What would settle it

The construction of an uncountable groupoid possessing a universal Fibonacci sequence, or of a finite groupoid whose generated Fibonacci sequences cannot be represented by any de Bruijn sequence of the appropriate period.

read the original abstract

In a binary groupoid $(G, *)$, a Fibonacci sequence is a recurrent sequence defined by $f_1 = a, f_2 = b, \ldots, f_n = f_{n - 2} * f_{n - 1}$. 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 has also been proved that the class of UFS-groupoids is closed under taking subgroupoids and homomorphic images, but is not closed under finite direct products. The structure of subgroupoids of UFS-groupoids is described. A complete classification of UFS-groupoids is given in terms of the cardinality of $G$ and the periodicity of the universal Fibonacci sequences. Finite UFS-groupoids are described combinatorially via de Bruijn sequences. The number of distinct UFS-groupoids on a finite set is determined, and explicit constructions are provided for both finite and infinite cases across all periodicity classes, including embeddings of UFS-groupoids as subgroupoids into other UFS-groupoids and infinitely generated UFS-groupoids.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The paper defines a universal Fibonacci sequence (UFS) in a binary groupoid (G, *) as a singly or doubly infinite sequence whose suffixes coincide exactly with all Fibonacci sequences generated by the operation. It studies UFS-groupoids (those admitting a UFS), proving that every nontrivial example is at most countable, locally cyclic, and non-power-associative; that right cancellation and right quasigroup properties hold except for at most one or two pairs; that there is no neutral or zero element and at most one idempotent; and that any UFS-groupoid with a non-doubly-infinite strictly preperiodic UFS is cyclic. The class is closed under subgroupoids and homomorphic images but not under direct products. A complete classification is given by |G| and the periodicity type of the UFS; finite cases are described combinatorially via de Bruijn sequences; the number of distinct finite UFS-groupoids is determined; and explicit constructions (including embeddings and infinitely generated examples) are supplied for all periodicity classes.

Significance. If the central claims hold, the work introduces a new, well-behaved class of groupoids tied to recurrent sequences and supplies a full classification together with combinatorial realizations via de Bruijn sequences. The self-contained proofs of countability (every element appears in the UFS), local cyclicity, and the listed algebraic properties, together with the explicit constructions across finite and infinite cases, constitute concrete strengths that make the results usable for further study in combinatorial algebra and groupoid theory.

minor comments (3)
  1. [Abstract] The abstract invokes 'strictly preperiodic' without a one-sentence gloss; a brief parenthetical definition would help readers who encounter the term for the first time.
  2. Notation for singly versus doubly infinite sequences is introduced but not uniformly referenced in later statements of periodicity classes; a short table or consistent subscript convention would improve readability.
  3. The combinatorial description of finite UFS-groupoids via de Bruijn sequences is stated clearly, yet the precise mapping from de Bruijn sequence to the groupoid operation table is not exhibited in a small example; adding one concrete 3- or 4-element table would make the correspondence immediate.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of our manuscript, the accurate summary of its main results, and the recommendation for minor revision. No specific major comments or points requiring clarification were provided in the report.

Circularity Check

0 steps flagged

No significant circularity; derivations follow directly from definitions

full rationale

The paper defines a universal Fibonacci sequence (UFS) as a sequence whose suffixes coincide exactly with all Fibonacci sequences generated by the groupoid operation, then defines UFS-groupoids as those admitting such a sequence. All claimed properties (countability, local cyclicity, cancellation laws, absence of neutral/zero elements, at most one idempotent, cyclicity when not doubly infinite strictly preperiodic, closure under subgroupoids and homomorphic images) are derived step-by-step from this definition together with the binary operation axioms. The classification by cardinality and periodicity, the combinatorial description of finite cases via de Bruijn sequences, and the explicit constructions for each class are obtained by enumerating possible periodicities and verifying the suffix-matching condition; no parameter is fitted and then relabeled as a prediction, no self-citation chain is invoked as a uniqueness theorem, and no ansatz is smuggled in. The argument is therefore self-contained against the given definitions and does not reduce any result to its own inputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The paper builds on standard algebraic definitions with the novel UFS concept as the key addition; no free parameters or fitted values are involved as this is a classification theorem in pure mathematics.

axioms (2)
  • standard math Binary groupoids are sets equipped with a binary operation.
    Fundamental definition used to define Fibonacci sequences.
  • domain assumption Fibonacci sequences are defined recursively by f_n = f_{n-2} * f_{n-1}.
    Standard recurrence adapted to the groupoid operation.
invented entities (1)
  • Universal Fibonacci sequence no independent evidence
    purpose: A sequence whose set of suffixes coincides with all Fibonacci sequences in the groupoid.
    Central new concept introduced to define the class of UFS-groupoids.

pith-pipeline@v0.9.0 · 5608 in / 1330 out tokens · 54602 ms · 2026-05-10T18:41:03.588817+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

28 extracted references · 28 canonical work pages

  1. [1]

    D. Wall. Fibonacci series modulo m.The American Mathematical Monthly, 67(6):525–532, 1960

    work page 1960

  2. [2]

    Fulton, W

    J. Fulton, W. Morris. On arithmetical functions related to the Fibonacci numbers.Acta Arithmetica, 16:105–110, 1969

    work page 1969

  3. [3]

    S. Knox. Fibonacci sequences in finite groups.The Fibonacci Quarterly, 30(2):116–120, 1992

    work page 1992

  4. [4]

    ¨Ozkan, H

    E. ¨Ozkan, H. Aydın, R. Dikici. Applications of Fibonacci sequences in a finite nilpotent group.Applied mathematics and computation, 141(2-3):565–578, 2003

    work page 2003

  5. [5]

    Dikici, G

    R. Dikici, G. Smith. Recurrences in finite groups.Turkish J. Math, 19(3):321–329, 1995. 48

    work page 1995

  6. [6]

    H. Wilcox. Fibonacci sequences of period n in groups.The Fibonacci Quarterly, 24(4):356– 361, 1986

    work page 1986

  7. [7]

    Dikici, E.¨Ozkan

    R. Dikici, E.¨Ozkan. An application of Fibonacci sequences in groups.Applied Mathematics and Computation, 136(2-3):323–331, 2003

    work page 2003

  8. [8]

    Karaduman, U

    E. Karaduman, U. Yavuz. On the period of Fibonacci sequences in nilpotent groups.Applied mathematics and computation, 142(2-3):321–332, 2003

    work page 2003

  9. [9]

    Ak¨ uz¨ um,¨O

    Y. Ak¨ uz¨ um,¨O. Deveci. The Hadamard-type k-step Fibonacci sequences in groups.Com- munications in Algebra, 48(7):2844–2856, 2020

    work page 2020

  10. [10]

    Couselo, S

    E. Couselo, S. Gonzales, V. Markov, A. Nechaev. Recursive MDS-codes and recursive differentiable quasigroups.Discrete Math. Appl., 8(3):217–246, 1998

    work page 1998

  11. [11]

    Couselo, S

    E. Couselo, S. Gonzales, V. Markov, A. Nechaev. Parameters of recursive MDS-codes. Discrete Math. Appl., 10(5):433–454, 2000

    work page 2000

  12. [12]

    Markov, A

    V. Markov, A. Nechaev, S. Skazhenik, E. Tveritinov. Pseudogeometries with clusters and an example of a recursive[4,2,3]42-code.J Math Sci, 163:563–571, 2009

    work page 2009

  13. [13]

    Monsef, H

    M. Monsef, H. Doostie. Classes of non-commutative semigroups with finite Fibonacci in- variants.Tbilisi Mathematical Journal, 13(3):153–159, 2020

    work page 2020

  14. [14]

    J. Han, H. Kim, J. Neggers. Fibonacci sequences in groupoids.Advances in Difference Equations, 2012(1):19, 2012

    work page 2012

  15. [15]

    Jeˇ zek, V

    J. Jeˇ zek, V. Kala, T. Kepka. Finitely generated algebraic structures with various divisibility conditions.Forum Mathematicum, 24(2):379–397, 2012

    work page 2012

  16. [16]

    Vinberg.A course in algebra

    E. Vinberg.A course in algebra. American Mathematical Soc., 2003

    work page 2003

  17. [17]

    Para-associativegroupoids.Quasigroups and Related Systems, 24(2):187–194, 2010

    D.Pushkashu. Para-associativegroupoids.Quasigroups and Related Systems, 24(2):187–194, 2010

    work page 2010

  18. [18]

    A. Albert. Quasigroups. I.Transactions of the American Mathematical Society, 54(3):507– 519, 1943

    work page 1943

  19. [19]

    Clifford, G

    A. Clifford, G. Preston. The algebraic theory of semigroups, vol. 1.American Mathematical Society, Providence, 2(7), 1961

    work page 1961

  20. [20]

    Birkhoff

    G. Birkhoff. On the Structure of Abstract Algebras.Mathematical Proceedings of the Cambridge Philosophical Society, 31(4):433–454, October 1935

    work page 1935

  21. [21]

    de Bruijn

    N. de Bruijn. A combinatorial problem.Proc. Koninklijke Nederlandse Akademie V. Weten- schappen, 49(7):758–764, 1946

    work page 1946

  22. [22]

    de Bruijn, T

    N. de Bruijn, T. van Aardenne-Ehrenfest. Circuits and trees in oriented linear graphs.Simon Stevin, 28:203–217, 1951

    work page 1951

  23. [23]

    Campbell, H

    C. Campbell, H. Doostie, E. Robertson. Fibonacci length of generating pairs in groups. InApplications of Fibonacci Numbers: Volume 3 Proceedings of ‘The Third International Conference on Fibonacci Numbers and Their Applications’, Pisa, Italy, July 25–29, 1988, pages 27–35. Springer, 1990. 49

    work page 1988

  24. [24]

    Doostie, M

    H. Doostie, M. Maghasedi. Fibonacci length of direct products of groups.Vietnam Journal of Mathematics, 33(2):189, 2005

    work page 2005

  25. [25]

    D. Johnson. Fibonacci sequences in groups.Irish Math. Soc. Bull, 56:81–85, 2005

    work page 2005

  26. [26]

    Climescu

    A. Climescu. ´Etudes sur la th´ eorie des systemes multiplicatifs uniformes i. l’indice de non- associativit´ e.Bull.´Ecole Polytech. Jassy, 2:347–371, 1947

    work page 1947

  27. [27]

    Dr´ apal, T

    A. Dr´ apal, T. Kepka. Sets of associative triples.European Journal of Combinatorics, 6(3):227–231, 1985

    work page 1985

  28. [28]

    Kepka, M

    T. Kepka, M. Trch. Groupoids and the associative law I. (Associative triples).Acta Uni- versitatis Carolinae. Mathematica et Physica, 033(1):69–86, 1992. 50

    work page 1992