科研之友
微信
新浪微博
Facebook
分享链接
摘要
We introduce a topological property for finitely generated groups, called stackable, that implies the existence of an inductive procedure for constructing van Kampen diagrams with respect to a particular finite presentation. We also define algorithmically stackable groups, for which this procedure is an algorithm. This property gives a common model for algorithms arising from both rewriting systems and almost convexity for groups.
- 出版日期2015-9
