Related papers: Subgroups of minimal index in polynomial time

A subgroup $H$ of a group $G$ is said to be {pronormal} in $G$ if $H$ and $H^g$ are conjugate in $\langle H, H^g \rangle$ for every $g \in G$. Some problems in finite group theory, combinatorics, and permutation group theory were solved in…

We describe an algorithm for computing Schur indices of irreducible characters of a finite group $G$, based on computations within $G$ and its subgroups and with their character tables. The algorithm has been implemented within \Magma\ and…

It is well known that if $G$ is a group and $H$ is a normal subgroup of $G$ of finite index $k$, then $x^k \in H$ for every $x \in G$. We examine finite groups $G$ with the property that $x^k \in H$ for every subgroup $H$ of $G$, where $k$…

Let G=Aut_K (K(x)) be the Galois group of the transcendental degree one pure field extension K(x)/K. In this paper we describe polynomial time algorithms for computing the field Fix(H) fixed by a subgroup H < G and for computing the fixing…

Group theory is a particularly fertile field for the design of practical algorithms. Algorithms have been developed across the various branches of the subject and they find wide application. Because of its relative maturity, computational…

We study definably primitive pseudo-finite permutation groups of finite $SU$-rank. We show that if $(G,X)$ is such a permutation group, then the rank of $G$ can be bounded in terms of the rank of $X$, providing an analogue of a theorem of…

We present a quantum algorithm which identifies with certainty a hidden subgroup of an arbitrary finite group G in only a polynomial (in log |G|) number of calls to the oracle. This is exponentially better than the best classical algorithm.…

In this paper, we finished the classification of three-generator finite $p$-groups $G$ such that $\Phi(G)\le Z(G)$. This paper is a part of classification of finite $p$-groups with a minimal non-abelian subgroup of index $p$, and partly…

We determine minimal Cayley--Hamilton and Capelli identities for matrices over a Grassmann algebra of finite rank. For minimal standard identities, we give lower and upper bounds on the degree. These results improve on upper bounds given by…

We present an algorithm that enumerates all the minimal triangulations of a graph in incremental polynomial time. Consequently, we get an algorithm for enumerating all the proper tree decompositions, in incremental polynomial time, where…

We present a finite algorithm for computing the set of irreducible unitary representations of a real reductive group G. The Langlands classification, as formulated by Knapp and Zuckerman, exhibits any representation with an invariant…

We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in…

Let $H \leq S_n$ be an intransitive group with orbits $\Omega_1, \Omega_2, \ldots ,\Omega_k$. Then certainly $H$ is a subdirect product of the direct product of its projections on each orbit, $H|_{\Omega_1} \times H|_{\Omega_2} \times…

Given a finitely generated subgroup $H$ of a free group $F$, we present an algorithm which computes $g_1,\ldots,g_m\in F$, such that the set of elements $g\in F$, for which there exists a non-trivial $H$-equation having $g$ as a solution,…

This paper presents the novel `uniqueness tree' algorithm, as one possible method for determining whether two finite, undirected graphs are isomorphic. We prove that the algorithm has polynomial time complexity in the worst case, and that…

If $G$ is a group of permutations of a set $\Omega$, then the suborbits of $G$ are the orbits of point-stabilisers $G_\alpha$ acting on $\Omega$. The cardinalities of these suborbits are the subdegrees of $G$. Every infinite primitive…

A subgroup $H$ of a finite group $G$ is said to satisfy $\Pi$-property in $G$ if for every chief factor $L/K$ of $G$, $|G/K:N_{G/K}(HK/K\cap L/K)|$ is a $\pi(HK/K\cap L/K)$-number. A subgroup $H$ of $G$ is called to be $\Pi$-supplemented in…

For any order of growth $f(n)=o(\log n)$ we construct a finitely-generated group $G$ and a set of generators $S$ such that the Cayley graph of $G$ with respect to $S$ supports a harmonic function with growth $f$ but does not support any…

We provide an algorithm that, given a finite set of generators for a subgroup $H$ of a finitely generated free group $F$, determines whether $H$ is echelon or not and, in case of affirmative answer, also computes a basis with respect to…

This paper presents a new anytime algorithm for the marginal MAP problem in graphical models. The algorithm is described in detail, its complexity and convergence rate are studied, and relations to previous theoretical results for the…