The four-cycle conjecture for the abelian loop

Let SS be the abelian loop of odd numbers used in the paper, with binary operation \bullet. Consider quartets (a,b,c,d)(a,b,c,d) of distinct numbers in SS satisfying

ab=bc=cd=da.a \bullet b=b \bullet c=c \bullet d=d \bullet a.

Four-cycle conjecture. There are infinitely many such quartets.

This conjecture concerns four-cycles in the operation table of the loop. The supplied text does not provide evidence resolving it, so its status remains open.

Sources & referencesView supporting material

Primary source

Raghavendra N. Bhat, “An Abelian Loop for Non-Composites”, arXiv:2110.14716 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.