Related papers: Equation satisfiability in solvable groups

This is the latest in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. In the previous papers, we have proved that the sat CNF problem is polynomially reduced to the problem of finding a…

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 $…

We consider a combinatorial problem occurring naturally in a group theoretical setting and provide a constructive solution in a special case. More precisely, in 1999 the author established a logarithmic bound for the derived length of the…

We give a complete complexity classification for the problem of finding a solution to a given system of equations over a fixed finite monoid, given that a solution over a more restricted monoid exists. As a corollary, we obtain a complexity…

Let $\lambda(G)$ be the maximum number of subgroups in an irredundant covering of the finite group $G$. We prove that if $G$ is a group with $\lambda(G) \leqslant 6$, then $G$ is supersolvable. We also describe the structure of the groups…

A special case of the satisfiability problem, in which the clauses have a hierarchical structure, is shown to be solvable in linear time, assuming that the clauses have been represented in a convenient way.

Given a finite group $G,$ we denote by $\Delta(G)$ the graph whose vertices are the proper subgroups of $G$ and in which two vertices $H$ and $K$ are joined by an edge if and only if $G=\langle H,K\rangle.$ We prove that if there exists a…

Two finite groups $L_1$ and $L_2$ are compatible if there exists a finite group $G$ with isomorphic normal subgroups $N_1$ and $N_2$ such that $L_1\cong G/N_1$ and $L_2\cong G/N_2$. We prove a new sufficient condition for two groups to be…

A conjecture of Boone and Higman from the 1970's asserts that a finitely generated group $G$ has solvable word problem if and only if $G$ can be embedded into a finitely presented simple group. We comment on the history of this conjecture…

In this note, we show that the satisfiability of equations and inequations with recognisable constraints is decidable in groups that are virtually direct products of finitely many hyperbolic groups.

Let $G$ be a finite group, and let $V$ be a completely reducible faithful $G$-module. By a result of Glauberman it has been known for a long time that if $G$ is nilpotent of class 2, then $|G| < |V|$. In this paper we generalize this result…

Sabatini (2024) defined a subgroup $H$ of $G$ to be an exponential subgroup if $x^{|G:H|} \in H$ for all $x \in G$. Exponential subgroups are a generalization of normal (and subnormal) subgroups: all subnormal subgroups are exponential, but…

Quantum logic was introduced in 1936 by Garrett Birkhoff and John von Neumann as a framework for capturing the logical peculiarities of quantum observables. It generalizes, and on 1-dimensional Hilbert space coincides with, Boolean…

In this paper we begin the systematic study of group equations with abelian predicates in the main classes of groups where solving equations is possible. We extend the line of work on word equations with length constraints, and more…

Let $R=K[G]$ be a group ring of a group $G$ over a field $K$. It is known that if $G$ is amenable then $R$ satisfies the Ore condition: for any $a,b\in R$ there exist $u,v\in R$ such that $au=bv$, where $u\ne0$ or $v\ne0$. It is also true…

Two finite groups are said to have the same order type if for each positive integer $n$ both groups have the same number of elements of order $n$. In 1987 John G. Thompson asked if in this case the solvability of one group implies the…

For a finite group $G$, we study the probability $sp(G)$ that, given two elements $x,y \in G$, the cyclic subgroup $\langle x \rangle$ is subnormal in the subgroup $\langle x, y \rangle$. This can be seen as an intermediate invariant…

The complexity of solving equations over finite groups has been an active area of research over the last two decades, starting with Goldmann and Russell, \emph{The complexity of solving equations over finite groups} from 1999. One important…

We prove the following version of Milnor's theorem on solvable groups of exponential growth: A finitely generated solvable group which is not polycyclic contains an ascending HNN extension. Consequently, a finitely generated solvable group…

There are several variants of the inverse Galois problem which involve restrictions on ramification. In this paper we give sufficient conditions that a given finite group $G$ occurs infinitely often as a Galois group over the rationals…