Processing math: 100%
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SEARCH GUIDE  Download Search Tip PDF File

  • articleNo Access

    On commutative A-loops of order PQ

    We study a construction introduced by Drápal, giving rise to commutative A-loops of order kn where k and n are odd numbers. We show which combinations of k and n are possible if the construction is based on a field or on a cyclic group. We conclude that if p and q are odd primes, there exists a non-associative commutative A-loop of order pq if and only if p divides q2 - 1 and such a loop is most probably unique.

  • articleNo Access

    On rings with xnx nilpotent

    For n2 and for a ring R, the notation Pn(R) means that rnr is nilpotent for all rR. In this paper, rings R for which Pn(R) holds are completely characterized for any integers n2. This answers a question which was raised in [T. Kosan, Y. Zhou, T. Yildirim, Rings with xnx nilpotent, J. Algebra Appl.19(4) (2020) 2050065].