Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension
نویسندگان
چکیده
We formulate the conditional Kolmogorov complexity of x given y at precision r, where x and y are points in Euclidean spaces and r is a natural number. We demonstrate the utility of this notion in two ways. 1. We prove a point-to-set principle that enables one to use the (relativized, constructive) dimension of a single point in a set E in a Euclidean space to establish a lower bound on the (classical) Hausdorff dimension of E. We then use this principle, together with conditional Kolmogorov complexity in Euclidean spaces, to give a new proof of the known, two-dimensional case of the Kakeya conjecture. This theorem of geometric measure theory, proved by Davies in 1971, says that every plane set containing a unit line segment in every direction has Hausdorff dimension 2. 2. We use conditional Kolmogorov complexity in Euclidean spaces to develop the lower and upper conditional dimensions dim(xy) and Dim(xy) of x given y, where x and y are points in Euclidean spaces. Intuitively these are the lower and upper asymptotic algorithmic information densities of x conditioned on the information in y. We prove that these conditional dimensions are robust and that they have the correct information-theoretic relationships with the well studied dimensions dim(x) and Dim(x) and mutual dimensions mdim(x : y) and Mdim(x : y). Joint work with Jack Lutz. Organizer(s): Eric Allender, Pranjal Awasthi, Michael Saks and Mario Szegedy
منابع مشابه
Algorithmic information and plane Kakeya sets
We formulate the conditional Kolmogorov complexity of x given y at preci-sion r, where x and y are points in Euclidean spaces and r is a natural number.We demonstrate the utility of this notion in two ways.1. We prove a point-to-set principle that enables one to use the (relativized,constructive) dimension of a single point in a set E in a Euclidean space toestablish a l...
متن کاملOn a Planar Variant of the Kakeya Problem
An (n − 2)–dimensional smooth manifold in Gr(n, 2) is said to be curved if its restriction to each m–space of R is no more than (m − 2)– dimensional. A K 2 -set is a set of zero Lebesgue measure containing a translate of every plane in a curved manifold. We show that this is a natural class of sets with respect to the Kakeya problem and prove that dimH(E) ≥ 7/2 for all K 2 -sets E. When the und...
متن کاملProbabilistic Sufficiency and Algorithmic Sufficiency from the point of view of Information Theory
Given the importance of Markov chains in information theory, the definition of conditional probability for these random processes can also be defined in terms of mutual information. In this paper, the relationship between the concept of sufficiency and Markov chains from the perspective of information theory and the relationship between probabilistic sufficiency and algorithmic sufficien...
متن کاملThe Kakeya problem: a gap in the spectrum and classification of the smallest examples
Kakeya sets in the affine plane AG(2, q) are point sets that are the union of lines, one through every point on the line at infinity. The finite field Kakeya problem asks for the size of the smallest Kakeya sets and the classification of these Kakeya sets. In this article we present a new example of a small Kakeya set and we give the classification of the smallest Kakeya sets up to weight q(q+2...
متن کاملOn L Bounds for Kakeya Maximal Functions and the Minkowski Dimension in R
We prove that the bound on the L norms of the Kakeya type maximal functions studied by Cordoba [2], and by Bourgain [1] are sharp for p > 2. The proof is based on a construction originally due to Schoenberg [5], for which we provide an alternative derivation. We also show that r log(1/r) is the exact Minkowski dimension of the class of Kakeya sets in R, and prove that the exact Hausdorff dimens...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017