Upper bounds for the Hausdorff dimension of Weierstrass curves
Ted Alexander, Tommy Murphy

TL;DR
This paper derives a computable upper bound for the Hausdorff dimension of Weierstrass curves using hyperbolic iterated function systems, offering a new approach despite being weaker than previous results.
Contribution
It introduces a new method to estimate the Hausdorff dimension of Weierstrass curves based on hyperbolic iterated function systems, which is directly computable.
Findings
Provides an upper bound for Hausdorff dimension of Weierstrass curves
The bound is weaker than existing results but more computationally accessible
Uses hyperbolic iterated function systems for the estimation
Abstract
We produce an upper bound for the Hausdorff dimension of the graph of a Weierstrass-type function. Whilst strictly weaker than existing results, it has the advantage of being directly computable from the theory of hyperbolic iterated function systems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Topological and Geometric Data Analysis
