Related papers: Finding non-trivial elements and splittings in gro…

The conjugacy problem for a finitely generated group $G$ is the two-variable problem of deciding for an arbitrary pair $(u,v)$ of elements of $G$, whether or not $u$ is conjugate to $v$ in $G$. We construct examples of finitely generated,…

Let G be a finite group. It has recently been proved that every nontrivial element of G is contained in a generating set of minimal size if and only if all proper quotients of G require fewer generators than G. It is natural to ask which…

We consider decidability problems in self-similar semigroups, and in particular in semigroups of automatic transformations of $X^*$. We describe algorithms answering the word problem, and bound its complexity under some additional…

We prove a structure theorem for finite perfect two-sided skew braces. The main tool is a central product theory for skew braces, developed here in both external and internal form; we show that these two constructions are equivalent. Our…

We prove that the class of nilpotent by finite, solvable by finite, polycyclic by finite, nilpotent of nilpotency class $n$ and supersolvable groups are closed under the formation of the non-abelian tensor product. We provide necessary and…

As part of various obstruction theories, non-trivial Massey products have been studied in symplectic and complex geometry, commutative algebra and topology for a long time. We introduce a general approach to constructing non-trivial Massey…

We study the superselection sectors of two quantum lattice systems stacked onto each other in the operator algebraic framework. We show in particular that all irreducible sectors of a stacked system are unitarily equivalent to a product of…

We classify finite groups $G$, such that the group algebra, $\mathbb{Q}G$ (over the field of rational numbers $\mathbb{Q}$), is the direct product of the group algebra $\mathbb{Q}[G/N]$ of a proper factor group $G/N$, and some division…

The Andrews-Curtis conjecture states that every balanced presentation of the trivial group can be reduced to the standard one by a sequence of the elementary Nielsen transformations and conjugations. In this paper we describe all balanced…

We develop a technique to construct finitely injective modules which are non trivial, in the sense that they are not direct sums of injective modules. As a consequence, we prove that a ring $R$ is left noetherian if and only if each…

The research described in this note aims at solving the constructive membership problem for the class of quasisimple classical groups. Our algorithms are developed in the black-box group model; that is, they do not require specific…

It is well known that any polycyclic group, and hence any finitely generated nilpotent group, can be embedded into $GL_{n}(\mathbb{Z})$ for an appropriate $n\in \mathbb{N}$; that is, each element in the group has a unique matrix…

We consider whether given a simple, finite description of a group in the form of an algorithm, it is possible to algorithmically determine if the corresponding group has some specified property or not. When there is such an algorithm, we…

For $N \geq 2$, we study the structure of definable abelian group extensions of the additive group $(\mathbb{R}^N,+)$ by countable abelian (Borel) groups $G$. Given an extension $H$ of $(\mathbb{R}^N,+)$ by $G$, we measure the definability…

We show that every non-trivial compact connected group and every non-trivial general or special linear group over an infinite field admits a generating set such that the associated Cayley graph has infinite diameter.

We consider semigroup algorithmic problems in finitely generated metabelian groups. Our paper focuses on three decision problems introduced by Choffrut and Karhum\"{a}ki (2005): the Identity Problem (does a semigroup contain a neutral…

Suppose $G$ is a simple group. For any nontrivial elements $g$ and $h$, $g$ can be written as a finite product of conjugates of $h$ or the inverse of $h$. G is called uniformly simple if the length of such an expression is uniformly…

We construct a finitely presented non-amenable group without free non-cyclic subgroups thus providing a finitely presented counterexample to von Neumann's problem. Our group is an extension of a group of finite exponent n >> 1 by a cyclic…

In various classes of infinite groups, we identify groups that are presentable by products, i.e. groups having finite index subgroups which are quotients of products of two commuting infinite subgroups. The classes we discuss here include…

We study the structure of generalized Baumslag-Solitar groups from the point of view of their (usually non-unique) splittings as fundamental groups of graphs of infinite cyclic groups. We find and characterize certain decompositions of…