Related papers: Finding non-trivial elements and splittings in gro…
We consider several types of non-existence theorems for functors. For example, there are no nontrivial functors from the category of groups (or the category of pointed sets, or vector spaces) to any small category. Another type of questions…
We construct a finitely generated group that does not satisfy the generalized Burghelea conjecture.
Consider a group $G$ acting nicely on a simply-connected simplicial complex $X$. Numerous classical methods exist for using this group action to produce a presentation for $G$. For the case that $X/G$ is 2-connected, we give a new method…
The centrepiece of this paper is a normal form for primitive elements which facilitates the use of induction arguments to prove properties of primitive elements. The normal form arises from an elementary algorithm for constructing a…
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 give a simple algorithm to solve the subgroup membership problem for virtually free groups. For a fixed virtually free group with a fixed generating set $X$, the subgroup membership problem is uniformly solvable in time $O(n\log^*(n))$…
Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. In the present paper we employ the…
For any finite type connected surface $S$, we give an infinite presentation of the fundamental group $\pi_1(S,\ast)$ of $S$ based at an interior point $\ast\in{S}$ whose generators are represented by simple loops. When $S$ is…
We exhibit a 6-element semigroup that has no finite identity basis but nevertheless generates a variety whose finite membership problem admits a polynomial algorithm.
We provide an algorithm that computes a set of generators for any complete ideal in a smooth complex surface. More interestingly, these generators admit a presentation as monomials in a set of maximal contact elements associated to the…
We give an explicit description of the free objects in the quasivariety of adequate semigroups, as sets of labelled directed trees under a natural combinatorial multiplication. The morphisms of the free adequate semigroup onto the free…
We construct uncountably many discrete groups of type $FP$; in particular we construct groups of type $FP$ that do not embed in any finitely presented group. We compute the ordinary, $\ell^2$- and compactly-supported cohomology of these…
Let $F$ be a finitely generated free group and let $H\le F$ be a finitely generated subgroup. Given an element $g\in F$, we study the ideal $\mathfrak{I}_g$ of equations for $g$ with coefficients in $H$, i.e. the elements $w(x)\in H*\langle…
The following results are proved: The center of any finite index subgroup of an irreducible, infinite, non-affine Coxeter group is trivial; Any finite index subgroup of an irreducible, infinite, non-affine Coxeter group cannot be expressed…
In this paper, we construct an infinite presentation of the Torelli subgroup of the mapping class group of a surface whose generators consist of the set of all "separating twists", all "bounding pair maps", and all "commutators of simply…
Hard instances of natural computational problems are often elusive. In this note we present an example of a natural decision problem, the word problem for a certain finitely presented group, whose hard instances are easy to find. More…
Let K be a nontrivial knot in the 3-sphere with the exterior E(K), and u in G(K), the fundamental group of E(K), a slope element represented by an essential simple closed curve on the boundary of E(K). Since the normal closure of u in G(K)…
We prove that the word problem for the infinite cyclic group is not EDT0L, and obtain as a corollary that a finitely generated group with EDT0L word problem must be torsion. In addition, we show that the property of having an EDT0L word…
In this work we employ machine learning to understand structured mathematical data involving finite groups and derive a theorem about necessary properties of generators of finite simple groups. We create a database of all 2-generated…
We show that the finitely generated simple left orderable groups $G_{\rho}$ constructed by the first two authors in arXiv:1807.06478 are uniformly perfect - each element in the group can be expressed as a product of three commutators of…