Products of all elements in a loop and a framework for non-associative analogues of the Hall-Paige conjecture

preprint2010arXivOpen access

Abstract

For a finite loop QQ, let P(Q)P (Q) be the set of elements that can be represented as a product containing each element of QQ precisely once. Motivated by the recent proof of the Hall-Paige conjecture, we prove several universal implications between the following conditions: (A) QQ has a complete mapping, i.e. the multiplication table of QQ has a transversal, (B) there is no $N \normal Q$ such that ∣N∣|N| is odd and $Q/N \cong \ZZ_{2^m}$ for m≥1m \geq 1, and (C) P(Q)P(Q) intersects the associator subloop of QQ. We prove (A)  ⟹  (C)(A) \implies (C) and (B)  ⟺  (C)(B) \iff (C) and show that when QQ is a group, these conditions reduce to familiar statements related to the Hall-Paige conjecture (which essentially says that in groups (B)  ⟹  (A))(B) \implies (A)). We also establish properties of P(Q)P(Q), prove a generalization of the Dénes-Hermann theorem, and present an elementary proof of a weak form of the Hall-Paige conjecture.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.