Effective dimension in some general metric spaces

Elvira Mayordomo

Home/Archive/arXiv

arXiv · 1404.0077

Effective dimension in some general metric spaces

Elvira Mayordomo

View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce the concept of effective dimension for a wide class of metric spaces that are not required to have a computable measure. Effective dimension was defined by Lutz in (Lutz 2003) for Cantor space and has also been extended to Euclidean space. Lutz effectivization uses the concept of gale and supergale, our extension of Hausdorff dimension to other metric spaces is also based on a supergale characterization of dimension, which in practice avoids an extra quantifier present in the classical definition of dimension that is based on Hausdorff measure and therefore allows effectivization for small time-bounds. We present here the concept of constructive dimension and its characterization in terms of Kolmogorov complexity, for which we extend the concept of Kolmogorov complexity to any metric space defining the Kolmogorov complexity of a point at a certain precision. Further research directions are indicated.

Explore related subjects

cs.CC cs.IT math.IT

Keep this discovery

BibTeX RIS

Elvira Mayordomo. 2014-04-01. Effective dimension in some general metric spaces. https://arxiv.org/abs/1404.0077

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

Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor

We show that there is a fixed planar graph $H$, namely the $5 \times 5$ grid, such that Max Independent Set remains NP-hard in $H$-induced-minor-free graphs. This refutes the Dallard--Milani\v{c}--\v{S}torgel conjecture and a weakening of it by Gartland and Lokshtanov, and by Korhonen.

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↗