Related papers: Solution of the word problem for semigroups withou…
We exhibit infinitely many natural numbers $n$ for which there exists at least one insolvable group of order $n$, and yet the holomorph of any solvable group of order $n$ has no insolvable regular subgroup. We also solve Problem 19.90 (d)…
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…
The main objective of this paper is the following two results. (1) There exists a computable bi-orderable group that does not have a computable bi-ordering; (2) There exists a bi-orderable, two-generated recursively presented solvable group…
This note addresses the issue as to which ceers can be realized by word problems of computably enumerable (or, simply, c.e.) structures (such as c.e. semigroups, groups, and rings), where being realized means to fall in the same…
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: G is…
In this paper, the Identity Problem for certain groups, which asks if the subsemigroup generated by a given finite set of elements contains the identity element, is related to problems regarding ordered groups. Notably, the Identity Problem…
Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. In this paper, we prove that if $\sigma_1(G)<2+\frac{11}{|G|}$\,, then $G$ is supersolvable. In particular, some new characterizations of the well-known groups…
We give a classification of semisimple and separable algebras in a multi-fusion category over an arbitrary field in analogy to Wedderben-Artin theorem in classical algebras. It turns out that, if the multi-fusion category admits a…
We show that any subgroup of a (virtually) nilpotent-by-polycyclic group satisfies the bounded packing property of Hruska-Wise. In particular, the same is true about metabelian groups and linear solvable groups. However, we find an example…
We give a new proof of Quillen's conjecture for solvable groups via a geometric and explicit method. For p-solvable groups, we provide both a new proof using the Classification of Finite Simple Groups and an asymptotic version without…
In the literature two notions of the word problem for a variety occur. A variety has a decidable word problem if every finitely presented algebra in the variety has a decidable word problem. It has a uniformly decidable word problem if…
In the lambda calculus a term is solvable iff it is operationally relevant. Solvable terms are a superset of the terms that convert to a final result called normal form. Unsolvable terms are operationally irrelevant and can be equated…
Separation is a classical problem in mathematics and computer science. It asks whether, given two sets belonging to some class, it is possible to separate them by another set of a smaller class. We present and discuss the separation problem…
A semigroup is completely simple if it has no proper ideals and contains a primitive idempotent. We say that a completely simple semigroup $S$ is a homogeneous completely simple semigroup if any isomorphism between finitely generated…
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…
*by a standard (one-tape) Turing machine. It is well-known that the word problem for hyperbolic groups, whence in particular for free groups, can be solved in linear time. However, these algorithms run on machines more complicated than a…
This paper deals with a nonhomogeneous scalar parabolic equation with possibly degenerate diffusion term; the process has only one stationary state. The equation can be interpreted as modeling collective movements (crowd dynamics, for…
We give a new criterion for solvability of group equations, providing proofs of various generalizations of the Kervaire-Laudenbach conjecture for Connes-embeddable groups.
We prove that the finitely presentable subgroups of residually free groups are separable and that the subgroups of type $\mathrm{FP}_\infty$ are virtual retracts. We describe a uniform solution to the membership problem for finitely…
We show that there exists an algorithm to decide any single equation in the Heisenberg group in finite time. The method works for all two-step nilpotent groups with rank-one commutator, which includes the higher Heisenberg groups. We also…