Related papers: Detecting laws in power subgroups

For a group G and a positive integer n write B_n(G) = {x \in G : |x^G | \le n}. If s is a positive integer and w is a group word, say that G satisfies the (n,s)-covering condition with respect to the word w if there exists a subset S of G…

We say that a group $G$ is almost Engel if for every $g\in G$ there is a finite set ${\mathscr E}(g)$ such that for every $x\in G$ all sufficiently long commutators $[...[[x,g],g],\dots ,g]$ belong to ${\mathscr E}(g)$, that is, for every…

The number of subgroups and the number of cyclic subgroups are natural combinatorial invariants of a finite group. We investigate how restrictions on these quantities, together with the number of distinct prime divisors of $|G|$, enforce…

Let $G$ be a group. The \emph{power graph} of $G$ is a graph with the vertex set $G$, having an edge between two elements whenever one is a power of the other. We characterize nilpotent groups whose power graphs have finite independence…

Cameron, Manna and Mehatari investigated the question of which finite groups admit a power graph that is a cograph, also called power-cograph groups (Journal of Algebra 591 (2022)). They give a classification for nilpotent groups and…

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 prove several results detecting ciclicity or nilpotency of a finite group $G$ in terms of inequalities involving the orders of the elements of $G$ and the orders of the elements of the cyclic group of order $|G|$. We prove that, among…

We prove that Knapsack problem (KP) is undecidable for any group of nilpotency class two if the number of generators (without torsion) of the derived subgroup is at least 322. This result together with the fact that if KP is undecidable for…

Let $p$ be a prime number and suppose that every maximal subgroup of a finite group is either $p$-nilpotent or has prime index. Such group need not be $p$-solvable, and we study its structure by proving that only one nonabelian simple group…

We show that every finite group $G$ of size at least $3$ has a nilpotent subgroup of class at most $2$ and size at least $|G|^{1/32\log\log|G|}$. This answers a question of Pyber, and is essentially best possible.

In this short note, we provide an inequality that holds in any finite group, only involving the orders of the elements; we prove that equality holds if and only if the group is nilpotent.

Given a faithful finite-dimensional representation $V$ of a finite group $G$ over any field $\mathbb{F}$, we show that any irreducible ${\mathbb{F}}G$-module $W$ appears, as a submodule or a quotient, in $\mathrm{Sym}^m(V)$ for some integer…

Let K be a field of positive characteristic p and KG the group algebra of a group G. It is known that, if KG is Lie nilpotent, then its upper (or lower) Lie nilpotency index is at most |G'|+1, where |G'| is the order of the commutator…

In this paper, we study nilpotent $\mathbb{Q}$$[x]$-powered groups that satisfy the following property: For some set of primes $\omega$ in $\mathbb{Q}$$[x]$, every $\omega '$-isolated $\mathbb{Q}$$[x]$-subgroup in some family of its…

Let m, n be positive integers, v a multilinear commutator word and w = v^m. We prove that if G is a locally graded group in which all w-values are n-Engel, then the verbal subgroup w(G) is locally nilpotent.

Let $G$ be a finite group, let $p$ be a prime and let $w$ be a group-word. We say that $G$ satisfies $P(w,p)$ if the prime $p$ divides the order of $xy$ for every $w$-value $x$ in $G$ of $p'$-order and for every non-trivial $w$-value $y$ in…

Separability for groups refers to the question which subsets of a group can be detected in its finite quotients. Classically, separability is studied in terms of which classes have a certain separability property, and this question is…

A graph is called claw-free if it contains no induced subgraph isomorphic to the complete bipartite graph $K_{1, 3}$. The undirected power graph of a group $G$ has vertices the elements of $G$, with an edge between $g_1$ and $g_2$ if one of…

Given a group G and positive integers k,n, we let B_n=B_n(G) denote the set of all elements x in G such that |x^G|\leq n, and we say that G satisfies the (k,n)-covering condition for commutators if there is a subset S in G such that |S|\leq…

We deal with the following conjecture. If w is a group word and G is a finite group in which any nilpotent subgroup generated by w-values has exponent dividing e, then the exponent of the verbal subgroup w(G) is bounded in terms of e and w…