Related papers: Spherical quadratic equations in free metabelian g…
We express the solutions to quadratic equations with two variables in the ring of integers using EDT0L languages. We use this to show that EDT0L languages can be used to describe the solutions to one-variable equations in the Heisenberg…
If $F$ is a finitely generated free group and $\phi$ is a positive automorphism of $F$ then $F\rtimes_\phi Z$ satisfies a quadratic isoperimetric inequality.
We solve the diophantine equations x^4 + d y^2 = z^p for d=2 and d=3 and any prime p>349 and p>131 respectively. The method consists in generalizing the ideas applied by Frey, Ribet and Wiles in the solution of Fermat's Last Theorem, and by…
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.
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.
We prove that finitely generated free metabelian groups $\Psi_n$ are profinitely rigid in the absolute sense: they are distinguished by their finite quotients among all finitely generated residually finite groups. The proof is based on a…
This paper initiates a novel research direction in the theory of Diophantine equations: define an appropriate version of the equation's size, order all polynomial Diophantine equations starting from the smallest ones, and then solve the…
In this paper we provide a framework for the study of isoperimetric problems in finitely generated group, through a combinatorial study of universal covers of compact simplicial complexes. We show that, when estimating filling functions,…
We introduce the notion of a regular quadratic equation and a regular NTQ system over a free group. We prove the results that can be described as Implicit function theorems for algebraic varieties corresponding to regular quadratic and NTQ…
We prove that for given integers b and c, the diophantine equation x^2+bx+c=y^2, has finitely many integer solutions(i.e. pairs in ZxZ),in fact an even number of such solutions(including the zero or no solutions case).We also offer an…
We study some Diophantine problems related to triangles with two given integral sides. We solve two problems posed by Zolt\'an Bertalan and we also provide some generalization.
The Equation Problem in finitely presented groups asks if there exists an algorithm which determines in finite amount of time whether any given equation system has a solution or not. We show that the Equation Problem in central extensions…
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…
In this paper, we consider elliptic curves induced by rational Diophantine quadruples, i.e. sets of four nonzero rationals such that the product of any two of them plus 1 is a perfect square. We show that for each of the groups…
Let $F$ be a free group of finite rank. We say that the monomorphism problem in $F$ is decidable if for any two elements $u$ and $v$ in $F$, there is an algorithm that determines whether there exists a monomorphism of $F$ that sends $u$ to…
We consider the problem of Diophantine approximation on semisimple algebraic groups by rational points with restricted numerators and denominators and establish a quantitative approximation result for all real points in the group by…
The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…
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…
The general d-dimensional twisted group lattice is solved. The irreducible representations of the corresponding group are constructed by an explicit procedure. It is proven that they are complete. All matrix representation solutions to the…
In this note we investigate the set $S(n)$ of positive integer solutions of the title Diophantine equation. In particular, for a given $n$ we prove boundedness of the number of solutions, give precise upper bound on the common value of…