Related papers: Equation satisfiability in solvable groups

Satisfiability is a classic problem in computational complexity theory, in which one wishes to determine whether an assignment of values to a collection of Boolean variables exists in which all of a collection of clauses composed of logical…

Let $G=F\ast_\varphi t$ be an HNN extension of a free group $F$ with two equal associated normal subgroups $H_1 = H_2$ of finite index. We prove that the word problem in $G$ is decidable in polynomial time. This result extends to the case…

Let $n>0$ be an integer and $\mathcal{X}$ be a class of groups. We say that a group $G$ satisfies the condition $(\mathcal{X},n)$ whenever in every subset with $n+1$ elements of $G$ there exist distinct elements $x,y$ such that $<x,y>$ is…

The following theorem is proved: Let $G$ be a finite group and $\pi_e(G)$ be the set of element orders in $G$. If $\pi_e(G) \cap \{2\}=\emptyset$; or $\pi_e(G) \cap \{3, 4\}=\emptyset$; or $\pi_e(G) \cap \{3,5\}=\emptyset$, then $G$ is…

All groups are 2-generator. For any prime-power q, Theorem 1 constructs a solvable matrix group over a quotient of a Laurent polynomial ring. This group is closely related to a group of exponent q as shown in Theorems 2 & 3 . Theorem 4 in…

Recently, M. Kompatscher proved that for each finite supernilpotent algebra $\mathbf{A}$ in a congruence modular variety, there is a polynomial time algorithm to solve polynomial equations over this algebra. Let $\mu$ be the maximal arity…

Considering a finite group $G$, for any element $x\in G$, the solvabilizer of $x$ in $G$ is defined as $Sol_G(x)=\{y \in G : \langle x, y \rangle \text{ is solvable}\}$. In this paper, we introduce $Solv(G)$ as the number of distinct…

In this paper, we will prove some sufficient conditions for the solvability of groups.

Every abelian (and even every nilpotent) group contains a solution of any finite unimodular system of equations over itself. However, this is not true for infinite systems. We deduced a criterion for a periodic abelian group to contain a…

Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this problem, we study the solvability of linear equation systems over finite groups and…

We investigate the structure of finite groups whose non-central real class sizes have the same $2$-part. In particular, we prove that such groups are solvable and have $2$-length one. As a consequence, we show that a finite group is…

The present note shows that $\mathcal{Q}$-groups in [H. Heineken and F.G. Russo, Groups described by element numbers, Forum Math. 27 (2015), 1961--1977] are solvable groups (not necessarily nilpotent) for which the equation $T_G(r,s)=0$ is…

We prove that the compressed word problem in a group that is hyperbolic relative to a collection of free abelian subgroups is solvable in polynomial time.

In the paper we characterize the class of finite solvable groups by two-variable identities in a way similar to the characterization of finite nilpotent groups by Engel identities. More precisely, a sequence of words $u_1,...,u_n,... $ is…

This paper is devoted to the complexity of the Boolean satisfiability problem. We consider a version of this problem, where the Boolean formula is specified in the conjunctive normal form. We prove an unexpected result that the…

Let G be a finite solvable group, and let h(G) denote its Fitting height, namely the length of a shortest normal series in G with nilpotent factors. We show, that any law in G has length at least h(G). This result is then used to improve a…

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…

Consider a nonsolvable finite group G, where R(G) represents the solvable radical of G. For any element x in G, the solvabilizer of x in G, denoted by Sol_G(x), is defined as the set of all elements y in G such that the subgroup generated…

We show that for any finite group $G$ and for any $d$ there exists a word $w\in F_{d}$ such that a $d$-tuple in $G$ satisfies $w$ if and only if it generates a solvable subgroup. In particular, if $G$ itself is not solvable, then it cannot…

We prove that, for every integer $n \ge 2$, a finite or infinite countable group $G$ can be embedded into a 2-generated group $H$ in such a way that the solvability of quadratic equations of length at most $n$ is preserved, i.e., every…