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.
2014
2014
This work is a contribution to the theory of products of i¬nite groups. A group G = AB is a weakly totally permutable product… 
2012
2012
A B-group is a group such that all its minimal generating sets (with respect to inclusion) have the same size. We prove that the… 
2001
2001
Let 6 be free products of countably many cyclic groups and let C(X ) ◊ denote the crossed product related to an action of on a… 
2001
2001
where DZ is the diffusion coefficient of the mixture fraction. The scalar dissipation rate appears in many models for turbulent… 
2000
2000
Let G be an N-group, where N is a zero-symmetric right near-ring. We introduce and study the concepts of direct system, inverse… 
1999
1999
  • Jie Wang
  • 1999
  • Corpus ID: 25490688
This paper studies the word problem for finitely presented groups under the restriction that words can only be rewritten for a… 
1998
1998
Theoretical investigations of finite amplitude wave propagation from bounded beam sources has been considered by Lee and Hamilton… 
1992
1992
© Société mathématique de France, 1992, tous droits réservés. L’accès aux archives de la collection « Astérisque » (http://smf4… 
1990
1990
We apply rewriting techniques to the generalized word problem for groups. Let R be a finite string-rewriting system on an…