搜索结果: 1-1 共查到“泛函分析 Complexity”相关记录1条 . 查询时间(0.146 秒)
On finite decomposition complexity of Thompson's group F
Thompson's group F Finite decomposition complexity Word-metric Exact metric spaces Reduced forest diagram
2011/10/20
Finite decomposition complexity m(FDC) is a large scale property of a metricspace. It generalizes finite asymptoticdimension and applies to a wide class of groups. To make the property quantitative, a...