Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2101.11152

Optimal Oracles for Point-to-Set Principles

D. M. Stull
View original source ↗Read source document ↗Export metadata ↓

Abstract

The point-to-set principle \cite{LutLut17} characterizes the Hausdorff dimension of a subset $E\subseteq\R^n$ by the \textit{effective} (or algorithmic) dimension of its individual points. This characterization has been used to prove several results in classical, i.e., without any computability requirements, analysis. Recent work has shown that algorithmic techniques can be fruitfully applied to Marstrand's projection theorem, a fundamental result in fractal geometry. In this paper, we introduce an extension of point-to-set principle - the notion of \textit{optimal oracles} for subsets $E\subseteq\R^n$. One of the primary motivations of this definition is that, if $E$ has optimal oracles, then the conclusion of Marstrand's projection theorem holds for $E$. We show that every analytic set has optimal oracles. We also prove that if the Hausdorff and packing dimensions of $E$ agree, then $E$ has optimal oracles. Moreover, we show that the existence of sufficiently nice outer measures on $E$ implies the existence of optimal Hausdorff oracles. In particular, the existence of exact gauge functions for a set $E$ is sufficient for the existence of optimal Hausdorff oracles, and is therefore sufficient for Marstrand's theorem. Thus, the existence of optimal oracles extends the currently known sufficient conditions for Marstrand's theorem to hold. Under certain assumptions, every set has optimal oracles. However, assuming the axiom of choice and the continuum hypothesis, we construct sets which do not have optimal oracles. This construction naturally leads to a generalization of Davies theorem on projections.

Explore related subjects

cs.CC

Keep this discovery

BibTeXRIS

D. M. Stull. 2021-01-27. Optimal Oracles for Point-to-Set Principles. https://arxiv.org/abs/2101.11152

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗
arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗