SearcharxivSearch

arXiv · 2602.07685

Expansive homeomorphisms on complexity quasi-metric spaces

Abstract

The complexity quasi-metric of Schellekens is a topological framework in which the asymmetry of computational comparisons -- ``$A$ is at most as fast as $B$'' carrying different information than ``$B$ is at most as slow as $A$'' -- is built into the distance itself. This paper develops the theory of expansive homeomorphisms on the resulting space. The central result is that the scaling transformation $\psi_\alpha(f)(n)=\alpha f(n)$ is expansive on the complexity space $(\C,d_\C)$ if and only if $\alpha\neq 1$. The $\delta$-stable sets of this dynamics turn out to coincide with asymptotic complexity classes, giving a dynamical characterisation of objects familiar from complexity theory. We then show that the canonical coordinates of $\psi_\alpha$ are hyperbolic with contraction rate $\lambda=1/\alpha$, and we connect orbit separation in the dynamical system to the classical time hierarchy theorem of Hartmanis and Stearns. Unstable sets, conjugate dynamics, and topological entropy estimates for the scaling map are also worked out. Concrete algorithms and Python implementations accompany every proof, so each result can be checked computationally; SageMath snippets sit alongside the examples, and the full code is in the \href{https://github.com/gabayae/expansive-homeomorphisms-complexity-qmetric}{companion repository}.

Explore related subjects

Keep this discovery

BibTeXRIS

Yaé U. Gaba. 2026-02-07. Expansive homeomorphisms on complexity quasi-metric spaces. https://arxiv.org/abs/2602.07685

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

KEEP EXPLORING

Related papers

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

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