|
This article is cited in 6 scientific papers (total in 6 papers)
Polynomially complete quasigroups of prime order
A. V. Galatenko, A. E. Pankratiev, S. B. Rodin Lomonosov Moscow State University, Leninskie Gory 1, Moscow, 119991 Russia
Abstract:
We formulate a polynomial completeness criterion for quasigroups of prime order, and show that verification of polynomial completeness may require time polynomial in order. The obtained results are generalized to $n$-quasigroups for any $n\ge3$. In conclusion, simple corollaries are given on the share of polynomially complete quasigroups among all quasigroups, and on the cycle structure of row and column permutations in Cayley tables for quasigroups that are not polynomially complete.
Keywords:
quasigroup, Latin square, polynomially complete quasigroup, $n$-quasigroup, permutation.
Received: 05.05.2017
Citation:
A. V. Galatenko, A. E. Pankratiev, S. B. Rodin, “Polynomially complete quasigroups of prime order”, Algebra Logika, 57:5 (2018), 509–521; Algebra and Logic, 57:5 (2018), 327–3335
Linking options:
https://www.mathnet.ru/eng/al863 https://www.mathnet.ru/eng/al/v57/i5/p509
|
Statistics & downloads: |
Abstract page: | 316 | Full-text PDF : | 48 | References: | 51 | First page: | 16 |
|