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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Abstract Pairwise comparisons have been a long-standing technique for comparing alternatives/criteria and their role has been… 
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… 
2014
2014
  • Markus Lohrey
  • Springer Briefs in Mathematics
  • 2014
  • Corpus ID: 39525019
1. Preliminaries from Theoretical Computer Science.- 2. Preliminaries from Combinatorial Group Theory.- 3. Algorithms on… 
2012
2012
We consider the algebraic K-theory of a truncated polynomial algebra in several commuting variables, K(k[x_1, ..., x_n]/(x_1^a_1… 
2012
2012
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… 
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… 
1982
1982
If the fundamental problem of mathematics is to decide when two things are the same, then the fundamental problem of group theory… 
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…