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

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

15 pages, 2 figures

Scientific paper

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

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Products of all elements in a loop and a framework for non-associative analogues of the Hall-Paige conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Products of all elements in a loop and a framework for non-associative analogues of the Hall-Paige conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Products of all elements in a loop and a framework for non-associative analogues of the Hall-Paige conjecture will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-82263

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.