Related papers: A word-hyperbolic special monoid with undecidable …
Based on the MRDP theorem, we introduce the ideas of the proof equation of a formula and universal proof equation of Peano Arithmetic (PA); and then, combining universal proof equation and G\"odel's Second Incompleteness Theorem, it is…
We study a family of groups consisting of the simplest extensions of lamplighter groups. We use these groups to answer multiple open questions in combinatorial group theory, providing groups that exhibit various combinations of properties:…
This paper is the eighth in a sequence on the structure of sets of solutions to systems of equations in free and hyperbolic groups, projections of such sets (Diophantine sets), and the structure of definable sets over free and hyperbolic…
The positive existential theories of the sets $M_n(\mathbb N)$ without parameters build an inclusion lattice isomorhic with the lattice of divisibility. All these sets are algorithmically undecidable. In further sections some easier…
Myasnikov, Ushakov, and Won introduced power circuits in 2012 to construct a polynomial-time algorithm for the word problem in the Baumslag group, which has a non-elementary Dehn function. Power circuits are computational structures that…
We study membership problems in HNN extensions of free groups and then apply these results to solve the word problem in certain families of one-relator inverse monoids. In more detail, we consider HNN extensions where the defining…
In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…
Let $G$ be an acylindrically hyperbolic group and $E$ an exponential equation over $G$. We show that if $E$ is solvable in $G$, then there exists a solution whose components, corresponding to loxodromic elements, can be linearly estimated…
In this paper, we prove that the general problem of tiling the hyperbolic plane with \`a la Wang tiles is undecidable.
For any sufficiently strong theory of arithmetic, the set of Diophantine equations provably unsolvable in the theory is algorithmically undecidable, as a consequence of the MRDP theorem. In contrast, we show decidability of Diophantine…
A longstanding question of Gromov asks whether every one-ended word-hyperbolic group contains a subgroup isomorphic to the fundamental group of a closed hyperbolic surface. An infinite family of word-hyperbolic groups can be obtained by…
We consider expansions of Presburger arithmetic with families of monadic polynomial predicates. (Examples of such predicates are the set of perfect squares, or the set of integers of the form $2n^3-5n+3$, etc.) Although the full attendant…
We prove that for a finitely generated subgroup $H$ of a word-hyperbolic group $G$ the Frattini subgroup $F(H)$ of $H$ is finite.
The first-order theory of the automorphism group of an infinite resplendent model in a finite language is undecidable.
We prove an equivariant version of the fact that word-hyperbolic groups have finite asymptotic dimension. This is important in connection with our forthcoming proof of the Farrell-Jones conjecture in algebraic K-theory for every…
Due to the undecidability of most type-related properties of System F like type inhabitation or type checking, restricted polymorphic systems have been widely investigated (the most well-known being ML-polymorphism). In this paper we…
We investigate which free constructions (amalgamated products and HNN-extensions) over word hyperbolic groups produce groups that are again word hyperbolic. A complete answer is obtained for the case when the amalgamated subgroups are…
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)$,…
This paper is the ninth in a sequence on the structure of sets of solutions to systems of equations in free and hyperbolic groups, projections of such sets (Diophantine sets), and the structure of definable sets over free and hyperbolic…
Recently it was shown that it is undecidable whether a term rewrite system can be proved terminating by a polynomial interpretation in the natural numbers. In this paper we show that this is also the case when restricting the…