Related papers: Subgroups of minimal index in polynomial time

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

Let $G =<S>$ be a solvable permutation group of the symmetric group $S_n$ given as input by the generating set $S$. We give a deterministic polynomial-time algorithm that computes an \emph{expanding generating set} of size $\tilde{O}(n^2)$…

For a proper, cocompact action by a locally compact group of the form $H \times G$, with $H$ compact, we define an $H \times G$-equivariant index of $H$-transversally elliptic operators, which takes values in $KK_*(C^*H, C^*G)$. This…

Although $S_\infty$ (the group of all permutations of $\mathbb{N}$) is size continuum, both it and its closed subgroups can be presented as the set of paths through a countable tree. The subgroups of $S_\infty$ that can be presented this…

Given a subgroup H of a finite group G, we begin a systematic study of the partial representations of G that restrict to global representations of H. After adapting several results from [DEP00] (which correspond to the case where H is…

We prove that the polynomial invariants of a permutation group are Cohen-Macaulay for any choice of coefficient field if and only if the group is generated by transpositions, double transpositions, and 3-cycles. This unites and generalizes…

The smallness is proved of fundamental groups for arithmetic schemes. This is a higher dimensional analogue of the Hermite-Minkowski theorem. We also refer to the case of varieties over finite fields. As an application, we prove certain…

We present an algorithm which decides whether a given quasiconvex residually finite subgroup $H$ of a hyperbolic group $G$ is associated with a splitting. The methods developed also provide algorithms for computing the number of filtered…

We present the ideas behind an algorithm to compute normalizers of primitive groups with non-regular socle in polynomial time. We highlight a concept we developed called permutation morphisms and present timings for a partial implementation…

We give an algorithm to determine finitely many generators for a subgroup of finite index in the unit group of an integral group ring $\mathbb{Z} G$ of a finite nilpotent group $G$, this provided the rational group algebra $\mathbb{Q} G$…

Recent work has shown that not only decision trees (DTs) may not be interpretable but also proposed a polynomial-time algorithm for computing one PI-explanation of a DT. This paper shows that for a wide range of classifiers, globally…

Let G be a group and H be a subgroup of G which is either finite or of finite index in G. In this note, we give some characterizations for normality of H in G. As a consequence we get a very short and elementary proof of the Main Theorem of…

In this paper we develop techniques that eliminate the need of the Generalized Riemann Hypothesis (GRH) from various (almost all) known results about deterministic polynomial factoring over finite fields. Our main result shows that given a…

The so--called subgroup commutativity degree $sd(G)$ of a finite group $G$ is the number of permuting subgroups $(H,K) \in \mathrm{L}(G) \times \mathrm{L}(G)$, where $\mathrm{L}(G)$ is the subgroup lattice of $G$, divided by…

Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…

Let $ H $ be a subgroup of a finite group $ G $. We say that $ H $ satisfies the partial $ \Pi $-property in $ G $ if there exists a $G$-chief series $ \varGamma_{G}: 1 =G_{0} < G_{1} < \cdot\cdot\cdot < G_{n}= G $ of $ G $ such that $ | G…

We define the notion of the partial order of ends of the Cayley graph of a semigroup. We prove that the structure of the ends of a semigroup is invariant under change of finite generating set and at the same time is inherited by…

This version is similar to math.CO/0210113. We've changed Conjectures 1.1 and 1.2 so that they cover arbitrary graphs(digraphs). Let G be an arbitrary graph(digraph). Then - in polynomial time - either an algorithm obtains a hamilton…

We present a method to compute finite index subgroups of $PSL_2(\mathbb{Z})$. Our strategy follows Kulkarni's ideas, the main contribution being a recursive method to compute bivalent trees and their automorphism group. As a concrete…

Given a finite Markov chain, we investigate the first minors of the transition matrix of a lifting of this Markov chain to covering trees. In a simple case we exhibit a nice factorisation of these minors, and we conjecture that it holds…