Related papers: Equation satisfiability in solvable groups

We introduce two new types of Dehn functions of group presentations which seem more suitable (than the standard Dehn function) for infinite group presentations and prove the fundamental equivalence between the solvability of the word…

Solvability of the conjugacy problem for relatively hyperbolic groups was announced by Gromov [Hyperbolic groups, MSRI publications 8 (1987)]. Using the definition of Farb of a relatively hyperbolic group in the strong sense [B Farb,…

Let $G$ be a finite group. The aim of this paper is to study the number of solutions $S\subseteq G$ of the equation $\mho^{\{n\}}(S)=L$, where $L$ is a non-empty subset of $G$, $n$ is a positive integer and $\mho^{\{n\}}(S)=\{ s^n \ | \…

Let $G$ be a finite group and $p$ a fixed prime divisor of $|G|$. Combining the nilpotence, the normality and the order of groups together, we prove that if every maximal subgroup of $G$ is nilpotent or normal or has $p'$-order, then (1)…

The following refinement of the Higman embedding theorem is proved: A finitely generated group $R$ is recursively presented if and only if there exists a quasi-isometric malnormal embedding of $R$ into a finitely presented group $H$ such…

We give lower bounds on the complexity of the word problem of certain non-solvable groups: for a large class of non-solvable infinite groups, including in particular free groups, Grigorchuk's group and Thompson's groups, we prove that their…

The number of subgroups and the number of cyclic subgroups are natural combinatorial invariants of a finite group. We investigate how restrictions on these quantities, together with the number of distinct prime divisors of $|G|$, enforce…

Friedl and L\"oh (2021, Confl. Math.) prove that testing whether or not there is an epimorphism from a finitely presented group to a virtually cyclic group, or to the direct product of an abelian and a finite group, is decidable. Here we…

An $integral$ of a group $G$ is a group $H$ whose commutator subgroup is isomorphic to $G$. This paper continues the investigation on integrals of groups started in the work arXiv:1803.10179. We study: (1) A sufficient condition for a bound…

The finite satisfiability problem for guarded fixpoint logic is decidable and complete for 2ExpTime (resp. ExpTime for formulas of bounded width).

Complexity problems associated with finite rings and finite semigroups, particularly semigroups of matrices over a field and the Rees matrix semigroups, are examined. Let M_nF be the ring of n x n matrices over the finite field F and let…

We study soluble groups G in which each subnormal subgroup H with infinite rank is commensurable with a normal subgroup, i.e. there exists a normal subgroup N such that the intersection of H and N has finite index in both H and N. We show…

Bouc proposed the following conjecture: a finite group $G$ is nilpotent if and only if its largest quotient $B$-group $\beta(G)$ is nilpotent. And he has prove that this conjecture holds when $G$ is solvable. In this paper, we consider the…

This paper depicts algorithms for solving the decision Boolean Satisfiability Problem. An extreme problem is formulated to analyze the complexity of algorithms and the complexity for solving it. A novel and easy reformulation as a lottery…

The normaliser problem has as input two subgroups $H$ and $K$ of the symmetric group $S_n$, and asks for a generating set for $N_K(H)$: it is not known to have a subexponential time solution. It is proved in [Roney-Dougal & Siccha, 2020]…

In 1960, L\'{a}szl\'{o} Fuchs posed the problem of determining which groups $G$ are realizable as the group of units in some ring $R$. In \cite{chebolu2022fuchs}, we investigated the following variant of Fuchs' problem, for abelian groups:…

We introduce and investigate different definitions of effective amenability, in terms of computability of F{\o}lner sets, Reiter functions, and F{\o}lner functions. As a consequence, we prove that recursively presented amenable groups have…

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…

We investigate subgroups of the group PLo(I) of piecewise-linear, orientation preserving homeomorphisms of the unit interval with finitely many breaks in slope, and also subgroups of Thompson's group F. We find geometric criteria…

The computational complexity of the word problem in HNN-extension of groups is studied. HNN-extension is a fundamental construction in combinatorial group theory. It is shown that the word problem for an ascending HNN-extension of a group H…