Three Remarks on Groupoids with Prescribed Number of Associative Triples

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.

Authors

Institutions

Publication Details

Journal
Tatra Mountains Mathematical Publications
Published
2026-11-19
DOI
https://doi.org/10.2478/tmmp-2026-0017
Primary Topic
Mathematics and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Three Remarks on Groupoids with Prescribed Number of Associative Triples

Otokar Grošek, Marián Kňazovický
Tatra Mountains Mathematical Publications
Mathematics and Applications
article

Three Remarks on Groupoids with Prescribed Number of Associative Triples

Otokar Grošek, Marián Kňazovický
article en

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.

Tatra Mountains Mathematical Publications
Slovak University of Technology in Bratislava (SK), Slovak Academy of Sciences (SK)
Mathematics and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon