On R-sequenceability of odd ordered groups

Abstract

We study the R-sequenceability of finite groups of odd order. Building on the classical theory of R*-sequences and orthomorphisms, we explore two tools: the notion of R**-sequenceability, a strengthening of R*-sequenceability tailored for inductive arguments over normal subgroups with cyclic quotients, and the odd cycle index τ(G), which measures how many orthomorphisms are required to generate a full cycle together with an involution. Our main result is a Quotient-Normal Gadget theorem, which shows that if G has a normal subgroup N such that G/N is R**-sequenceable and τ(N) ≤ |G/N| - 3, then G itself is R**-sequenceable. We prove that τ(G) = 2 for cyclic groups of order coprime with 3, and establish an inductive bound τ(G) ≤ \τ(N), τ(G/N)\ for odd ordered groups with a normal subgroup N. As consequences, we show that every group whose order is coprime with 30 is R-sequenceable, and that every nilpotent group whose order is coprime with 6 and not a power of 5 is R-sequenceable. These results extend prior work on abelian groups to broad families of non-abelian groups.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…