English
Related papers

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

200 papers

We prove that a uniquely 2-divisible group that admits an almost regular involutory automorphism is solvable.

Group Theory · Mathematics 2010-09-03 Yoav Segev

We discuss the applications of fundamental groups (of complements of curves) computations (and possibly the computations of the second homotopy group as a model over it) to the classification of algebraic surface. We prove that the…

alg-geom · Mathematics 2008-02-03 Boris Moishezon , Mina Teicher

We consider the class of groups whose word problem is poly-context-free; that is, an intersection of finitely many context-free languages. We show that any group which is virtually a finitely generated subgroup of a direct product of free…

Group Theory · Mathematics 2015-10-09 Tara Brough

The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…

Logic in Computer Science · Computer Science 2007-05-23 Martin Ziegler , Klaus Meer

We begin by establishing two fundamental results on standard parabolic subgroups of virtual Artin groups. We first show that a standard parabolic subgroup is naturally isomorphic to a virtual Artin group. Second, we prove that the…

Group Theory · Mathematics 2026-03-02 José Gálvez Mateos , Federica Gavazzi , Luis Paris

In this paper we give new presentations of the braid groups and the pure braid groups of a closed surface. We also give an algorithm to solve the word problem in these groups, using the given presentations.

Geometric Topology · Mathematics 2007-05-23 Juan Gonzalez-Meneses

We introduce and study the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be…

Group Theory · Mathematics 2018-01-03 Sergei V. Ivanov

This paper gives a proof that the fundamental group of a class of closed orientable 3-manifolds constructed from three injective handlebodies has a solvable word problem. This is done by giving an algorithm to decide if a closed curve in…

Geometric Topology · Mathematics 2007-05-23 J. Coffey

We investigate the structure of finite groups whose non-central real class sizes have the same $2$-part. In particular, we prove that such groups are solvable and have $2$-length one. As a consequence, we show that a finite group is…

Group Theory · Mathematics 2019-02-13 Hung P. Tong-Viet

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…

Group Theory · Mathematics 2021-07-01 Arman Darbinyan

We investigate the class of regular-ordered word equations. In such equations, each variable occurs at most once in each side and the order of the variables occurring in both sides is the preserved (the variables can be, however, separated…

Formal Languages and Automata Theory · Computer Science 2017-03-01 Joel D. Day , Florin Manea , Dirk Nowotka

We give a brief survey of recent results on word maps on simple groups and polynomial maps on simple associative and Lie algebras. Our focus is on parallelism between these theories, allowing one to state many new open problems and giving…

Group Theory · Mathematics 2013-04-19 Alexey Kanel-Belov , Boris Kunyavskii , Eugene Plotkin

A generalized word in two positive definite matrices A and B is a finite product of nonzero real powers of A and B. Symmetric words in positive definite A and B are positive definite, and so for fxed B, we can view a symmetric word, S(A,B),…

Rings and Algebras · Mathematics 2007-05-23 Christopher J. Hillar , Charles R. Johnson

We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…

Group Theory · Mathematics 2007-05-23 J. -C. Birget , A. Yu. Olshanskii , E. Rips , M. Sapir

We prove that fundamental groups of orientable (geometrizable) 3-manifolds have a solvable conjugacy problem.

Group Theory · Mathematics 2013-08-14 Jean-Philippe Préaux

We prove that every countable group with solvable power problem embeds into a finitely presented 2-generated group with solvable power and conjugacy problems.

Group Theory · Mathematics 2007-05-23 A. Yu. Olshanskii , M. V. Sapir

We have proved in [Topology, 45 1 (2006)] that fundamental groups of oriented geometrizable 3-manifolds have a solvable conjugacy problem. We now consider the case of groups of non-oriented geometrizable 3-manifolds in order to conclude…

Group Theory · Mathematics 2007-05-23 Jean-Philippe Preaux

This is a summary of some of the basic facts about flat 2-orbifold groups, otherwise known as 2-dimensional crystallographic groups. We relate the geometric and topological presentations of these groups, and consider structures…

Group Theory · Mathematics 2017-08-15 J. A. Hillman

We prove that fundamental groups of non-orientable 3-manifolds have a solvable conjugacy problem, and construct an algorithm. Together with our earlier work on the conjugacy problem in groups on orientable geometrizable 3-manifolds, all…

Group Theory · Mathematics 2013-08-14 Jean-Philippe Préaux

For every integer g, we construct a 2-solvable and 2-bipolar knot whose topological 4-genus is greater than g. Note that 2-solvable knots are in particular algebraically slice and have vanishing Casson-Gordon obstructions. Similarly all…

Geometric Topology · Mathematics 2020-07-21 Jae Choon Cha , Allison N. Miller , Mark Powell