Related papers: Algorithmically complex residually finite groups
We classify the factorizations of finite classical groups with nonsolvable factors, completing the classification of factorizations of finite almost simple groups.
In this paper, we compute an upper bound for the Dehn function of a finitely presented metabelian group. In addition, we prove that the same upper bound works for the relative Dehn function of a finitely generated metabelian group. We also…
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…
Let $U_n(q)$ be the upper triangular group of degree $n$ over the finite field $\F_q$ with $q$ elements. In this paper, we present constructions of large degree ordinary irreducible representations of $U_n(q)$ where $n\geq 7$, and then…
We introduce a new invariant of bipartite chord diagrams and use it to construct the first examples of groups with Dehn function $n^2\log n$ and other small Dehn functions. Some of these groups have undecidable conjugacy problem.
In this paper, we introduce a family of residually finite groups that helps us to systematically study the residual finiteness growth function (RFG) from various perspectives. First, by strengthening results of Bou-Rabee and Seward and also…
For every natural number $n$, there exist finitely presented groups with residual finiteness depths $\omega\cdot n$ and $\omega\cdot n + 1$. The ordinals that arise as the residual finiteness depth of a finitely generated group…
We construct a finitely presented (two-sided) totally orderable group with insoluble word problem.
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…
In this article we develop the theory of residually finite rationally $p$ (RFR$p$) groups, where $p$ is a prime. We first prove a series of results about the structure of finitely generated RFR$p$ groups (either for a single prime $p$, or…
We investigate the representations and the structure of Hecke algebras associated to certain finite complex reflection groups. We first describe computational methods for the construction of irreducible representations of these algebras,…
We construct the first examples of finitely presented groups with quadratic Dehn function containing a finitely generated infinite torsion subgroup. These examples are "optimal" in the sense that the Dehn function of any such finitely…
We construct a finitely presented group with quadratic Dehn function and undecidable conjugacy problem. This solves E. Rips' problem formulated in 1992. v2: misprints corrected. v3: lemmas 4.7, 4.10 corrected, more misprints fixed.
In this paper, we show that the class of representable residuated semigroups has the finite representation property. That is, every finite representable residuated semigroup is representable over a finite base. This result gives a positive…
Motivated by examples in infinite group theory, we classify the finite groups whose subgroups can never be decomposed as direct products.
In this paper we study the possibility to define irreducible representations of the symmetric groups with the help of finitely many relations. The existence of finite bases is established for the classes of representations corresponding to…
We construct a finitely presented group $G$ with non-quadratic Dehn function $f$ majorizable by a quadratic function on arbitrary long intervals.
We introduce a class $\A$ of finitely generated residually finite accessible groups with some natural restriction on one-ended vertex groups in their JSJ-decompositions. We prove that the profinite completion of groups in $\A$ almost…
In 2005, Borisov and Sapir proved that ascending HNN extensions of finitely generated linear groups are residually finite. Subsequently, Dru\c{t}u and Sapir noted the existence of finitely generated non-linear residually finite groups based…
We consider whether given a simple, finite description of a group in the form of an algorithm, it is possible to algorithmically determine if the corresponding group has some specified property or not. When there is such an algorithm, we…