关于可数点集的盒维数的一些探讨  

ON THE BOX-COUNTING OF COUNTABLE SETS

作　　者：吴栩[1] 

机构地区：[1]华南理工大学工商管理学院,广东广州510640

出　　处：《数学杂志》2014年第5期941-946,共6页Journal of Mathematics

基　　金：国家社会科学青年基金资助(12CJY006);教育部人文社科规划基金资助(10YJA630131);中央高校基本科研业务费专项资金(x2jimD2118850)

摘　　要：本文研究了一类可数点集的盒维数的计算问题.通过构造双Lipschitz映射,把原可数点集的盒维数的求解问题转化为求解一类相对简单的可数点集的盒维数.获得了两个单调的可数点集在具有同阶间隔时具有相同的上盒维数和下盒维数的结论.该结论为计算一类可数点集的盒维数提供了方便.In this paper, we investigate a class of countable sets＇Box-counting computation. By constructing double Lipschitz map, we transform the solution of the original countable sets＇Box-counting problem into the solution of a class of simpler countable sets＇Box-counting problem. Finally, it is obtianed that a couple of monotonous countable sets have identical up Box-counting and down Box-counting when their interval orders are the same. The conclusion provides great convenience for computing a

关 键 词：盒维数 可数点集 单调 

分 类 号：O174.11[理学—数学]