Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Grošek et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: