Related papers: Recognition and constructive membership for discre…
We study the unitarity of monodromies of rank two Fuchsian systems of SL type with $(n+1)$ regular singularities on the Riemann sphere, namely, we give a sufficient and necessary condition for the monodromy group to be conjugate to a…
In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…
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 introduce a geometrically natural probability measure on the group of all M\"obius transformations of the circle. Our aim is to study "random" groups of M\"obius transformations, and in particular random two-generator groups. By this we…
Let M be a finitely generated submodule of a free module over a multivariate polynomial ring with coefficients in a discrete coherent ring. We prove that its module MLT(M ) of leading terms is countably generated and provide an algorithm…
We present a new algorithm for constructive recognition of the Suzuki groups in their natural representations. The algorithm runs in Las Vegas polynomial time given a discrete logarithm oracle. An implementation is available in the Magma…
The discrete logarithm problem in a finite group is the basis for many protocols in cryptography. The best general algorithms which solve this problem have time complexity of $\mathcal{O}(\sqrt{N}\log N)$, and a space complexity of…
In this paper, we identify many important properties and develop criteria for the existence of subquasigroups in finite quasigroups. Based on these results, we propose an effective method that concludes the nonexistence of subquasigroup of…
We prove that every finitely generated, residually finite group $G$ embeds into a finitely generated perfect branch group $\Gamma$ such that many properties of $G$ are preserved under this embedding. Among those are the properties of being…
This paper focuses on the classification of classes of topological equivalence of finite group actions on Riemann surfaces. By the Riemann-Hurwitz bound, there are just finitely many groups that act conformally on a closed orientable…
This review gives an overview on the research of algorithms for dynamical fermions used in large scale lattice QCD simulations. First a short overview on the state-of-the-art of ensemble generation at the physical point is given. Followed…
We survey the existing parts of a classification of finite groups generated by orthogonal transformations in a finite-dimensional Euclidean space whose fixed point subspace has codimension one or two and extend it to a complete…
Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. In the present paper we employ the…
Computer based techniques for recognizing finitely presented groups are quite powerful. Tools available for this purpose are outlined. They are available both in stand-alone programs and in more comprehensive systems. A general…
Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to…
We show that the following problems are decidable in a rank 2 free group F_2: does a given finitely generated subgroup H contain primitive elements? and does H meet the orbit of a given word u under the action of G, the group of…
We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…
Constructive algorithms, requiring no more than $2\times 2$ matrix manipulations, are provided for finding the entries of the positive definite factor in the polar decomposition of matrices in sixteen groups preserving a bilinear form in…
A classical problem, raised by Fuchs in 1960, asks to classify the abelian groups which are groups of units of some rings. In this paper, we consider the case of finitely generated abelian groups, solving Fuchs' problem for such group with…
We show that the Membership Problem for finitely generated subgroups of 3-manifold groups is solvable.