Related papers: Embedding of groups and quadratic equations over g…

The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of nonabelian simple groups. The minimum number of nonsolvable factors attained on all possible such series is called the…

Let $H$ be an acylindrically hyperbolic group without nontrivial finite normal subgroups. We show that any finite system $S$ of equations with constants from $H$ is equivalent to a single equation. We also show that the algebraic set…

For a countable group G = <A | R> presented by its generators A and defining relations R we discuss a simple method to embed G into such a 2-generator group T that the images of generators from A are explicitly given in T, and the defining…

We study the transference through finite index extensions of the notion of equational coherence, as well as its effective counterpart. We deduce an explicit algorithm for solving the following algorithmic problem about size two integral…

In this paper, we show that each finite group $G$ containing at most $p^2$ Sylow $p$-subgroups for each odd prime number $p$, is a solvable group. In fact, we give a positive answer to the conjecture in \cite{Rob}.

Let $ x $ be an element of a finite group $ G $ and denote the order of $ x $ by $ \mathrm{ord}(x) $. We consider a finite group $ G $ such that $ \gcd(\mathrm{ord}(x),\mathrm{ord}(y))\leqslant 2 $ for any two vanishing elements $ x $ and $…

For a finite group $G$ and a positive integer $n$, let $G(n)$ be the set of all elements in $G$ such that $x^{n}=1$. The groups $G$ and $H$ are said to be of the same (order) type if $G(n)=H(n)$, for all $n$. The main aim of this paper is…

Let $k$ be a field of characteristic $p>0$, which has infinitely many discrete valuations. We show that every finite embedding problem for $\Gal(k)$ with finitely many prescribed local conditions, whose kernel is a $p$-group, is properly…

This is the first of a sequence of papers devoted to studying the link between the complexity of the Word Problem for a finitely generated recursively presented group $G$ and the isoperimetric functions of the finitely presented groups in…

We prove that every countable left-ordered group embeds into a finitely generated left-ordered simple group. Moreover, if the first group has a computable left-order, then the simple group also has a computable left-order. We also obtain a…

Fix $k \geq 6$. We prove that any large enough finite group $G$ contains $k$ elements which span quadratically many triples of the form $(a,b,ab) \in S \times G$, given any dense set $S \subseteq G \times G$. The quadratic bound is…

Let $G$ be a group, $m\geq2$ and $n\geq1$. We say that $G$ is an $\mathcal{T}(m,n)$-group if for every $m$ subsets $X_1, X_2, \dots, X_m$ of $G$ of cardinality $n$, there exists $i\neq j$ and $x_i \in X_i, x_j \in X_j$ such that…

Explicit embeddings of the group $\mathbb{Q}$ into a finitely presented group $\mathcal{Q}$ and into a $2$-generator finitely presented group $T_{\mathcal{Q}}$ are suggested. The constructed embeddings reflect questions mentioned by…

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.

Recently knapsack problems have been generalized from the integers to arbitrary finitely generated groups. The knapsack problem for a finitely generated group $G$ is the following decision problem: given a tuple $(g, g_1, \ldots, g_k)$ of…

We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…

We prove that two countable locally finite-by-abelian groups G,H endowed with proper left-invariant metrics are coarsely equivalent if and only if their asymptotic dimensions coincide and the groups are either both finitely-generated or…

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of non-abelian simple groups. The minimum number of nonsolvable factors, attained on all possible such series in $G$, is called…

In 1968, John Thompson proved that a finite group $G$ is solvable if and only if every $2$-generator subgroup of $G$ is solvable. In this paper, we prove that solvability of a finite group $G$ is guaranteed by a seemingly weaker condition:…