Related papers: The Diophantine problem in Thompson's group F

(Free-abelian)-by-free, self-similar groups generated by finite self-similar sets of tree automorphisms and having unsolvable conjugacy problem are constructed. Along the way, orbit undecidable, free subgroups of GL_d(Z), for d > 5, and…

We prove that the word problem is undecidable in functionally recursive groups, and that the order problem is undecidable in automata groups, even under the assumption that they are contracting.

This paper demonstrates the uniformly finite homology developed by Block and Weinberger and its relationship to amenable spaces via applications to the Cayley graph of Thompson's Group F. In particular, a certain class of subgraph of F is…

The first-order theory of the automorphism group of an infinite resplendent model in a finite language is undecidable.

The submonoid membership problem for a finitely generated group $G$ is the decision problem, where for a given finitely generated submonoid $M$ of $G$ and a group element $g$ it is asked whether $g \in M$. In this paper, we prove that for a…

Thompson's group F is the group of all increasing dyadic piecewise linear homeomorphisms of the closed unit interval. We compute Sigma^m(F) and Sigma^m(F;Z), the homotopical and homological Bieri-Neumann-Strebel-Renz invariants of F, and we…

A remarkable result of Thompson states that a finite group is soluble if and only if its two-generated subgroups are soluble. This result has been generalized in numerous ways, and it is in the core of a wide area of research in the theory…

We consider Diophantine inequalities of the kind |f(x)| \le m, where F(X) \in Z[X] is a homogeneous polynomial which can be expressed as a product of d homogeneous linear forms in n variables with complex coefficients and m\ge 1. We say…

We show that the problem `whether a finite set of regular-linear axioms defines a rigid theory' is undecidable.

We show that the freeness problems for automaton semigroups and for automaton monoids are undecidable and, thereby, solve an open problem listed by Grigorchuk, Nekrashevych and Sush\-chansk\u{\i}i. We achieve this using a new technique to…

We introduce ideas from geometric group theory related to boundaries of groups. This is a mostly expository paper. We consider the visual boundary of a free abelian group, and show that it is an uncountable set with the trivial topology.

In this paper, by solving Diophantine equations involving simple $K_4$-groups, we will try to point out that it is not easy to prove the infinitude of simple $K_4$-groups. This problem goes far beyond what is known about Dickson's…

We show that both the Brinkmann Problem (BrP) and the Brinkmann Conjugacy Problem (BrCP) are decidable for endomorphisms of the free group Fn.

We prove that, given a finitely generated subgroup $H$ of a free group $F$, the following questions are decidable: is $H$ closed (dense) in $F$ for the pro-(met)abelian topology? is the closure of $H$ in $F$ for the pro-(met)abelian…

Averaging linear functional on the space continuous functions of the group of diffeomorphisms of interval is found. Amenability of several discrete subgroups of the group of diffeomorphisms $\Diff^3([0,1])$ of interval is prove. In…

We show that the spectral gap problem is undecidable. Specifically, we construct families of translationally-invariant, nearest-neighbour Hamiltonians on a 2D square lattice of d-level quantum systems (d constant), for which determining…

We study Diophantine equations of type f(x)=g(y), where both f and g have at least two distinct critical points and equal critical values at at most two distinct critical points. Some classical families of polynomials (f_n)_n are such that…

For K \subseteq C, let B_n(K)={(x_1,...,x_n) \in K^n: for each y_1,...,y_n \in K the conjunction (\forall i \in {1,...,n} (x_i=1 => y_i=1)) AND (\forall i,j,k \in {1,...,n} (x_i+x_j=x_k => y_i+y_j=y_k)) AND (\forall i,j,k \in {1,...,n}…

We prove that the Brinkmann Problems (BrP & BrCP) and the twisted-conjugacy Problem (TCP) are decidable for any endomorphism of a free-abelian times free (FATF) group Fn x Z^m. Furthermore, we prove the decidability of the two-sided…

In this paper, we prove that the Hurwitz equivalence problem for 1-factorizations in $F_2 \oplus F_2$ is undecidable, and as a consequence, the Hurwitz equivalence problem for $\Delta^2$-factorizations in the braid groups $B_n, n\geq 5$ is…