Related papers: Topological arguments for Kolmogorov complexity
The Cremona group is topologically simple when endowed with the Zariski or Euclidean topology, in any dimension $\ge 2$ and over any infinite field. Two elements are moreover always connected by an affine line, so the group is…
We introduce the notion of topological entropy of a formal languages as the topological entropy of the minimal topological automaton accepting it. Using a characterization of this notion in terms of approximations of the Myhill-Nerode…
We prove that a space whose topological complexity equals 1 is homotopy equivalent to some odd-dimensional sphere. We prove a similar result, although not in complete generality, for spaces X whose higher topological complexity TC_n(X) is…
We initiate the theory of communication complexity of individual inputs held by the agents, rather than worst-case or average-case. We consider total, partial, and partially correct protocols, one-way versus two-way, with and without help…
This paper offers an algorithmic solution to the problem of obtaining "economical" formulae for some maps in Simplicial Topology, having, in principle, a high computational cost in their evaluation. In particular, maps of this kind are used…
A fundamental characteristic of computer networks is their topological structure. The question of the description of the structural characteristics of computer networks represents a problem that is not completely solved. Search methods for…
Persistent homology enables fast and computable comparison of topological objects. However, it is naturally limited to the analysis of topological spaces. We extend the theory of persistence, by guaranteeing robustness and computability to…
We prove Farber's conjecture on the stable topological complexity of configuration spaces of graphs. The conjecture follows from a general lower bound derived from recent insights into the topological complexity of aspherical spaces. Our…
The information in an individual finite object (like a binary string) is commonly measured by its Kolmogorov complexity. One can divide that information into two parts: the information accounting for the useful regularity present in the…
Complex molecules and mesoscopic structures are naturally described by general networks of elementary building blocks and tight-binding is one of the simplest quantum model suitable for studying the physical properties arising from the…
We introduce topological notions of normal crossings symplectic divisor and variety and establish that they are equivalent, in a suitable sense, to the desired geometric notions. Our proposed concept of equivalence of associated topological…
The purpose of this note is to point out that simplicial methods and the well-known Dold-Kan construction in simplicial homotopy theory can be fruitfully applied to convert link homology theories into homotopy theories. Dold and Kan prove…
We prove a generalization of the topological Tverberg theorem. One special instance of our general theorem is the following: Let $\Delta$ denote the 8-dimensional simplex viewed as an abstract simplicial complex, and suppose that its…
Motivated by Quantum Mechanics considerations, we expose some cross product constructions on a groupoid structure. Furthermore, critical remarks are made on some basic formal aspects of the Hopf algebra structure.
The paper proposes open problems in classical Kolmogorov complexity. Each problem is presented with background information and thus the article also surveys some recent studies in the area.
In this text we expose basic cases of some fundamental ideas and methods of topology. Namely, of homotopy, degree, fundamental group, covering, Whitehead invariant, etc. This is done by considering the elementary example: closed polygonal…
The topological complexity of a path-connected space $X,$ denoted $TC(X),$ can be thought of as the minimum number of continuous rules needed to describe how to move from one point in $X$ to another. The space $X$ is often interpreted as a…
First the crucial but very confidential fact is brought into evidence that, as Kolmogorov himself repeatedly claimed, there exists no abstract theory of probabilities, simply because the factual concept of probability is itself unachieved:…
Sufficient conditions are given for the computation of accessing arcs and arcs that links boundary components of multiply connected domains. The existence of a not-computably-accessible but computable point on a computably compact arc is…
The aim of this text is to provide an elementary and self-contained exposition of Gromov's argument on topological overlap (the presentation is based on Gromov's work, as well as two follow-up papers of Matousek and Wagner, and of…