Strong polynomial completeness of almost all quasigroups

DOI10.1134/S0001434622010023MaRDI QIDQ2113390zbMATH OpenFDO

Authors Aleksey V. Galatenko, Vladimir V. Galatenko, Anton E. Pankratiev

Publication date 14 March 2022

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0001434622010023

zbMATH Keywords

affinityisotopypolynomial completenessquasigroupsimplicity

Mathematics Subject Classification ID

Loops, quasigroups (20N05)

Cites work

• Almost all quasigroups have rank 2
• An assertion concerning functionally complete algebras and NP-completeness
• Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations
• Generating uniformly distributed random latin squares
• scientific article; zbMATH DE number 3183036 (Why is no real title available?)
• scientific article; zbMATH DE number 3775602 (Why is no real title available?)
• scientific article; zbMATH DE number 50278 (Why is no real title available?)
• scientific article; zbMATH DE number 3595447 (Why is no real title available?)
• scientific article; zbMATH DE number 6761101 (Why is no real title available?)
• scientific article; zbMATH DE number 3340244 (Why is no real title available?)
• Polynomially complete quasigroups of prime order
• The complexity of checking the polynomial completeness of finite quasigroups

Cited in

(4)

• Quasigroups generated by shift registers and Feistel networks
• The school of V. B. Kudryavtsev at the chair of mathematical theory of intelligent systems: traditions and development
• Polynomial completeness and completeness of finite n-quasigroups
• Polynomial completeness and strong non-affinity of almost all n-quasigroups

This page was built for publication: Strong polynomial completeness of almost all quasigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113390)