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.
2016
2016
We study certain triangulated categories of $K$-motives $DK(-)$ over a wide class of base schemes, and define certain "weights… 
2015
2015
The stability analysis is used in order to identify and to map different dynamics of Chua’s circuit in full four-parameter spaces… 
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… 
2009
2009
We compute the K-theory of ring C*-algebras for polynomial rings over finite fields. The key ingredient is a duality theorem… 
2007
2007
The paper presents theorems characterizing concept lattices which happen to be trees after removing the bottom element. Concept… 
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… 
1973
1973
The object of this paper is to show that, given any total recursive function g, one can effectively construct a Thue system T…