The solubility graph $Γ_S(G)$ associated with a finite group $G$ is a simple graph whose vertices are the elements of $G$, and there is an edge between two distinct vertices if and only if they generate a soluble subgroup. In this paper, we focus on the set of neighbors of a vertex $x$ which we call the solubilizer of $x$ in $G$, $\mathrm{Sol}_G(x)$, investigating both arithmetic and structural properties of this set.
A second countable virtually free pro-p group all of whose torsion elements have finite centralizer is the free pro-p product of finite p-groups and a free pro-p factor.
In this paper, we introduce a new function related to the sum of element orders of finite groups. It is used to give some criteria for a finite group to be cyclic, abelian, nilpotent, supersolvable and solvable, respectively.
In this note we introduce and characterize a class of finite groups for which the element orders satisfy a certain inequality. This is contained in some well-known classes of finite groups.
Let $G$ be a finite group. We prove a theorem implying that the orders of elements of the holomorph $\operatorname{Hol}(G)$ are bounded from above by $|G|$, and we discuss an application to bounding automorphism orders of finite groups.
Suppose that a locally finite group $G$ has a $2$-element $g$ with Chernikov centralizer. It is proved that if the involution in $\langle g\rangle$ has nilpotent centralizer, then $G$ has a soluble subgroup of finite index.
Given a finite group $G$ and an element $g\in G$, we may compare the expected number $e(G)$ of elements needed to generate $G$ and the expected number $e(G,g)$ of elements of $G$ needed to generate $G$ together with $g.$ We address the following question: how large can the difference $e(G)-e(G,g)$ be?
We characterize finite $p$-groups $G$ of order up to $p^7$ for which the group of central automorphisms fixing the center element-wise is of minimum possibe order.
For any odd prime $p$, we give an example of a locally finite $p$-group $G$ containing a left 3-Engel element $x$ where $\langle x \rangle^G$ is not nilpotent.
By a proper cover of a finite group G we mean an extension of a nontrivial finite group by G. Our purpose is to show that a proper cover of a finite simple group L of Lie type always contains an element whose order differs from the element orders of L provided that the Lie rank of L is sufficiently large.
We prove that the function $\mathrm{P}_{\mathrm{v}}(G)$, measuring the proportion of the elements of a finite group $G$ that are zeros of irreducible characters of $G$, takes very sparse values in a large segment of the $[0,1]$ interval.
Let $G$ be a finite group and let $p_1,\dots,p_n$ be distinct primes. If $G$ contains an element of order $p_1\cdots p_n,$ then there is an element in $G$ which is not contained in the Frattini subgroup of $G$ and whose order is divisible by $p_1\cdots p_n.$
The excess of an element $w$ of a finite Coxeter group $W$ is the minimal value of $l(x) + l(y) - l(w)$, where $x$, $y$ are elements of $W$ such that $x^2 = y^2 = 1$ and $w = xy$. Every element of a finite Coxeter group is either an involution or the product of two involutions, so the concept of excess is well defined. It can be extended to strongly real classes of infinite Coxeter groups. Earlier work by the authors showed that every conjugacy class of a finite Coxeter group contains an element of minimal length and excess zero. The current paper shows that each conjugacy class also contains …
In this paper, we study the proportion of vanishing elements of finite groups. We show that the proportion of vanishing elements of every finite non-abelian group is bounded below by $1/2$ and classify all finite groups whose proportions of vanishing elements attain this bound. For symmetric groups of degree at least $5$, we show that this bound is at least $2327/2520$ which is best possible.
In this paper we study the probability that two elements selected at random with replacement from a given finite semigroup act the same by right translation on the semigroup, that is, the chosen elements have the same right matrix.
