Related papers: Groups generated by a finite Engel set

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

Let $m,n$ be positive integers and $p$ a prime. We denote by $\nu(G)$ an extension of the non-abelian tensor square $G \otimes G$ by $G \times G$. We prove that if $G$ is a residually finite group satisfying some non-trivial identity $f…

Here we show that a finite nilpotent group is 2-closed if and only if it is either cyclic or a direct product of a generalized quaternion group with a cyclic group of odd order.

A recurring theme in finite group theory is understanding how the structure of a finite group is determined by the arithmetic properties of group invariants. There are results in the literature determining the structure of finite groups…

Let G be a finite non-nilpotent group such that every Sylow subgroup of G is generated by at most d elements, and such that p is the largest prime dividing |G|. We show that G has a non-nilpotent image G/N, such that N is characteristic and…

Let $G$ be a finite group, $L_1(G)$ be its poset of cyclic subgroups and consider the quantity $\alpha(G)=\frac{|L_1(G)|}{|G|}$. The aim of this paper is to study the class $\cal{C}$ of finite nilpotent groups having…

Let $G$ be a finite 2-generated soluble group and suppose that $\langle a_1,b_1\rangle=\langle a_2,b_2\rangle=G$. If either $G^\prime$ is of odd order or $G^\prime$ is nilpotent, then there exists $b \in G$ with $\langle…

It is proved that the derived subgroup of a finite group is nilpotent if and only if $|ab|\ge |a||b|$ for all primary commutators $a$ and $b$ of coprime orders.

Let G be a finitely generated group with a given word metric. The asymptotic density of elements in G that have a particular property P is defined to be the limit, as r goes to infinity, of the proportion of elements in the ball of radius r…

Suppose that $A,B$ are two non-empty subsets of the finite nilpotent group $G$. If $A\not=B$, then the cardinality of the restricted sumset $$A\dotplus B={a+b: a\in A, b\in B, a\neq b} $$ is at least $$\min{p(G),|A|+|B|-2},$$ where $p(G)$…

Let $G$ be an amenable group. We define and study an algebra $\mathcal{A}_{sn}(G)$, which is related to invariant means on the subnormal subgroups of $G$. For a just infinite amenable group $G$, we show that $\mathcal{A}_{sn}(G)$ is…

We show that there exists an algorithm to decide any single equation in the Heisenberg group in finite time. The method works for all two-step nilpotent groups with rank-one commutator, which includes the higher Heisenberg groups. We also…

We introduce a model of random f.g., torsion-free, $2$-step nilpotent groups (in short, $\tau_2$-groups). To do so, we show that these are precisely the groups that admit a presentation of the form $ \label{tau2pres_0}\langle A, C \mid…

We show that a finitely generated soluble group is virtually nilpotent if and only if the diameter of its finite coset spaces admits a uniform polynomial lower bound in terms of their size. We obtain the same conclusion for certain finitely…

A group is said to be strongly amenable if each of its proximal topological actions has a fixed point. We show that a finitely generated group is strongly amenable if and only if it is virtually nilpotent. More generally, a countable…

Recall that an element $x\in R$ is {\bf complemented} if there is a $y\in R$ such that $xy = 0$ and $x + y \in {\rm reg}(R)$. In a recent article [1], the authors investigated those rings for which every non-nilpotent element is…

In [3] is was shown that for any group $G$ whose rank (i.e., minimal number of generators) is at most 3, and any finite index subgroup $H\leq G$ with index $[G:H]\geq rank(G)$, one can always find a left-right transversal of $H$ which…

A smallest generating set of a semigroup is a generating set of the smallest cardinality. Similarly, an irredundant generating set $X$ is a generating set such that no proper subset of $X$ is also a generating set. A semigroup $S$ is…

Given a 2-generated finite group $G$, the non-generating graph of $G$ has as vertices the elements of $G$ and two vertices are adjacent if and only if they are distinct and do not generate $G$. We consider the graph $\Sigma(G)$ obtained…

A finite group $G$ is said to be a $\mathcal{B}_{\psi}$-group if $\psi(H)<|G|$ for any proper subgroup $H$ of $G$, where $\psi(H)$ denotes the sum of element orders of $H$. In this paper, we characterize the $\mathcal{B}_{\psi}$-groups up…