Related papers: An inequality detecting nilpotency of finite group…
We prove a new criterion for the solvability of the finite groups, depending on the function $\psi_k(G)$ which is defined as the sum of $k$-th powers of the element orders of $G$. We show that our result can be used to show the solvability…
A countable group is residually finite if every nontrivial element can act nontrivially on a finite set. When a group fails to be residually finite, we might want to measure how drastically it fails - it could be that only finitely many…
For a finite group $G$, let $LC(G)$ be the subgroup generated by elements $x$ such that, for all $y \in G$ and all integers $n$, the order of $x^n y$ divides the least common multiple of the orders of $x$ and $y$. This subgroup is a…
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…
The action of the idempotent deformations on finite groups is discussed. This action is described in terms of the homological properties of groups. The orbits of finite simple groups are determined.
A group is small if it has countably many complete $n$-types over the empty set for each natural number n. More generally, a group $G$ is weakly small if it has countably many complete 1-types over every finite subset of G. We show here…
In this paper, we will prove some sufficient conditions for the solvability of groups.
In this paper we study the nilpotency of certain groups of self homotopy equivalences. Our main goal is to extend, to localized homotopy groups and/or homotopy groups with coefficients, the general principle of Dror and Zabrodsky by which a…
We give a detailed description of infinite locally nilpotent groups G such that the index |C_G (x) : <x>| is finite, for every non-normal cyclic subgroup <x> of G. We are also able to extend our analysis to all non-periodic groups…
For any group $G$, we define an equivalence relation $\thicksim$ as below: $$\forall \ g, h \in G \ \ g\thicksim h \Longleftrightarrow |g|=|h|$$ the set of sizes of equivalence classes with respect to this relation is called the same-order…
We introduce the abstract concept of supernilpotence in loop theory, and relate it to existing concepts, namely, central nilpotence and nilpotence of the multiplication group. We prove that the class of supernilpotence is greater or equal…
This paper deals with the comparison of two common types of equivalence groups of differential equations, and this gives rise to a number of results presented in the form of theorems. It is shown in particular that one type can be…
A translation of Emmy Noether's paper "Der Endlichkeitsatz der Invarianten endlicher Gruppen" (Mathematische Annalen, vol. 77, 1920, pages 89--92). In Noether's words, the paper gives "an entirely elementary finiteness proof---using only…
Let $ n, q $ be positive integers. We show that if $ G $ is a finitely generated residually finite group satisfying the identity $ [x,_ny^q]\equiv 1, $ then there exists a function $ f(n) $ such that $ G $ has a nilpotent subgroup of finite…
Let $\gamma_n=[x_1,\dots,x_n]$ be the $n$th lower central word. Denote by $X_n$ the set of $\gamma_n$-values in a group $G$ and suppose that there is a number $m$ such that $|g^{X_n}|\leq m$ for each $g\in G$. We prove that…
We study the class of groups having the property that every non-nilpotent subgroup is equal to its normalizer. These groups are either soluble or perfect. We completely describe the structure of soluble groups and finite perfect groups with…
It is proved that, for a prime $p>2$ and integer $n\geq 1$, finite $p$-groups of nilpotency class $3$ and having only two conjugacy class sizes $1$ and $p^n$ exist if and only if $n$ is even; moreover, for a given even positive integer,…
A well-known theorem of P. Hall, usually called Hall's criterion for nilpotence, states: a group G is nilpotent whenever it has a normal subgroup N such that G/[N,N] and N are nilpotent. We widely generalize this result, replacing groups…
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…
The power graph $P(G)$ of a finite group $G$ is the undirected simple graph with vertex set $G$, where two elements are adjacent if one is a power of the other. In this paper, the matching numbers of power graphs of finite groups are…