Related papers: $2$-stratifold groups have solvable Word Problem

We consider collections of disjoint simple closed curves in a compact orientable surface which decompose the surface into pairs of pants. The isotopy classes of such curve systems form the vertices of a 2-complex, whose edges correspond to…

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 simpler proof using automata theory of a recent result of Kapovich, Weidmann and Myasnikov according to which so-called benign graphs of groups preserve decidability of the generalized word problem. These include graphs of groups…

We study two modifications of the Post Correspondence Problem (PCP), namely 1) the bi-infinite version, where it is asked whether there exists a bi-infinite word such that two given morphisms agree on it, and 2) the conjugate version, where…

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…

We settle the automorphism groups of curves appearing in a classification list of smooth plane curves with at least two Galois points. One of them is an ordinary curve whose automorphism group exceeds the Hurwitz bound.

The \emph{word problem} of a group $G = \langle \Sigma \rangle$ can be defined as the set of formal words in $\Sigma^*$ that represent the identity in $G$. When viewed as formal languages, this gives a strong connection between classes of…

We present an algorithm which given a presentation of a group $G$ without 2-torsion, a solution to the word problem with respect to this presentation, and an acylindricity constant ${\kappa}$, outputs a collection of tracks in an…

Let v and w be nontrivial words in two free groups. We prove that, for all sufficiently large finite non-abelian simple groups G, there exist subsets C of v(G) and D of w(G) of size such that every element of G can be realized in at least…

There is a long line of research in the literature dedicated to word-representable graphs, which generalize several important classes of graphs. However, not much is known about word-representability of split graphs, another important class…

Surface groups are known to be the Poincar\'e Duality groups of dimension two since the work of Eckmann, Linnell and M\"uller. We prove a prosolvable analogue of this result that allows us to show that surface groups are profinitely (and…

We show that any finitely presented group with an index two subgroup is realized as the fundamental group of a closed smooth non-orientable four-manifold that admits an exotic smooth structure, which is obtained by performing a Gluck twist.…

A group is boundedly simple if, for some constant N, every nontrivial conjugacy class generates the whole group in N steps. For a large class of trees, Tits proved simplicity of a canonical subgroup of the automorphism group, which is…

Anisimov and Seifert show that a group has a regular word problem ifand only if it is finite. Muller and Schupp (together with Dunwoody's accessibility result) show that a group has context free word problem if and only if it is virtually…

The probabilistic Waring problem for finite simple groups asks whether every word of the form $w_1w_2$, where $w_1$ and $w_2$ are non-trivial words in disjoint sets of variables, induces almost uniform distribution on finite simple groups…

We develop a combinatorial approach to the study of semigroups and monoids with finite presentations satisfying small overlap conditions. In contrast to existing geometric methods, our approach facilitates a sequential left-right analysis…

In [Akbari and Moghaddamfar, Recognizing by order and degree pattern of some projective special linear groups, {\it Internat. J. Algebra Comput.}, 2012] the authors possed the following problem: \\ {\bf Problem.} {\it Is there a simple…

We give an $O(n \log^3(n))$-time algorithm for the word problem in the mapping class group of a compact surface.

A new presentation of the $n$-string braid group $B_n$ is studied. Using it, a new solution to the word problem in $B_n$ is obtained which retains most of the desirable features of the Garside-Thurston solution, and at the same time makes…

We study closed, oriented 4-manifolds whose fundamental group is that of a closed, oriented, aspherical 3-manifold. We show that two such 4-manifolds are stably diffeomorphic if and only if they have the same w_2-type and their equivariant…