On the isomorphism problem for cyclic combinatorial objects Original Research Article

We prove that the number of cyclic combinatorial objects on n elements isomorphic to a given one is less than or equal to ϕ(n). We also show that if any two prime divisors p ≠ q of n satisfy the property p∤(q − 1), q∤(p − 1), then the isomorphism problem for cyclic combinatorial objects on n elements may be reduced to the one on prime power number of elements.