Skip to main content
Have a personal or library account? Click to login
Three Remarks on Groupoids with Prescribed Number of Associative Triples Cover

Three Remarks on Groupoids with Prescribed Number of Associative Triples

Open Access
|Nov 2026
Read online

Abstract

In this work, based on the results of A. C. Climescu: Études sur la théorie des systémes multiplicatifs uniformes I. L’indice de non-associativité, we construct an algorithm for generating a finite groupoid with the required number of elements and associative triples. This algorithm is practically limited only by the set of available symbols (alphabet) of groupoids. It can be randomized by finding new (random) examples of groupoids with a prescribed number of associative triples for n = 3, 4, 5, which is an easy task for a computer.

We also investigate associativity classes of a groupoid with exactly i associative triples and present a new two-parameter form for the symbol-frequency table on an associativity class. Finally, we present a hypothesis that could give a new proof of the Climescu Theorem for n ≥ 4.

DOI: https://doi.org/10.2478/tmmp-2026-0017 | Journal eISSN: 1338-9750 (formerly 1210-3195) | Journal ISSN: 1210-3195
Language: English
Submitted on: Aug 28, 2025
Accepted on: Sep 1, 2026
Published on: Nov 19, 2026
Published by: Slovak Academy of Sciences, Mathematical Institute
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year
MSC:

© 2026 Otokar Grošek, Marián Kňazovický, published by Slovak Academy of Sciences, Mathematical Institute
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.