Related papers: A finitely presented orderable group with insolubl…

We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…

We prove that in an arbitrary semigroup without cycles, the problem of divisibility and, therefore, the word problem is solvable.

We address the problem of finding necessary and sufficient conditions for an arbitrary group, not necessarily finite, to admit a faithful irreducible representation over an arbitrary field.

An integral of a group $G$ is a group $H$ whose commutator subgroup is isomorphic to $G$. In this paper, we prove that the integrability of a finite group is a decidable problem.

Decomposable ordered structures were introduced in \cite{OnSt} to develop a general framework to study `finite-dimensional' totally ordered structures. This paper continues this work to include decomposable structures on which a ordered…

We introduce a formalism of infinite, linearly ordered products in general groups. Using this, we define infinite compositions in certain groups of formal power series such as transseries. We show that such groups can sometimes be…

We study word structures of the form $(D,<,P)$ where $D$ is either $\mathbb{N}$ or $\mathbb{Z}$, $<$ is the natural linear ordering on $D$ and $P\subseteq D$ is a predicate on $D$. In particular we show: (a) The set of recursive…

We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated…

We determine the structure of the finite non-solvable groups of order divisible by $3$ all whose maximal subgroups of order divisible by $3$ are supersolvable. Precisely, we demonstrate that if $G$ is a finite non-solvable group satisfying…

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…

An algorithm for computing power conjugate presentations for finite soluble quotients of predetermined structure of finitely presented groups is described. Practical aspects of an implementation are discussed.

We show that a finite group $G$ admitting an automorphism $\alpha$ such that the function $G\rightarrow G$, $g\mapsto g\alpha(g)$, is bijective is necessarily solvable.

For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike…

We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…

In various classes of infinite groups, we identify groups that are presentable by products, i.e. groups having finite index subgroups which are quotients of products of two commuting infinite subgroups. The classes we discuss here include…

We define the notion of accessibility for a pro-$p$ group. We prove that finitely generated pro-$p$ groups are accessible given a bound on the size of their finite subgroups. We then construct a finitely generated inaccessible pro-$p$…

The conjugacy problem for a finitely generated group $G$ is the two-variable problem of deciding for an arbitrary pair $(u,v)$ of elements of $G$, whether or not $u$ is conjugate to $v$ in $G$. We construct examples of finitely generated,…

Let $S$ be a closed surface and $\text{Diff}_{\text{Vol}}(S)$ be the group of volume preserving diffeomorphisms of $S$. A finitely generated group $G$ is periodic of bounded exponent if there exists $k \in \mathbb{N}$ such that every…

We construct an uncountable family of 3-generated residually finite just-infinite groups with isomorphic profinite completions. We also show that word growth rate is not a profinite property.

An l-group G is an abelian group equipped with a translation invariant lattice order. Baker and Beynon proved that G is finitely generated projective iff it is finitely presented. A unital l-group is an l-group G with a distinguished order…