Searcharxiv⌕ Search

arXiv · 0706.1481

Weak Inverse Property Loops and Some Isotopy-Isomorphy Properties

Abstract

Two distinct isotopy-isomorphy conditions, different from those of J. M. Osborn and Wilson's condition, for a weak inverse property loop(WIPL) are shown. Only one of them characterizes isotopy-isomorphy in WIPLs while the other is just a sufficient condition for isotopy-isomorphy. Under the sufficient condition called the ${\cal T}$ condition, Artzy's result that isotopic cross inverse property loops(CIPL) are isomorphic is proved for WIP loops.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Temitope Gbolahan Jaiyeola, John Olushola Adeniran. 2007-06-11. Weak Inverse Property Loops and Some Isotopy-Isomorphy Properties. https://arxiv.org/abs/0706.1481

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Left and right zero subsemigroups and an elementary approach to the Rees-Sushkevich Theorem

In a semigroup $S$ with idempotent $e$, the set of all elements $a$ of $S$ such that $ae=a$ and $ea=e$ forms the maximum left zero subsemigroup of $S$ containing $e$, and the set of all elements $b$ of $S$ such that $be=e$ and $eb=b$ forms the maximum right zero subsemigroup of $S$ containing $e$. We use these maximal right and left zero subsemigroups along with the maximal subgroups of a semigroup in the determination of maximal right and left subgroups, rectangular band subsemigroups, completely simple subsemigroups, rectangular subgroups, and completely $0$-simple subsemigroups. An elementary approach of the Rees-Sushkevich Theorem follows. Then we define rectangular $0$-bands and rectangular $0$-groups as completely $0$-simple analogues of rectangular bands and rectangular groups.

math.GR↗

Common overlattices in trees and trees with fins

Bass and Kulkarni proved that any pair of free uniform lattices in the automorphism group of a tree have conjugates that both lie inside a third uniform lattice (which is not necessarily free). We show that this does not generalise to trees with fins. The construction of our counter-example involves working with a certain generalisation of the universal groups of Burger and Mozes.

math.GR↗