Related papers: Linear equations with monomial constraints and dec…

We study the identity problem for matrices, i.e., whether the identity matrix is in a semigroup generated by a given set of generators. In particular we consider the identity problem for the special linear group following recent…

The inquiry into identifying sets of monomials that can be eliminated from a generic homogeneous polynomial via a linear change of coordinates was initiated by E. K. Wakeford. This linear algebra problem prompted C. K. Fan and J. Losonczy…

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…

The group isomorphism problem asks whether two finite groups given by their Cayley tables are isomorphic or not. Although there are polynomial-time algorithms for some specific group classes, the best known algorithm for testing isomorphism…

We exhibit a family of infinite, finitely-presented, nilpotent-by-abelian groups. Each member of this family is a solvable S-arithmetic group that is related to Baumslag-Solitar groups, and everyone of these groups has a quasi-isometry…

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…

The concept of a C-approximable group, for a class of finite groups C, is a common generalization of the concepts of a sofic, weakly sofic, and linear sofic group. Glebsky raised the question whether all groups are approximable by finite…

Any group that has a subnormal series, in which all factors are abelian and all except the last one are $p'$-torsion-free, can be embedded into a group with a subnormal series of the same length, with the same properties and such that any…

We study the Diophantine problem, i.e. the decision problem of solving systems of equations, for some families of one-relator groups, and provide some background for why this problem is of interest. The method used is primarily the…

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

In 1993, Muzychuk \cite{muzychuk} showed that the rational Schur rings over a cyclic group $Z_n$ are in one-to-one correspondence with sublattices of the divisor lattice of $n$, or equivalently, with sublattices of the lattice of subgroups…

We show that the Skolem Problem is decidable in finitely generated commutative rings of positive characteristic. More precisely, we show that there exists an algorithm which, given a finite presentation of a (unitary) commutative ring…

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.

In this work we investigate tensor completions of groups by associative rings, which were introduced by R.Lyndon and G.Baumslag in 1960s. The main result states that there exists an algorithm that decides if a given finite system of…

In this article we study automorphisms of Toeplitz subshifts. Such groups are abelian and any finitely generated torsion subgroup is finite and cyclic. When the complexity is non superlinear, we prove that the automorphism group is, modulo…

We prove that there is no algorithm that can determine whether or not a finitely presented group has a non-trivial finite quotient; indeed, this remains undecidable among the fundamental groups of compact, non-positively curved square…

We prove that the power word problem for certain metabelian subgroups of $\mathsf{GL}(2,\mathbb{C})$ (including the solvable Baumslag-Solitar groups $\mathsf{BS}(1,q) = \langle a,t \mid t a t^{-1} = a^q \rangle$) belongs to the circuit…

We investigate the complexity of computing the Zariski closure of a finitely generated group of matrices. The Zariski closure was previously shown to be computable by Derksen, Jeandel, and Koiran, but the termination argument for their…

In our previous work, we proposed the logic obtained from full non-associative Lambek calculus by adding a sort of linear-logical modality. We call this logic non-associative non-commutative intuitionistic linear logic ($\mathbf{NACILL}$,…

Let k be an algebraically closed field of characteristic 0, let K/k be a transcendental extension of arbitrary transcendence degree and let G be a multiplicative subgroup of (K^*)^n such that (k^*)^n is contained in G, and G/(k^*)^n has…