Quasigroup Identities and Graph Decompositions
C. C. Lindner, C. A. Rodger · 2017
Let ( Q , ∘ ) $ (Q, \circ) $ https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781315107233/a5ce23da-e0cc-4303-86d9-f05d0d525ce3/content/inline-math3_1.tif"/> be a quasigroup oforder n and define an n 2 × 3 array R by: ( a , b , c ) ∈ R $ (a, b, c) \in R $ https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781315107233/a5ce23da-e0cc-4303-86d9-f05d0d525ce3/content/inline-math3_2.tif"/> if and only if a ∘ b = c $ a \circ b = c $ https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781315107233/a5ce23da-e0cc-4303-86d9-f05d0d525ce3/content/inline-math3_3.tif"/> . Since a ∘ x = b $ a \circ x = b $ https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781315107233/a5ce23da-e0cc-4303-86d9-f05d0d525ce3/content/inline-math3_4.tif"/> and y ∘ a = b $ y \circ a = b $ https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781315107233/a5ce23da-e0cc-4303-86d9-f05d0d525ce3/content/inline-math3_5.tif"/> have unique solutions for all a , b ∊ Q the ordered pair ( a , b ) $ (a, b) $ https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781315107233/a5ce23da-e0cc-4303-86d9-f05d0d525ce3/content/inline-math3_6.tif"/> occurs in the same row of any two columns of R . Put another way, if we run our fingers down any two columns of R we obtain all n 2 ordered pairs ( a , b ) ∈ Q × Q . $ (a, b) \in Q \times Q. $ https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781315107233/a5ce23da-e0cc-4303-86d9-f05d0d525ce3/content/inline-math3_7.tif"/>