Related papers: Subgroups of minimal index in polynomial time

Let $H, K$ be subgroups of the permutation group $G$ of degree $n$ with $K\trianglelefteq G$ and $\sigma$ be a partition of the set of all different prime divisors of $|G/K|$. We prove that in polynomial time (in $n$) one can check $G/K$…

For a finite group $G$, the size of a minimum generating set of $G$ is denoted by $d(G)$. Given a finite group $G$ and an integer $k$, deciding if $d(G)\leq k$ is known as the minimum generating set (MIN-GEN) problem. A group $G$ of order…

The spectrum $\omega(G)$ of a finite group $G$ is the set of orders of elements of $G$. We present a polynomial-time algorithm that, given a finite set $\mathcal M$ of positive integers, outputs either an empty set or a finite simple group…

The group isomorphism problem asks whether two finite groups given by their Cayley tables are isomorphic or not. Although there are polynomial-time algorithms for some specific group classes, the best known algorithm for testing isomorphism…

Let $A$ and $G$ be finite groups such that $A$ acts coprimely on $G$ by automorphisms, we first prove some results on the solvability of finite groups in which some maximal $A$-invariant subgroups have indices a prime or the square of a…

In this paper we study the realizability question for commuting graphs of finite groups: Given an undirected graph $X$ is it the commuting graph of a group $G$? And if so, to determine such a group. We seek efficient algorithms for this…

The min-rank of a graph was introduced by Haemers (1978) to bound the Shannon capacity of a graph. This parameter of a graph has recently gained much more attention from the research community after the work of Bar-Yossef et al. (2006). In…

A polynomial-time algorithm is produced which, given generators for a group of permutations on a finite set, returns a direct product decomposition of the group into directly indecomposable subgroups. The process uses bilinear maps and…

We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group…

Motivated by the need for efficient isomorphism tests for finite groups, we present a polynomial-time method for deciding isomorphism within a class of groups that is well-suited to studying local properties of general finite groups. We…

Let $\sigma =\{\sigma_{i} | i\in I\}$ be a partition of the set of all primes $\Bbb{P}$ and $G$ a finite group. A set ${\cal H}$ of subgroups of $G$ is said to be a \emph{complete Hall $\sigma $-set} of $G$ if every member $\ne 1$ of ${\cal…

We give new polynomial-time algorithms for testing isomorphism of a class of groups given by multiplication tables (GpI). Two results (Cannon & Holt, J. Symb. Comput. 2003; Babai, Codenotti & Qiao, ICALP 2012) imply that GpI reduces to the…

In this paper we prove that any finite group of order $n$ can be viewed as the group of the solutions of a certain matrix equation $XB=BY$, where the unknowns $X,Y$ are two permutation matrices of order $n$ and $(1+k)n+2 $ respectively and…

We describe an algorithm that computes the index of a finitely generated subgroup in a finitely $L$-presented group provided that this index is finite. This algorithm shows that the subgroup membership problem for finite index subgroups in…

Suppose that $G$ is a finite group and $H$ is a subgroup of $G$. We say that $H$ is s-semipermutable in $G$ if $HG_p = G_pH$ for any Sylow $p$-subgroup $G_p$ of $G$ with $(p, |H|) = 1$. We investigate the influence of s-semipermutable…

A complete mapping of a group $G$ is a permutation $\phi:G\rightarrow G$ such that $g\mapsto g\phi(g)$ is also a permutation. Complete mappings of $G$ are equivalent to tranversals of the Cayley table of $G$, considered as a latin square.…

It is shown that a flat subgroup, $H$, of the totally disconnected, locally compact group $G$ decomposes into a finite number of subsemigroups on which the scale function is multiplicative. The image, $P$, of a multiplicative semigroup in…

In this paper we formulate and study the problem of representing groups on graphs. We show that with respect to polynomial time turing reducibility, both abelian and solvable group representability are all equivalent to graph isomorphism,…

A subgroup $H$ of a finite group $G$ is submodular in $G$ if there is a subgroup chain $H=H_0\leq\ldots\leq H_i\leq H_{i+1}\leq \ldots \leq H_n=G$ such that $H_i$ is a modular subgroup of $H_{i+1}$ for every $i$. We investigate finite…

In this paper, we study the problems of abelian group isomorphism and basis construction in two models. In the {\it partially specified model} (PS-model), the algorithm does not know the group size but can access randomly chosen elements of…