Related papers: Subgroups of minimal index in polynomial time

For a wide family of formations $\mathfrak{F}$ it is proved that the $ \mathfrak{F}$-residual of a permutation finite group can be computed in a polynomial time. Moreover, if in the previous case $\mathfrak{F}$ is hereditary, then an…

We construct a polynomial-time algorithm which given a graph $\Gamma$ finds the full set of non-equivalent Cayley representations of $\Gamma$ over the group $D\cong C_p\times C_{p^k}$, where $p\in\{2,3\}$ and $k\geq 1$. This result implies…

Let $H$ be a subgroup of a group $G$. The permutizer $P_G(H)$ is the subgroup generated by all cyclic subgroups of $G$ which permute with $H$. A subgroup $H$ of a group $G$ is strongly permutable in $G$ if $P_U(H)=U$ for every subgroup $U$…

We revisit the problem of deciding whether a finitely generated subgroup H is a free factor of a given free group F. Known algorithms solve this problem in time polynomial in the sum of the lengths of the generators of H and exponential in…

We describe a family of new algorithms for finding the canonical image of a set of points under the action of a permutation group. This family of algorithms makes use of the orbit structure of the group, and a chain of subgroups of the…

We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…

Let $ H $ be a subgroup of a finite group $ G $. We say that $ H $ satisfies the partial $ \mathscr L $-$ \Pi $-property in $ G $ if $ H\unlhd G $, or if $ | G / K : \mathrm{N} _{G / K} (HK/K)| $ is a $ \pi (HK/K) $-number for any $ G…

We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…

When we consider a finite abelian group acting linearly on a polynomial ring, we can find monomial generators for the subring of invariants. By Noether's degree bound and Hilbert's finiteness theorem, we know that there are finitely many…

A graph $G$ contains a graph $H$ as a pivot-minor if $H$ can be obtained from $G$ by applying a sequence of vertex deletions and edge pivots. Pivot-minors play an important role in the study of rank-width. Pivot-minors have mainly been…

The Hidden Subgroup Problem is used in many quantum algorithms such as Simon's algorithm and Shor's factoring and discrete log algorithms. A polynomial time solution is known in case of abelian groups, and normal subgroups of arbitrary…

The rank of a finite algebraic structure with a single binary operation is the minimum number of elements needed to express every other element under the closure of the operation. In the case of groups, the previous best algorithm for…

This paper considers submodular function minimization (SFM) restricted to a family of subsets. We show that SFM over complements of families with certain hierarchical structures can be solved in polynomial-time. This yields a…

We show that the number of $k$-matching in a given undirected graph $G$ is equal to the number of perfect matching of the corresponding graph $G_k$ on an even number of vertices divided by a suitable factor. If $G$ is bipartite then one can…

Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…

We construct a polynomial-time algorithm that given a graph $X$ with $4p$ vertices ($p$ is prime), finds (if any) a Cayley representation of $X$ over the group $C_2\times C_2\times C_p$. This result, together with the known similar result…

Let G be a finite group and {\sigma} = {{\sigma}_i, i \in I} be a partition of the set of all primes \mathbb{P}. A set \mathcal{H} of subgroups of G with 1 \in \mathcal{H} is said to be a complete Hall {\sigma}-set of G if every…

We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup…

For a finite-dimensional representation V of a group G we introduce and study the notion of a Lie element in the group algebra k[G]. The set L(V) \subset k[G] of Lie elements is a Lie algebra and a G-module acting on the original…

We show that for some absolute (explicit) constant $C$, the following holds for every finitely generated group $G$, and all $d >0$: If there is some $ R_0 > \exp(\exp(Cd^C))$ for which the number of elements in a ball of radius $R_0$ in a…