Exact packing dimension in random recursive constructions (Q1408497)

The problem of determining the exact packing measure of the random fractals defined by random recursive constructions has been studied by \textit{A. Berlinkov} and \textit{R. D. Mauldin} [J. Theor. Probab. 15 , 695--713 (2002; Zbl 1010.60010)] and \textit{Q. Liu} [Stochastic Processes Appl. 85, 19--28 (2000; Zbl 0996.60094)]. Their results partially verify the folklore that an exact packing measure function exists or not according to whether the small tail of \(X\) has exponential or polynomial decays, where \(X\) is the limit of a related martingale introduced in the seminal paper of \textit{R.D. Mauldin} and \textit{S. C. Williams} [Trans Am. Math. Soc. 295, 325--346 (1986; Zbl 0625.54047)]. In the paper under review, the author proves this result rigorously under the random open set condition (see Theorem 2). His proof contains a clever argument in dealing with the dependence among different stages of the recursive constructions.