Related papers: Constructing regular saturated formations of finit…

We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…

William W. Boone and Graham Higman proved that a finitely generated group has soluble word problem if and only if it can be embedded in a simple group that can be embedded in a finitely presented group. We prove the exact analogue for…

It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…

A subgroup $A$ of a finite group $G$ is said to be a $CAP$-subgroup of $G$, if for any chief factor $H/K$ of $G$, either $A H= AK$ or $A\cap H = A \cap K$. Let $p$ be a prime, $S$ be a $p$-group and $\mathcal{F}$ be a saturated fusion…

Given a finite group $G$, we denote by $L(G)$ the subgroup lattice of $G$ and by ${\rm Isolated}(G)$ the set of isolated subgroups of $G$. In this note, we describe finite groups $G$ such that $|{\rm Isolated}(G)|=|L(G)|-k$, where…

We show that the number of conjugacy classes of maximal finite subgroups of a lattice in a semisimple Lie group is linearly bounded by the covolume of the lattice. Moreover, for higher rank groups, we show that this number grows sublinearly…

A theorem of Dolfi, Herzog, Kaplan, and Lev \cite[Thm.~C]{DHKL} asserts that in a finite group with trivial Fitting subgroup, the size of the soluble residual of the group is bounded from below by a certain power of the group order, and…

A finite group is called $\psi$-divisible iff $\psi(H)|\psi(G)$ for any subgroup $H$ of a finite group $G$. Here, $\psi(G)$ is the sum of element orders of $G$. For now, the only known examples of such groups are the cyclic ones of…

Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…

The prime graph $\Gamma(G)$ of a finite group $G$ (also known as the Gruenberg-Kegel graph) has as its vertices the prime divisors of $|G|$, and $p\text-q$ is an edge in $\Gamma(G)$ if and only if $G$ has an element of order $pq$. Since…

We introduce a new canonical form of lattices called the systematic normal form (SNF). We show that for every lattice there is an efficiently computable "nearby" SNF lattice, such that for any lattice one can solve lattice problems on its…

The study of localizations of groups has concentrated on group theoretic properties which are preserved by localization. In this paper we look at finitely generated soluble groups and determine when the local groups associated with them are…

A remarkable result of Thompson states that a finite group is soluble if and only if its two-generated subgroups are soluble. This result has been generalized in numerous ways, and it is in the core of a wide area of research in the theory…

Given a finite group $G$, the invariably generating graph of $G$ is defined as the undirected graph in which the vertices are the nontrivial conjugacy classes of $G$, and two classes are adjacent if and only if they invariably generate $G$.…

Given a positive definite even lattice and a commutative ring, there is a standard construction of a lattice vertex algebra over the commutative ring, and it admits a natural grading by non-negative integers. We describe the groups of…

Let $G$ be a non-compact semisimple Lie group with finite centre and finitely many components. We show that any finitely generated group $\Gamma$ which is quasi-isometric to an irreducible lattice in $G$ has the $R_\infty$-property, namely,…

A free-by-cyclic group $F_N\rtimes_\phi\mathbb{Z}$ has non-trivial centre if and only if $[\phi]$ has finite order in ${\rm{Out}}(F_N)$. We establish a profinite ridigity result for such groups: if $\Gamma_1$ is a free-by-cyclic group with…

We study a class $\mathfrak{M}$ of cyclically presented groups that includes both finite and infinite groups and is defined by a certain combinatorial condition on the defining relations. This class includes many finite metacyclic…

Graph products of monoids provide a common framework for direct and free products, and graph monoids (also known as free partially commutative monoids). If the monoids in question are groups, then any graph product is, of course, a group.…

For a finite group $G$, let $\psi(G)$ be the sum of the orders of its elements, and define the corresponding normalized sum as $\psi'(G) := \psi(G)/\psi(\mathcal{C}_{|G|})$, where $\mathcal{C}_{|G|}$ is the cyclic group of the same order as…