Related papers: Notes about decidability of exponential equations
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…
Exponential equations in free groups were studied initially by Lyndon and Schutzenberger and then by Comerford and Edmunds. Comerford and Edmunds showed that the problem of determining whether or not the class of quadratic exponential…
We prove that Knapsack problem (KP) is undecidable for any group of nilpotency class two if the number of generators (without torsion) of the derived subgroup is at least 322. This result together with the fact that if KP is undecidable for…
We consider the two-variable fragment of first-order logic with one distinguished binary predicate constrained to be interpreted as a transitive relation. The finite satisfiability problem for this logic is shown to be decidable, in triply…
Some new decidability results for multiplicative matrix equations over algebraic number fields are established. In particular, special instances of the so-called knapsack problem are considered. The proofs are based on effective methods for…
We construct a finitely presented group with undecidable word problem and with Dehn function bounded by a quadratic function on an infinite set of positive integers.
The knapsack problem for groups was introduced by Miasnikov, Nikolaev, and Ushakov. It is defined for each finitely generated group $G$ and takes as input group elements $g_1,\ldots,g_n,g\in G$ and asks whether there are $x_1,\ldots,x_n\ge…
Using a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to…
We generalize the classical knapsack and subset sum problems to arbitrary groups and study the computational complexity of these new problems. We show that these problems, as well as the bounded submonoid membership problem, are P-time…
The knapsack problem is a classic optimisation problem that has been recently extended in the setting of groups. Its study reveals to be interesting since it provides many different behaviours, depending on the considered class of groups.…
In recent years, knapsack problems for (in general non-commutative) groups have attracted attention. In this paper, the knapsack problem for wreath products is studied. It turns out that decidability of knapsack is not preserved under…
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…
We show that it is undecidable whether a system of linear equations over the Laurent polynomial ring $\mathbb{Z}[X^{\pm}]$ admit solutions where a specified subset of variables take value in the set of monomials $\{X^z \mid z \in…
It is shown that order-invariance of two-variable first-logic is decidable in the finite. This is an immediate consequence of a decision procedure obtained for the finite satisfiability problem for existential second-order logic with two…
We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability…
The study of word equations (or the existential theory of equations over free monoids) is a central topic in mathematics and theoretical computer science. The problem of deciding whether a given word equation has a solution was shown to be…
Recently Brownawell and the second author proved a "non-degenerate" case of the (unproved) "Zilber Nullstellensatz" in connexion with "Strong Exponential Closure". Here we treat some significant new cases. In particular these settle…
After discussing two senses in which the notion of undecidability is used, we present a survey of undecidable decision problems arising in various branches of mathematics.
We construct a finitely presented (two-sided) totally orderable group with insoluble word problem.
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.