Titlebook: Combinatorial and Geometric Group Theory; Dortmund and Ottawa- Oleg Bogopolski,Inna Bumagin,Enric Ventura Conference proceedings 2010 Birkh

Thyroxine

珐琅

骚扰

An Application of Word Combinatorics to Decision Problems in Group Theory,f successful, implies that the subgroup under consideration has solvable membership problem with a simple solution. The proof of the solvability of the membership problem relies on word combinatorics in an essential way.

删减

蛙鸣声

聪明

,Limits of Thompson’s Group ,,e .., (.., x.) ∈ . ∈ N, be a family of groups isomorphic to . and marked by .+2 elements. If the sequence (..). is convergent in the space of marked groups and G is the corresponding limit we say that . is an .-limit group. The paper is devoted to a description of .-limit groups.

放弃

摇曳的微光

思乡病

不幸的人