Skip to search formSkip to main contentSkip to account menu

Word problem for groups

Known as: Kuznetsov's theorem, Word problem 
In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a finitely generated group G is… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2019
Highly Cited
2019
  • Y. Lafont
  • 2019
  • Corpus ID: 14735650
Using rewriting techniques, we get a quite simple proof of undecidability of the word problem for groups (Novikov-Boone theorem). 
Highly Cited
2016
Highly Cited
2016
Using a systematic computer search, a simple four-dimensional chaotic flow was found that has the unusual feature of having a… 
Highly Cited
2014
Highly Cited
2014
  • Markus Lohrey
  • 2014
  • Corpus ID: 39525019
1. Preliminaries from Theoretical Computer Science.- 2. Preliminaries from Combinatorial Group Theory.- 3. Algorithms on… 
2010
2010
Let k be a field of characteristic zero. For a linear alge- braic group G over k acting on a scheme X, we define the equivariant… 
2004
2004
The equivariant K-theory was developed by R. Thomason in [21]. Let an algebraic group G act on a variety X over a field F . We… 
Highly Cited
2000
Highly Cited
2000
Given a row-finite k-graph Λ with no sources we investigate the K-theory of the higher rank graph C *-algebra, C * (Λ). When k… 
Highly Cited
1996
Highly Cited
1996
This paper presents extensions and improvements of recently developed algorithms for the numerical analysis of orbits homoclinic… 
1982
1982
There are many ways that group actions enter into algebraic K-theory and there are various theories that fit under the rubric of… 
1974
1974
The group described in the title is obtained as a quotient of a center-by-metabelian group constructed by P. Hall. It is well… 
Highly Cited
1973
Highly Cited
1973
where Az = A[z, z ] is the Laurent extension ring of A, with involution z h> z~. (Cf. Part III, [5], for the generalization to…