Abstract
A quasigroup is an ordered pair (Q, •), where Q is a set and (•) is a binary operation on Q such that the equations ax — b and ya — b are uniquely solvable for every pair of elements a,b in Q. It is well-known (see, for example, [11]) that the multiplication table of a quasigroup defines a Latinsquare, that is, a Latin square can be viewed as the multiplication table of a quasigroup with the headline and sideline removed. We are concerned mainly with finite quasigroups in this paper. A quasigroup (Q, •) is called idempotent if the identity x2 = x holds for all x in Q.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
