图递归集的Packing的测度  

Packing Measure On Graph Directed Construction

作　　者：姜景莲[1] 

机构地区：[1]福建省南平师范高等专科学校数学系,福建南平35000

出　　处：《培训与研究（湖北教育学院学报）》2002年第2期11-12,共2页Training and Research-Journal of Hubei College of Education

摘　　要：本文考虑Mauldin和Willian在[1]中定义的Rd中的图递归集K的Packing测度,证明了K的α-Packing测度δα（K）是正有限的。This paper consider the realization of graph directed construction which are stated by Mauldin and William on [1], We prove: the a - packing measure of K is finite and positive.

关 键 词：图递归集 Packing测度 正有限 概率测度 维数 

分 类 号：O141.3[理学—数学] O174.[理学—基础数学]