On the isomorphism problem for cyclic combinatorial objects (Q1292864)

As usual, we denote by \(S(X)\) the group of all permutations of a finite set \(X\). By \(\text{Rel}(X)\) we mean the set of all relations over \(X\). The finite subsets of \(\text{Rel}(X)\) are called combinatorial objects over \(X\). We write \((H;X)\) when a subgroup \(H\) of \(S(X)\) is considered as a permutation group of \(X\), and we denote by \(\text{Obj}(H;X)\) the set of all combinatorial objects which are left invariant by \((H;X)\). Let \(S\) be a subset and \(H\) a subgroup of \(S(X)\). \({\mathcal R}\) be an element of \(\text{Obj}(H;X)\). We say that \(S\) is a solving set for \({\mathcal R}\) if the following two assertions are equivalent for any \({\mathcal T}\in \text{Obj}(H;X)\): (i) There is an element of \(S(X)\) which transforms \({\mathcal R}\) into \({\mathcal T}\). (ii) There is an element of \(S\) which transforms \({\mathcal R}\) into \({\mathcal T}\). A partial order \(\prec^{\sqcup}_H\) is introduced (in an appropriate manner) on the set of all permutation groups of \(X\) containing a regular cyclic subgroup \((H;X)\). The main results of the paper are the following assertions. If \((H;X)\) is a regular cyclic group and \({\mathcal R}\in \text{Obj}(H;X)\), then the minimum cardinality of the solving sets for \({\mathcal R}\) is equal to the number of conjugacy classes of \(X\)-cycles in the automorphism group of \({\mathcal R}\), and it does not exceed \(\varphi(|X|)\) (where \(\varphi\) is the Euler function). If \((G;H)\) contains a regular cyclic subgroup \((H;X)\) and \((G;X)\) is \(\prec^{\sqcup}_H\)-minimal, then \(G\) is solvable. A further statement shows that, if the divisibility \(p|q-1\) is false for any choice of two prime divisors \(p\), \(q\) of \(|X|\), then the isomorphism problem for cyclic combinatorial objects may be reduced to the one on prime power numbers of elements. The proofs are involved group-theoretical considerations, using the classification theory of finite simple groups.