![]() Soc., 106:543–554, 1989.įractal Geometry: Mathematical Foundations and Applications, 3rd Hirschfeldt.ĭimensions and measures of quasi self-similar sets. Notices of the American Mathematical Society, 66(7):1001–1012, Cambridge UniversityĬommunications of the ACM, 62(5):70–80, 2019. SIAM Journal on Computing, 37(3):671–705, 2007.Ĭambridge Studies in Advanced Mathematics. Lutz, and Elvira Mayordomo.Įffective strong dimension in algorithmic information and We conclude that D i m ˜ φ, A ( L ) ≥ t, so by ( D.4), the proof is complete. ![]() Lim sup δ → 0 + K A δ ( L ) φ s ( δ ) ≥ 1 / 4.īy Theorem 3.7, this implies that D i m ˜ φ, A ( L ) > s. Other applications to “continuous” mathematics, not involving the point-to-set principle, include theorems in descriptive set theory, Riemannian moduli space, and Banach spaces. 4 4 4Applications of the theory of computing-specifically Kolmogorov complexity-to discrete mathematics are more numerous and are surveyed in. (See for reviews of these developments.) These applications of the point-to-set principle all concern fractal geometry in Euclidean spaces R n. Orponen has very recently used a discretized potential-theoretic method of Kaufman and tools of Katz and Tao to give a new, classical proof of the two main theorems of. 3 3 3These very non-classical proofs of new classical theorems have provoked new work in the fractal geometry community. This principle has been used to obtain strengthened lower bounds on the Hausdorff dimensions of generalized Furstenberg sets, extend the fractal intersection formula for Hausdorff dimension from Borel sets to arbitrary sets, and prove that Marstrand’s projection theorem for Hausdorff dimension holds for any set E whose Hausdorff and packing dimensions coincide, whether or not E is analytic. The point-to-set principle, described below, has enabled several recent developments that do exactly this. It is rare for the theory of computing to be used to answer open mathematical questions whose statements do not involve computation or related aspects of logic. Measure theory, theorems whose statements do not involve computation or logic. Theory of computing has been used to prove new theorems in classical geometric This is one of a handful ofĬases–all very recent and all using the point-to-set principle–in which the ![]() Our hyperspace packing dimension theorem. Lutz (2018) to arbitrary separable metric spacesĪnd to a large class of gauge families. We firstĮxtend two algorithmic fractal dimensions–computability-theoretic versions ofĬlassical Hausdorff and packing dimensions that assign dimensions (x) andĭim(x) to individual points x ∈ X–to arbitrary separable metric The logical structures of our proofs are of particular interest. ![]() Large class of gauge families (Hausdorff families of gauge functions). □(E) in terms of the dimension of E, where E is any analytic Lower and upper Minkowski (i.e., box-counting) dimensions, we give preciseįormulas for the dimension of □(E), where E is any subset of X.įor packing dimension, we give a tight bound on the dimension of Nonempty compact subsets of X, endowed with the Hausdorff metric. Let X be a separable metric space,Īnd let □(X) be the hyperspace of X, i.e., the set of all We use the theory of computing to prove general hyperspace dimension theoremsįor three important fractal dimensions. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |