Related papers: Solution to the Burnside Problem

Given an infinite linear group with a finite set of generators, we show that the shortest word length of an element of infinite order has an upper bound that depends only on the number of generators and the degree. This provides a…

We show that free Burnside groups of sufficiently large odd exponent are non--amenable in a certain strong sense, more precisely, their left regular representations are isolated from the trivial representation uniformly on finite generating…

We prove that there exists a finitely generated group that satisfies a group law with probability 1 but does not satisfy any group law. More precisely, we construct a finitely generated group G in which the probability that a random element…

The Equation Problem in finitely presented groups asks if there exists an algorithm which determines in finite amount of time whether any given equation system has a solution or not. We show that the Equation Problem in central extensions…

We construct a finitely presented (two-sided) totally orderable group with insoluble word problem.

William W. Boone and Graham Higman proved that a finitely generated group has soluble word problem if and only if it can be embedded in a simple group that can be embedded in a finitely presented group. We prove the exact analogue for…

This paper is motivated by a general question: for which values of k and n is the universal Burnside kei of k generators and Kei "exponent" n, $\bar Q(k,n)$, finite? It is known (starting from the work of M. Takasaki (1942)) that $\bar…

Using quantum representations of mapping class groups we prove that profinite completions of Burnside-type surface group quotients are not virtually prosolvable, in general. Further, we construct infinitely many finite simple characteristic…

We show that every finitely generated residually finite torsion group $G$ embeds in a finitely generated torsion group $\Gamma$ that is residually finite simple. In particular we show the existence of finitely generated infinite torsion…

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…

We prove that every noncyclic subgroup of a free $m$-generator Burnside group $B(m,n)$ of odd exponent $n \gg 1$ contains a subgroup $H$ isomorphic to a free Burnside group $B(\infty,n)$ of exponent $n$ and countably infinite rank such that…

Thompson's theorem stated that a finite group $G$ is solvable if and only if every $2$-generated subgroup of $G$ is solvable. In this paper, we prove some new criteria for both solvability and nilpotency of a finite group using certain…

The idempotent problem of a finitely generated inverse semigroup is the formal language of all words over the generators representing idempotent elements. This note proves that a finitely generated inverse semigroup with regular idempotent…

To the best of our knowledge, there is no explicit, constructive description of the generating set for the unit group $A(G)^\times$ of the Burnside ring associated with a finite group $G$. We resolve this long-standing open question,…

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 study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…

Shumyatsky and the second author proved that if G is a finitely generated residually finite p-group satisfying a law, then, for almost all primes, the fact that a normal and commutator-closed set of generators satisfies a positive law…

We construct examples of finitely generated decidable group presentations that satisfy certain combinations of solvability for the word problem, solvability for the bounded word problem, and computablity for the Dehn function. We prove that…

We show that the word problem of the Brin-Higman-Thompson group $n G_{k,1}$ is {\sf coNP}-complete for all $n \ge 2$ and all $k \ge 2$. For this we prove that $n G_{k,1}$ is finitely generated, and that $n G_{k,1}$ contains a subgroup of $2…

We explore the concept of conjugation between subgroupoids, providing several characterizations of the conjugacy relation (Theorem A in {\S}1.2). We show that two finite groupoid-sets, over a locally strongly finite groupoid, are…