Related papers: Exponential Genus Problems in one-relator products…

We prove that, for every integer $n \ge 2$, a finite or infinite countable group $G$ can be embedded into a 2-generated group $H$ in such a way that the solvability of quadratic equations of length at most $n$ is preserved, i.e., every…

In 1896, Dedekind posed the problem of factoring the group determinant in the non-abelian case to Frobenius, whose solution sparked the birth of finite-group representation theory. Several decades earlier, Cayley introduced the notion of…

In this paper we study the complexity of solving quadratic equations in the lamplighter group. We give a complete classification of cases (depending on genus and other characteristics of a given equation) when the problem is…

The three famous problems concerning units, zero-divisors and idempotents in group rings of torsion-free groups, commonly attributed to I. Kaplansky, have been around for more than 60 years and still remain open in characteristic zero. In…

We study the growth of product sets in some finite three-dimensional matrix groups. In particular, we prove two results about the group of $2\times 2$ upper triangular matrices over arbitrary finite fields: a product set estimate using…

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.

A group has normal rank (or weight) greater than one if no single element normally generates the group. The Wiegold problem from 1976 asks about the existence of a finitely generated perfect group of normal rank greater than one. We show…

In \cite[Problem 72]{Fuchs60} 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 a…

We establish a general criterion for the finite presentability of subdirect products of groups and use this to characterize finitely presented residually free groups. We prove that, for all $n\in\mathbb{N}$, a residually free group is of…

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.

This work provides an effective algorithm for distinguishing finite quotients between two non-isomorphic finitely generated Fuchsian groups $\Gamma$ and $\Lambda$. It will suffice to take a finite quotient which is abelian, dihedral, a…

The subject of this paper are polynomials in multiple non-commuting variables. For polynomials of this type orthogonal with respect to a state, we prove a Favard-type recursion relation. On the other hand, free Sheffer polynomials are a…

Let $G$ be a unitriangular matrix group of nilpotency class at most ten. We show that the Identity Problem (does a semigroup contain the identity matrix?) and the Group Problem (is a semigroup a group?) are decidable in polynomial time for…

We study a family of groups consisting of the simplest extensions of lamplighter groups. We use these groups to answer multiple open questions in combinatorial group theory, providing groups that exhibit various combinations of properties:…

For a given quadratic equation with any number of unknowns in any free group F, with right-hand side an arbitrary element of F, an algorithm for solving the problem of the existence of a solution was given by Culler. The problem has been…

We characterize the virtually nilpotent finitely generated groups (or, equivalently by Gromov's theorem, groups of polynomial growth) for which the Domino Problem is decidable: These are the virtually free groups, i.e. finite groups, and…

We show that any element of the special linear group $SL_2(R)$ is a product of two exponentials if the ring $R$ is either the ring of holomorphic functions on an open Riemann surface or the disc algebra. This is sharp: one exponential…

We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…

For a CSA group $G$ and a wide class of abelian groups $A$ we give an explicit construction for the tensor $A$-completion of $G$ using free products with amalgamations. We apply the obtained results to the study of basic properties of…

In this paper, the Identity Problem for certain groups, which asks if the subsemigroup generated by a given finite set of elements contains the identity element, is related to problems regarding ordered groups. Notably, the Identity Problem…