Related papers: Quadratic Equations in Hyperbolic Groups are NP-co…
We prove that the problems of deciding whether a quadratic equation over a free group has a solution is NP-complete.
Let $\Gamma$ be a torsion-free hyperbolic group. We study $\Gamma$--limit groups which, unlike the fundamental case in which $\Gamma$ is free, may not be finitely presentable or geometrically tractable. We define model $\Gamma$--limit…
Let $\Gamma$ be a torsion-free hyperbolic group. We show that the set of solutions of any system of equations with one variable in $\Gamma$ is a finite union of points and cosets of centralizers if and only if any two-generator subgroup of…
We show that, given a finitely generated group $G$ as the coordinate group of a finite system of equations over a torsion-free hyperbolic group $\Gamma$, there is an algorithm which constructs a cover of a canonical solution diagram. The…
We prove that in a free group the length of the value of each variable in a minimal solution of a standard quadratic equation is bounded by $2s$ for orientable equation and by $12s^4$ for non-orientable equation, where $s$ is the sum of the…
We provide polynomial upper bounds on the size of a shortest solution for quadratic equations in a free group. A similar bound is given for parametric solutions in the description of solutions sets of quadratic equations in a free group.
We show that for any finite-rank free group $\Gamma$, any word-equation in one variable of length $n$ with constants in $\Gamma$ fails to be satisfied by some element of $\Gamma$ of word-length $O(\log (n))$. By a result of the first…
We provide an algorithm which, for a given quadratic equation in the Grigorchuk group determines if it has a solution. As a corollary to our approach, we prove that the group has a finite commutator width.
Consider the planar restricted $(N+1)$-body problem with trajectories of the $N(\ge 2)$ primaries forming a collision-free periodic solution of the $N$-body problem, for any positive energy $h$ and directions $\theta_{\pm} \in [0, 2\pi)$,…
Let G=SO(n,1) and Gamma a geometrically finite Zariski dense subgroup of G which is contained in an arithmetic subgroup of G. Denoting by Gamma(q) the principal congruence subgroup of Gamma of level q, and fixing a positive number \lambda_0…
Given a finitely generated subgroup $\Gamma \le \mathrm{Out}(\mathbb{F})$ of the outer automorphism group of the rank $r$ free group $\mathbb{F} = F_r$, there is a corresponding free group extension $1 \to \mathbb{F} \to E_{\Gamma} \to…
We exhibit examples of finitely presented subgroups $P$ of direct products of hyperbolic groups for which there is no algorithm that detects whether a finitely presented group has a quotient isomorphic to $P$. For any torsion-free, linear,…
A group $\Gamma$ with a family of subgroups $\mathbb{P}$ is relatively hyperbolic if $\Gamma$ admits a cusp-uniform action on a proper $\delta$--hyperbolic space. We show that any two such spaces for a given group pair are quasi-isometric,…
Using the quaternionic formalism for the description of the group of isometries of hyperbolic $5$-space we consider arithmetically defined $5$-dimensional hyperbolic manifolds which are non-compact but of finite volume. They arise from…
We show that the full set of solutions to systems of equations and inequations in a hyperbolic group, as shortlex geodesic words (or any regular set of quasigeodesic normal forms), is an EDT0L language whose specification can be computed in…
We prove that the compressed word problem and the compressed simultaneous conjugacy problem are solvable in polynomial time in hyperbolic groups. In such problems, group elements are input as words defined by straight line programs defined…
If $G_1$ and $G_2$ are torsion-free hyperbolic groups and $P<G_1\times G_2$ is a finitely generated subdirect product, then the conjugacy problem in $P$ is solvable if and only if there is a uniform algorithm to decide membership of the…
We study conjugacy classes of solutions to systems of equations and inequations over torsion-free hyperbolic groups, and describe an algorithm to recognize whether or not there are finitely many conjugacy classes of solutions to such a…
Let $G$ be a non-trivial torsion free group and $t$ be an unknown. In this paper we consider three equations (over $G$) of arbitrary length and show that they have a solution (over $G$) provided two relations among their coefficients hold.…
Recently knapsack problems have been generalized from the integers to arbitrary finitely generated groups. The knapsack problem for a finitely generated group $G$ is the following decision problem: given a tuple $(g, g_1, \ldots, g_k)$ of…