Lines Missing Every Random Point

We prove that there is, in every direction in Euclidean space, a line that misses every computably random point. We also prove that there exist, in every direction in Euclidean space, arbitrarily long line segments missing every double exponential time random point.Comment: Added a section: "Betting in Doubly Exponential Time.

The status and programs of the New Relativity Theory

A review of the most recent results of the New Relativity Theory is presented. These include a straightforward derivation of the Black Hole Entropy-Area relation and its $logarithmic$ corrections; the derivation of the string uncertainty relations and generalizations ; ; the relation between the four dimensional gravitational conformal anomaly and the fine structure constant; the role of Noncommutative Geometry, Negative Probabilities and Cantorian-Fractal spacetime in the Young's two-slit experiment. We then generalize the recent construction of the Quenched-Minisuperspace bosonic $p$-brane propagator in $D$ dimensions ($AACS$ [18]) to the full multidimensional case involving all $p$-branes : the construction of the Multidimensional-Particle propagator in Clifford spaces ($C$-spaces) associated with a nested family of $p$-loop histories living in a target $D$-dim background spacetime . We show how the effective $C$-space geometry is related to $extrinsic$ curvature of ordinary spacetime. The motion of rigid particles/branes is studied to explain the natural $emergence$ of classical spin. The relation among $C$-space geometry and ${\cal W}$, Finsler Geometry and (Braided) Quantum Groups is discussed. Some final remarks about the Riemannian long distance limit of $C$-space geometry are made.Comment: Tex file, 21 page

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(x|y) and Dim(x|y) 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 the mutual dimensions mdim(x:y) and Mdim(x:y)

Analyzing long-term correlated stochastic processes by means of recurrence networks: Potentials and pitfalls

Long-range correlated processes are ubiquitous, ranging from climate variables to financial time series. One paradigmatic example for such processes is fractional Brownian motion (fBm). In this work, we highlight the potentials and conceptual as well as practical limitations when applying the recently proposed recurrence network (RN) approach to fBm and related stochastic processes. In particular, we demonstrate that the results of a previous application of RN analysis to fBm (Liu \textit{et al.,} Phys. Rev. E \textbf{89}, 032814 (2014)) are mainly due to an inappropriate treatment disregarding the intrinsic non-stationarity of such processes. Complementarily, we analyze some RN properties of the closely related stationary fractional Gaussian noise (fGn) processes and find that the resulting network properties are well-defined and behave as one would expect from basic conceptual considerations. Our results demonstrate that RN analysis can indeed provide meaningful results for stationary stochastic processes, given a proper selection of its intrinsic methodological parameters, whereas it is prone to fail to uniquely retrieve RN properties for non-stationary stochastic processes like fBm.Comment: 8 pages, 6 figure

On Multifractal Structure in Non-Representational Art

Multifractal analysis techniques are applied to patterns in several abstract expressionist artworks, paintined by various artists. The analysis is carried out on two distinct types of structures: the physical patterns formed by a specific color (``blobs''), as well as patterns formed by the luminance gradient between adjacent colors (``edges''). It is found that the analysis method applied to ``blobs'' cannot distinguish between artists of the same movement, yielding a multifractal spectrum of dimensions between about 1.5-1.8. The method can distinguish between different types of images, however, as demonstrated by studying a radically different type of art. The data suggests that the ``edge'' method can distinguish between artists in the same movement, and is proposed to represent a toy model of visual discrimination. A ``fractal reconstruction'' analysis technique is also applied to the images, in order to determine whether or not a specific signature can be extracted which might serve as a type of fingerprint for the movement. However, these results are vague and no direct conclusions may be drawn.Comment: 53 pp LaTeX, 10 figures (ps/eps

Fractal Intersections and Products via Algorithmic Dimension

Algorithmic dimensions quantify the algorithmic information density of individual points and may be defined in terms of Kolmogorov complexity. This work uses these dimensions to bound the classical Hausdorff and packing dimensions of intersections and Cartesian products of fractals in Euclidean spaces. This approach shows that a known intersection formula for Borel sets holds for arbitrary sets, and it significantly simplifies the proof of a known product formula. Both of these formulas are prominent, fundamental results in fractal geometry that are taught in typical undergraduate courses on the subject