Related papers: On finite groups with exactly one noncommutator

Let G be a finite simple group. We show that the commutator map $a : G \times G \to G$ is almost equidistributed as the order of G goes to infinity. This somewhat surprising result has many applications. It shows that for a subset X of G we…

The nonsoluble length $\lambda (G)$ of a finite group $G$ is defined as the number of nonsoluble factors in a shortest normal series each of whose factors either is soluble or is a direct product of nonabelian simple groups. The generalized…

Let $G$ be a finite group, and let $\text{Irr}(G)$ denote the set of the irreducible complex characters of $G$. An element $g\in G$ is called a vanishing element of $G$ if there exists $\chi\in\text{Irr}(G)$ such that $\chi(g)=0$ (i.e., $g$…

Given a finite group $G$, the solubilizer of an element $x$, denoted by $\Sol_G(x)$, is the set of all elements $y$ such that $\langle x, y\rangle$ is a soluble subgroup of $G$. In this paper, we provide a classification for all…

Given a second-countable, Hausdorff, \'etale, amenable groupoid G with compact unit space, we show that an element a in C*(G) is invertible if and only if \lambda_x(a) is invertible for every x in the unit space of G, where \lambda_x refers…

It is shown that there exist finitely generated infinite simple groups of infinite commutator width and infinite square width on which there exists no stably unbounded conjugation-invariant norm, and in particular stable commutator length…

Let $G$ be the alternating group of degree $n$. Let $\omega(G)$ be the maximal size of a subset $S$ of $G$ such that $\langle x,y \rangle = G$ whenever $x,y \in S$ and $x \neq y$ and let $\sigma(G)$ be the minimal size of a family of proper…

It is shown that there exists a finitely generated infinite simple group of infinite commutator width, and that the commutator width of a finitely generated infinite boundedly simple group can be arbitrarily large. Besides, such groups can…

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…

Given a group-word $w$ and a group $G$, the set of $w$-values in $G$ is denoted by $G_w$ and the verbal subgroup $w(G)$ is the one generated by $G_w$. The word $w$ is concise if $w(G)$ is finite for all groups $G$ in which $G_w$ is finite.…

Let $n>0$ be an integer and $\mathcal{X}$ be a class of groups. We say that a group $G$ satisfies the condition $(\mathcal{X},n)$ whenever in every subset with $n+1$ elements of $G$ there exist distinct elements $x,y$ such that $<x,y>$ is…

We consider the group $\mathfrak{X}(G)$ obtained from $G\ast G$ by forcing each element $g$ in the first free factor to commute with the copy of $g$ in the second free factor. Deceptively complicated finitely presented groups arise from…

Every nonabelian finite simple group of rank $n$ over a field of size $q$, with the possible exception of the Ree groups $^2G_2(3^{2e+1})$, has a presentation with a bounded number of generators and relations and total length $O(\log n…

For a finite group $G$, let $\omega(G)$ be the set of element orders of $G$ and let $h(G)$ be the number of pairwise nonisomorphic finite groups $H$ with $\omega(H)=\omega(G)$. We say that the recognition problem is solved for $G$ if the…

Let G be a linear group such that for every g in G there is a finite set R(g) with the property that for every x in G all sufficiently long commutators [g,x,x,...,x] belong to R(g). It is proved that G is finite-by-hypercentral.

If $G$ is a finite group and $x\in G$ then the set of all elements of $G$ having the same order as $x$ is called {\em an order subset of $G$ determined by $x$} (see [2]). We say that $G$ is a {\em group with perfect order subsets} or…

Assume $\mathcal{C}$ is the class of all linear orders $L$ such that $L$ is not a countable union of well ordered sets, and every uncountable subset of $L$ contains a copy of $\omega_1$. We show it is consistent that $\mathcal{C}$ has…

In this short note we confirm a conjecture of James Wiegold. We prove that if $G$ is a finite $p$-group and $|G'|>p^{n(n-1)/2}$ for some non-negative integer $n$, then the group $G$ can be generated by the elements of breadth at least $n$.…

Let $G$ be a group. Write $G^{*}=G\setminus \{1\}$. An element $x$ of $G^{*}$ will be called deficient if $ \langle x\rangle < C_G(x)$ and it will be called non-deficient if $\langle x\rangle = C_G(x).$ If $x\in G$ is deficient…

For a group $G$, $\mathcal{F}_G$ denotes the set of all non-empty finite subsets of $G$. We extend the finitary coarse structure of $G$ from $G\times G$ to $\mathcal{F}_G\times \mathcal{F}_G$ and say that a macro-uniform mapping $f:…