Related papers: Exponential Genus Problems in one-relator products…
The study of the complexity of the equation satisfiability problem in finite groups had been initiated by Goldmann and Russell (2002) where they showed that this problem is in polynomial time for nilpotent groups while it is NP-complete for…
In this note, we show that the satisfiability of equations and inequations with recognisable constraints is decidable in groups that are virtually direct products of finitely many hyperbolic groups.
We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…
We construct and study finitely presented groups with quadratic Dehn function (QD-groups) and present the following applications of the method developed in our recent papers. (1) The isomorphism problem is undecidable in the class of…
We introduce a combinatorial criterion for verifying whether a formula is not the conjunction of an equation and a co-equation. Using this, we give a proof for the nonequationality of the free group. Furthermore, we generalize the latter…
We show that there is no algorithm deciding whether the maximal residually free quotient of a given finitely presented group is finitely presentable or not. Given a finitely generated subgroup G of a finite product of limit groups, we…
In this article, I introduce a group-theoretical method to prove positivity of certain linear combinations (with coefficients generally lying in $\mathbb{C}$) of exponential functions under a set of semidefinite linear constraints. The…
Morrill and Valentin in the paper "Computational coverage of TLG: Nonlinearity" considered an extension of the Lambek calculus enriched by a so-called "exponential" modality. This modality behaves in the "relevant" style, that is, it allows…
A classification of the ways in which an element of a free group can be expressed as a product of commutators or as a product of squares is given. This is then applied to some particular classes of elements. Finally, a question about…
We study groups, exponential groups and ordered groups equipped with valuations. We investigate algebraic and topological features of such valued structures, and apply our findings in order to solve regular equations over groups using…
We show that the Diophantine problem(decidability of equations) is undecidable in free associative algebras over any field and in the group algebras over any field of a wide variety of torsion free groups, including toral relatively…
In 1960 Fuchs posed the problem of characterizing the groups which are the groups of units of commutative rings. In the following years, some partial answers have been given to this question in particular cases. In this paper we address…
We give a sufficient condition for the existence of a quadratic exponential vector with test function in L2(Rd) ? L?(Rd). We prove the linear independence and totality, in the quadratic Fock space, of these vectors. Using a technique…
Equations in free groups have become prominent recently in connection with the solution to the well known Tarski Conjecture. Results of Makanin and Rasborov show that solvability of systems of equations is decidable and there is a method…
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…
We give a new proof that free Burnside groups of sufficiently large even exponents are infinite. The method is very flexible and can also be used to study (partially) periodic quotients of any group which admits an action on a hyperbolic…
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.
It is known that the existential theory of equations in free groups is decidable. This is a famous result of Makanin. On the other hand it has been shown that the scheme of his algorithm is not primitive recursive. In this paper we present…
In this article, we study connections between representation theory and efficient solutions to the conjugacy problem on finitely generated groups. The main focus is on the conjugacy problem in conjugacy separable groups, where we measure…
We prove that one variable equations in the lamplighter group $\MZ_2\wr \MZ$ are decidable and describe an algorithm for solving such equations. The algorithm has super-exponential time complexity in the worst case. We also show that, for…