检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Yan WU Xiaoman CHEN
机构地区:[1]College of Mathematics Physics and Information Engineering, Jiaxing University, Jiaxing 314033, Zhejiang, China [2]School of Mathematical Sciences, Fudan University, Shanghai 200433, China
出 处:《Chinese Annals of Mathematics,Series B》2011年第6期863-884,共22页数学年刊(B辑英文版)
基 金:supported by the National Natural Science Foundation of China (No. 10731020);the Shanghai Natural Science Foundation of China (No. 09ZR1402000)
摘 要:The authors study the finite decomposition complexity of metric spaces of H, equipped with different metrics, where H is a subgroup of the linear group GL∞(E). It is proved that there is an injective Lipschitz map φ: (F, ds) --* (H,d), where F is the Thompson's group, ds the word-metric of F with respect to the finite generating set S and d a metric of H. But it is not a proper map. Meanwhile, it is proved that φ(F, ds) → (H, dl) is not a Lipschitz map, where dl is another metric of H.
关 键 词:Finite decomposition complexity Thompson's group F Word-metric Lipschitz map Reduced tree diagram
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.68