Related papers: First-order recognisability in finite and pseudofi…

It is shown that finite groups in which the order of the product of every pair of elements of co-prime order is the product of the orders, is nilpotent.

A group is $\textit{finitely axiomatizable}$ (FA) in a class $\mathcal{C}$ if it can be determined up to isomorphism within $\mathcal{C}$ by a sentence in the first-order language of group theory. We show that profinite groups of various…

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.

We show that a first-order sentence is almost surely true in a random group of density d<1/2 if and only if it is true in a non-abelian free group.

We investigate two notions about descriptions of groups using first-order language: quasi-finite axiomatizability, concerning infinite groups, and polylogarithmic compressibility, concerning classes of finite groups.

Over any partially ordered abelian group whose positive cone is closed in an appropriate sense and has finitely many faces, modules that satisfy a weak finiteness condition admit finite primary decompositions. This conclusion rests on the…

Let $\mathfrak{Nil}$ be the class of nilpotent groups. This article explores the finiteness of meta and para-$\mathfrak{Nil}$-Hamiltonian groups or their derived subgroups when these groups contain a soluble subgroup of finite index or a…

A subgroup $H$ of a group $G$ is said to be an $IC\Phi$-subgroup of $G$ if $H \cap [H,G] \le \Phi(H)$. We analyze the structure of a finite group $G$ under the assumption that some given subgroups of $G$ are $IC\Phi$-subgroups of $G$. A new…

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…

We show that if a group G is finitely presented and nilpotent-by-abelian-by-finite, then there is an upper bound on the first betti number of M as M runs through all subgroups of finite index in G.

Thompson's theorem stated that a finite group $G$ is solvable if and only if every $2$-generated subgroup of $G$ is solvable. In this paper, we prove some new criteria for both solvability and nilpotency of a finite group using certain…

Let $G$ be an arbitrary group. We show that if the Fitting subgroup of $G$ is nilpotent then it is definable. We show also that the class of groups whose Fitting subgroup is nilpotent of class at most $n$ is elementary. We give an example…

We refer to the set of the orders of elements of a finite group as its spectrum and say that groups are isospectral if their spectra coincide. We prove that with the only specific exception the solvable radical of a nonsolvable finite group…

We prove that a random group, in Gromov's density model with $d < 1/16$ satisfies with overwhelming probability a universal-existential first-order sentence $\sigma$ (in the language of groups) if and only if $\sigma$ is true in a…

A subgroup of a finite group is wide if each prime divisor of the group order divides the subgroup order. We obtain the description of finite soluble groups with no wide subgroups. We also prove that a finite soluble group with nilpotent…

Let $G$ be a finite group. In this short note, we give a criterion of nilpotency of $G$ based on the existence of elements of certain order in each section of $G$.

In this paper we consider a general way of constructing profinite struc- tures based on a given framework - a countable family of objects and a countable family of recognisers (e.g. formulas). The main theorem states: A subset of a family…

We study a conjecture by Deaconescu on the solubility of finite groups with claims that if more than half of the elements in a finite group has the same order $k$, then the group is soluble. We show that the original conjecture fails by…

A word $w$ is concise in a class of groups $\mathcal{C}$ if, for every group $G$ in $\mathcal{C}$, the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in $G$. This notion can be naturally extended to…

Let $ x $ be an element of a finite group $ G $ and denote the order of $ x $ by $ \mathrm{ord}(x) $. We consider a finite group $ G $ such that $ \gcd(\mathrm{ord}(x),\mathrm{ord}(y))\leqslant 2 $ for any two vanishing elements $ x $ and $…