Related papers: Some notes on extended equation solvability and id…

We construct an extension $E(A,G)$ of a given group $G$ by infinite non-Archimedean words over an discretely ordered abelian group like $Z^n$. This yields an effective and uniform method to study various groups that "behave like $G$". We…

Let $p$ be a prime number and suppose that every maximal subgroup of a finite group is either $p$-nilpotent or has prime index. Such group need not be $p$-solvable, and we study its structure by proving that only one nonabelian simple group…

We obtain a characterization of the binary commutator on completely simple semigroups, using their Rees matrix representation. Consequently, we prove that a regular semigroup is nilpotent (solvable) if and only if it is simple, and all its…

Let $G$ be a finite group admitting a coprime automorphism $\alpha$. Let $J_G(\alpha)$ denote the set of all commutators $[x,\alpha]$, where $x$ belongs to an $\alpha$-invariant Sylow subgroup of $G$. We show that $[G,\alpha]$ is soluble or…

We generalize the positive solution of the Frobenius conjecture and refinements thereof by studying the structure of groups that admit a fix-point-free automorphism satisfying an identity. We show, in particular, that for every polynomial…

A long standing open problem in the theory of hyperfinite equivalence relations asks if the orbit equivalence relation generated by a Borel action of a countable amenable group is hyperfinite. In this paper we show that this question has a…

We consider expansive group actions on a compact metric space containing a special fixed point denoted by $0$, and endomorphisms of such systems whose forward trajectories are attracted toward $0$. Such endomorphisms are called…

We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…

While efficient algorithms are known for solving many important problems related to groups, no efficient algorithm is known for determining whether two arbitrary groups are isomorphic. The particular case of 2-nilpotent groups, a special…

We study the groups $G$ with the curious property that there exists an element $k\in G$ and a function $f\colon G\to G$ such that $f(xk)=xf(x)$ holds for all $x\in G$. This property arose from the study of near-rings and input-output…

A basic fact taught in undergraduate algebra courses is that every finite nilpotent group is a direct product of $p$-groups. Already Bruck observed that this does not generalize to loops. In particular, there exist nilpotent loops of size…

In this paper we investigate formal verification problems for Neural Network computations. Various reachability problems will be in the focus, such as: Given symbolic specifications of allowed inputs and outputs in form of Linear…

In this paper we study expansions of infinite dimensional Hilbert spaces with a unitary representation of a discrete countable group. When the group is finite, we prove the theory of the corresponding expansion, regardless if it is…

In 1968, John Thompson proved that a finite group $G$ is solvable if and only if every $2$-generator subgroup of $G$ is solvable. In this paper, we prove that solvability of a finite group $G$ is guaranteed by a seemingly weaker condition:…

The structure of a group which is not nilpotent but all of whose proper subgroups are nilpotent has interested the researches of several authors both in the finite case and in the infinite case. The present paper generalizes some classic…

Hom-Lie algebras are generalizations of Lie algebras that arise naturally in the study of nonassociative algebraic structures. In this paper, the concepts of solvable and nilpotent Hom-Lie algebras studied further. In the theory of groups,…

We give infinite triangularization and strict triangularization results for algebras of operators on infinite dimensional vector spaces. We introduce a class of algebras we call Ore-solvable algebras: these are similar to iterated Ore…

We study the class of groups having the property that every non-nilpotent subgroup is equal to its normalizer. These groups are either soluble or perfect. We completely describe the structure of soluble groups and finite perfect groups with…

A theorem of Z. Arad and E. Fisman establishes that if $A$ and $B$ are two conjugacy classes of a finite group $G$ such that either $AB=A\cup B$ or $AB=A^{-1} \cup B$, then $G$ cannot be non-abelian simple. We demonstrate that, in fact,…

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…