Related papers: An L2-quotient algorithm for finitely presented gr…

In the first section of this senior thesis the author provides some new efficient algorithms for calculating with finite permutation groups. They cannot be found in the computer algebra system MAGMA, but they can be implemented there. For…

The general structure of the Sp(2) covariant version of the field-antifield quantization of general constrained systems in the Lagrangian formalism, the so called triplectic quantization, as presented in our previous paper with…

We propose an algorithm which for any recursive group $G$, given by its effectively enumerable generators and recursively enumerable relations, outputs an explicit embedding of $G$ into a finitely presented group directly written by its…

Using the theory of representations of the symmetric group, we propose an algorithm to compute the invariant ring of a permutation group. Our approach have the goal to reduce the amount of linear algebra computations and exploit a thinner…

The conjugacy problem for a finitely generated group $G$ is the two-variable problem of deciding for an arbitrary pair $(u,v)$ of elements of $G$, whether or not $u$ is conjugate to $v$ in $G$. We construct examples of finitely generated,…

We exhibit an algorithm to compute a Dirichlet domain for a cofinite Fuchsian group Gamma. As a consequence, we compute the invariants of Gamma, including an explicit finite presentation for Gamma.

We obtain a classification of the finite two-generated cyclic-by-abelian groups of prime-power order. For that we associate to each such group $G$ a list $\inv(G)$ of numerical group invariants which determines the isomorphism type of $G$.…

We compute the Grothendieck group of certain 2-Calabi--Yau triangulated categories appearing naturally in the study of the link between quiver representations and Fomin--Zelevinsky's cluster algebras. In this setup, we also prove a…

This work establishes a new probabilistic bound on the number of elements to generate finite nilpotent groups. Let $\varphi_k(G)$ denote the probability that $k$ random elements generate a finite nilpotent group $G$. For any $0 < \epsilon <…

We present a general diagrammatic approach to the construction of efficient algorithms for computing the Fourier transform of a function on a finite group. By extending work which connects Bratteli diagrams to the construction of Fast…

We give a complete classification of finitely generated virtually free groups up to $\forall\exists$-elementary equivalence. As a corollary, we give an algorithm that takes as input two finite presentations of virtually free groups, and…

A generalization of recent group-theoretic matrix multiplication algorithms to an analogue of the theory of partial matrix multiplication is presented. We demonstrate that the added flexibility of this approach can in some cases improve…

We address the question: for which collections of finite simple groups does there exist an algorithm that determines the images of an arbitrary finitely presented group that lie in the collection? We prove both positive and negative…

A positive integer $m$ will be called a {\it finitistic order} for an element $\gamma$ of a group $\Gamma$ if there exist a finite group $G$ and a homomorphism $h:\Gamma\to G$ such that $h(\gamma)$ has order $m$ in $G$. It is shown that up…

Previous formulations of group theory in ACL2 and Nqthm, based on either "encapsulate" or "defn-sk", have been limited by their failure to provide a path to proof by induction on the order of a group, which is required for most interesting…

It is proved that the assembly map in algebraic K- and L-theory with respect to the family of finite subgroups is injective for groups $\Gamma$ with finite quotient finite decomposition complexity (a strengthening of finite decomposition…

Let $\C(\Gamma)$ be the set of isomorphism classes of the finite groups that are homomorphic images of $\Gamma$. We investigate the extent to which $\C(\Gamma)$ determines $\Gamma$ when $\Gamma$ is a group of geometric interest. If…

We construct examples of finitely generated decidable group presentations that satisfy certain combinations of solvability for the word problem, solvability for the bounded word problem, and computablity for the Dehn function. We prove that…

In this article we give the details of an effective point counting algorithm for genus two curves over finite fields of characteristic three. The algorithm has an application in the context of curve based cryptography. One distinguished…

We present a polynomial time exact quantum algorithm for the hidden subgroup problem in $Z_{m^k}^n$. The algorithm uses the quantum Fourier transform modulo m and does not require factorization of m. For smooth m, i.e., when the prime…