On the Centred Hausdorff Measure of the Sierpinski Gasket
Abstract
We show that the centred Hausdorff measure, Cs(S), with s=32, of the Sierpinski gasket S, is C-computable (continuous-computable), in the sense that its value is the solution of the minimisation problem of a continuous function on a compact domain. We also show that Cs(S) is A-computable (algorithmic-computable) in the sense that there is an algorithm that converges to Cs(S), with error bounds tending to zero. Using this algorithm and bounds we show that Cs(S)1.0049, and we establish a conjecture for the value of the spherical Hausdorff s-measure of S, Hsphs(S)0.8616, and provide an upper bound for it, Hsphs(S)≤0.8619.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.