Related papers: On Thompson Problem

Let G be a totally disconnected, locally compact group admitting a contractive automorphism f. We prove a Jordan-Holder theorem for series of f-stable closed subgroups of G, classify all possible composition factors and deduce consequences…

A complete mapping of a group $G$ is a permutation $\phi:G\rightarrow G$ such that $g\mapsto g\phi(g)$ is also a permutation. Complete mappings of $G$ are equivalent to tranversals of the Cayley table of $G$, considered as a latin square.…

Let $X$ be a set and let $S$ be an inverse semigroup of partial bijections of $X$. Thus, an element of $S$ is a bijection between two subsets of $X$, and the set $S$ is required to be closed under the operations of taking inverses and…

The CSP of a first-order theory $T$ is the problem of deciding for a given finite set $S$ of atomic formulas whether $T \cup S$ is satisfiable. Let $T_1$ and $T_2$ be two theories with countably infinite models and disjoint signatures.…

In 1954 B. H. Neumann discovered that if $G$ is a group in which all conjugacy classes have finite cardinality at most $m$, then the derived group $G'$ is finite of $m$-bounded order. In 2018 G. Dierings and P. Shumyatsky showed that if…

It is shown that if T is a connected nontrivial graph and X is an arbitrary finite simplicial complex, then there is a graph G such that the complex Hom(T,G) is homotopy equivalent to X. The proof is constructive, and uses a nerve lemma.…

We call a tree $T$ is \emph{even} if every pair of its leaves is joined by a path of even length. Jackson and Yoshimoto~[J. Graph Theory, 2024] conjectured that every $r$-regular nonbipartite connected graph $G$ has a spanning even tree.…

Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. Under some restrictions on the number of conjugacy classes of (non-normal) maximal subgroups of $G$, we prove that if $\sigma_1(G)<\frac{117}{20}\,$, then $G$ is…

Recall that a group $G$ is said to be $\frac{3}{2}$-generated if every non-trivial element $g\in G$ has a co-generator in $G$ (i.e., an element which together with $g$ generates $G$). Thompson's group $V$ was proved to be…

A finite group of order divisible by 3 in which centralizers of 3-elements are 3-subgroups will be called a C{\theta}{\theta}-group. The prime graph (or Gruenberg-Kegel graph) of a finite group G is denoted by {\Gamma}(G) (or GK(G)) and its…

For every finitely generated recursively presented group G we construct a finitely presented group H containing G such that G is (Frattini) embedded into H and the group H has solvable conjugacy problem if and only if G has solvable…

We continue the study of prime graphs of finite groups, also known as Gruenberg-Kegel graphs. The vertices of the prime graph of a finite group are the prime divisors of the group order, and two vertices $p$ and $q$ are connected by an edge…

In his papers [2], [3] Brin introduced the higher dimensional Thompson groups nV which are generalizations to the Thompson's group V of self-homeomorphisms of the Cantor set and found a finite set of generators and relations in the case n =…

Let $F$ be a free group of finite rank. We say that the monomorphism problem in $F$ is decidable if for any two elements $u$ and $v$ in $F$, there is an algorithm that determines whether there exists a monomorphism of $F$ that sends $u$ to…

For a finite group $G,$ we investigate the direct graph $\Gamma(G),$ whose vertices are the non-hypercentral elements of $G$ and where there is an edge $x\mapsto y$ if and only if $[x,_ny]=1$ for some $n \in \mathbb N.$ We prove that…

In this article the study of the Prime Graph Question for the integral group ring of almost simple groups which have an order divisible by exactly $4$ different primes is continued. We provide more details on the recently developed "lattice…

We study the zero-sharing behavior among irreducible characters of a finite group. For symmetric groups $S_n$, it is proved that, with one exception, any two irreducible characters have at least one common zero. To further explore this…

We classify finite groups in which the centralisers of certain non-central elements are soluble. This includes a full structural description of groups whose non-central element centralisers are all soluble, and a reduction theorem for the…

In this sequel paper, we continue the analysis of the prime order element graph $\Gamma(G)$ of a finite group $G$, where vertices are elements of $G$ and edges connect distinct elements $x, y$ satisfying $\circ(xy) = p$ for some prime $p$.…

A group $G$ is integrable if it is isomorphic to the derived subgroup of a group $H$; that is, if $H'\simeq G$, and in this case $H$ is an integral of $G$. If $G$ is a subgroup of $U$, we say that $G$ is integrable within $U$ if $G=H'$ for…