Dimensions of random recursive sets

A. G. Berlinkov

Research output: Contribution to journalArticlepeer-review

Abstract

We prove a theorem that generalizes the equality among the packing, Hausdorff, and upper and lower Minkowski dimensions for a general class of random recursive constructions, and apply it to constructions with finite memory. Then we prove an upper bound on the packing dimension of certain random distribution functions on [0, 1]. Bibliography: 7 titles.

Original languageEnglish
Pages (from-to)6506-6509
Number of pages4
JournalJournal of Mathematical Sciences
Volume139
Issue number3
DOIs
StatePublished - Dec 2006
Externally publishedYes

Fingerprint

Dive into the research topics of 'Dimensions of random recursive sets'. Together they form a unique fingerprint.

Cite this