Related papers: On an algorithm to decide whether a free group is …

A group $G$ is invariably generated by a subset $S$ of $G$ if $G= s^{g(s)} \mid s\in S$ for each choice of $g(s) \in G$, $s \in S$. Answering two questions posed by Kantor, Lubotzky and Shalev, we prove that the free prosoluble group of…

We prove that Thompson's group $F$ has a subgroup $H$ such that the conjugacy problem in $H$ is undecidable and the membership problem in $H$ is easily decidable. The subgroup $H$ of $F$ is a closed subgroup of $F$. That is, every function…

A word in a free group is called ``potentially positive'' if it is automorphic to an element which is written with only positive exponents. We will develop automata to analyze properties of potentially positive words. We will use these to…

This article finds the answer to the question: for any problem from which a non-deterministic algorithm can be derived which verifies whether an answer is correct or not in polynomial time (complexity class NP), is it possible to create an…

The set of idempotents of any semigroup carries the structure of a biordered set, which contains a great deal of information concerning the idempotent generated subsemigroup of the semigroup in question. This leads to the construction of a…

Let $F$ be a finite-rank free group and $H$ be a finite-rank subgroup of $F$. We discuss proofs of two algorithms that sandwich $H$ between an upper-layer free-product factor of $F$ that contains $H$ and a lower-layer free-product factor of…

Free products of two residually finite groups with amalgamated retracts are considered. It is proved that a cyclic subgroup of such a group is not finitely separable if, and only if, it is conjugated with a subgroup of a free factor which…

We develop an algorithm for recognizing whether a character belongs to $\Sigma^m$. In order to apply it we just need to know that the ambient group is of type $\mathrm{FP}_m$ or of type $\mathrm{F}_2$ and that the word problem is solvable…

We show that a free-by-cyclic group with a polynomially growing monodromy is subgroup separable exactly when it is virtually $F_n \times \mathbb{Z}$. We also prove that random deficiency 1 groups are not subgroup separable with positive…

Given a right-infinite word $\bf x$ over a finite alphabet $A$, the rank of $\bf x$ is the size of the smallest set $S$ of words over $A$ such that $\bf x$ can be realized as an infinite concatenation of words in $S$. We show that the…

We study the freeness problem for matrix semigroups. We show that the freeness problem is decidable for upper-triangular $2\times 2$ matrices with rational entries when the products are restricted to certain bounded languages.

In [J. Algebra 452 (2016), 372-389], we characterise when the sequence of free subgroup numbers of a finitely generated virtually free group $\Gamma$ is ultimately periodic modulo a given prime power. Here, we show that, in the remaining…

The Hanna Neumann conjecture states that if F is a free group, then for all nontrivial finitely generated subgroups H,K <= F, rank(H intersect K) - 1 <= [rank(H)-1] [rank(K)-1]. Where most papers to date have considered a direct graph…

We construct and study finitely presented groups with quadratic Dehn function (QD-groups) and present the following applications of the method developed in our recent papers. (1) The isomorphism problem is undecidable in the class of…

We answer a question raised by Pillay, that is whether the infinite weight of the generic type of the free group is witnessed in $F_{\omega}$. We also prove that the set of primitive elements in finite rank free groups is not uniformly…

General factors are a generalization of matchings. Given a graph $G$ with a set $\pi(v)$ of feasible degrees, called a degree constraint, for each vertex $v$ of $G$, the general factor problem is to find a (spanning) subgraph $F$ of $G$…

Using an analogy with the rank theorem in differential geometry, it is shown that for a finite $n$-tuple $X$ in a tracial von Neumann algebra and any finite $m$-tuple $F$ of $*$-polynomials in $n$ noncommuting indeterminates,…

We give an algorithm to solve the Conjugacy Problem for ascending HNN-extensions of free groups. To do this, we give algorithms to solve certain problems on dynamics of free group endomorphisms.

In this paper we study the problem of efficiently factorizing polynomials in the free noncommutative ring F of polynomials in noncommuting variables x1,x2,...,xn over the field F. We obtain the following result Given a noncommutative…

Consider a relatively hyperbolic group G. We prove that if G is finitely presented, so are its parabolic subgroups. Moreover, a presentation of the parabolic subgroups can be found algorithmically from a presentation of G, a solution of its…