Mutual Dimension and Random Sequences

Adam Case; Jack H. Lutz

Home/Archive/arXiv

arXiv · 1603.09390

Mutual Dimension and Random Sequences

Adam Case·Jack H. Lutz

View original source ↗Read source document ↗Export metadata ↓

Abstract

If $S$ and $T$ are infinite sequences over a finite alphabet, then the lower and upper mutual dimensions $mdim(S:T)$ and $Mdim(S:T)$ are the upper and lower densities of the algorithmic information that is shared by $S$ and $T$. In this paper we investigate the relationships between mutual dimension and coupled randomness, which is the algorithmic randomness of two sequences $R_1$ and $R_2$ with respect to probability measures that may be dependent on one another. For a restricted but interesting class of coupled probability measures we prove an explicit formula for the mutual dimensions $mdim(R_1:R_2)$ and $Mdim(R_1:R_2)$, and we show that the condition $Mdim(R_1:R_2) = 0$ is necessary but not sufficient for $R_1$ and $R_2$ to be independently random. We also identify conditions under which Billingsley generalizations of the mutual dimensions $mdim(S:T)$ and $Mdim(S:T)$ can be meaningfully defined; we show that under these conditions these generalized mutual dimensions have the "correct" relationships with the Billingsley generalizations of $dim(S)$, $Dim(S)$, $dim(T)$, and $Dim(T)$ that were developed and applied by Lutz and Mayordomo; and we prove a divergence formula for the values of these generalized mutual dimensions.

Explore related subjects

cs.CC math.PR

Keep this discovery

BibTeX RIS

Adam Case, Jack H. Lutz. 2016-03-30. Mutual Dimension and Random Sequences. https://arxiv.org/abs/1603.09390

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↗