A combinatorial classification of finite quasigroups (Q2011343)

In this paper, the author studies finite groupoids. He introduces for groupoids with right cancellation the concepts of a bicycle, bicyclic decomposition of a groupoid etc. By Theorem 1 (isomorphism criterion), the author gives an effective method for studying groupoids with right cancellation, in particular quasigroupoids, in solving the three problems: 1) Checking the existence of an isomorphism between two given groupoids; 2) Finding the automorphism group of a given groupoid; 3) Listing all subgroupoids of a given groupoid. Next, the author presents a combinatorial structurization of a set of \(n\)-element quasigroups based on their bicycle decompositions. In Section 2, the author studies the problem of establishing isomorphism between groupoids with right cancellation. In Section 3, he studies the problem of finding automorphism group of a groupoid with right cancellation. In Section 4, the author studies the problem of finding subgroupoids of a groupoid with right cancellation. In this case, he uses Lemma 4, and its corollaries. In Section 5, he studies algorithmic complexity of problem solutions with use of bicycles. In Section 6, he studies the square of a bicycle. In the last section, the author addresses bicyclic classification of quasigroups.