Abstract

Automorphic loops are loops in which all inner mappings are automorphisms. This variety of loops includes groups and commutative Moufang loops. A half-isomorphism f:G⟶Kf : G \longrightarrow K between multiplicative systems GG and KK is a bijection from GG onto KK such that f(ab)∈{f(a)f(b),f(b)f(a)}f(ab)\in\{f(a)f(b), f(b)f(a)\} for any a,b∈Ga,b\in G. A half-isomorphism is trivial when it is either an isomorphism or an anti-isomorphism. Consider the class of automorphic loops such that the equation x⋅(x⋅y)=(y⋅x)⋅xx\cdot(x\cdot y) = (y\cdot x)\cdot x is equivalent to x⋅y=y⋅xx\cdot y = y\cdot x. Here we show that this class of loops includes automorphic loops of odd order and uniquely 22-divisible. Furthermore, we prove that every half-isomorphism between loops in that class is trivial.

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.