Related papers: Topological arguments for Kolmogorov complexity
A compact K\"ahler manifold is shown to be simply-connected if its `symmetric cotangent algebra' is trivial. Conjecturally, such a manifold should even be rationally connected. The relative version is also shown: a proper surjective…
The path spaces of a directed graph play an important role in the study of graph $\css$. These are topological spaces that were originally constructed using groupoid and inverse semigroup techniques. In this paper, we develop a simple,…
The minimal Kolmogorov complexity of a total computable function that exceeds everywhere all total computable functions of complexity at most $n$, is $2^{n+O(1)}$. If we replace "everywhere" by "for all sufficiently large inputs", the…
We provide an alternative, simpler proof of the existence of thick triangulations for noncompact $\mathcal{C}^1$ manifolds. Moreover, this proof is simpler than the original one given in \cite{pe}, since it mainly uses tools of elementary…
We prove that holomorphic maps from an open subset of a complex smooth projective curve to a complex smooth projective rationally simply connected variety can be approximated by algebraic maps for the compact-open topology. This theorem can…
We extend the concept of Krylov complexity to include general unitary evolutions involving multiple generators. This generalization enables us to formulate a framework for generalized Krylov complexity, which serves as a measure of the…
In the last couple of years there were a few attempts to apply topological data analysis to text, and in particular to natural language inference. A recent work by Tymochko et al. suggests the possibility of capturing `the notion of logical…
Simple and shorter proofs of two Dirac-type theorems involving connectivity are presented.
We present a fully automatic method for music classification, based only on compression of strings that represent the music pieces. The method uses no background knowledge about music whatsoever: it is completely general and can, without…
We propose a generalization of small world networks, in which the reconnection of links is governed by a function that depends on the distance between the elements to be linked. An adequate choice of this function lets us control the…
We propose a numerical test of fundamental physics based on the complexity measure of a general set of functions, which is directly related to the Kolmogorov (or algorithmic) complexity studied in mathematics and computer science. The…
The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…
We use an analogue of Karoubi's construction in the motivic situation to give some cohomology operations in motivic cohomology. We prove many properties of these operations, and we show that they coincide, up to some nonzero constants, with…
In this survey we present the criterion for tameness of strongly simply connected algebras due to Br\"ustle, de la Pe\~na and Skowro\'nski. We recall relevant concepts of representation theory and discuss some applications and connections…
Simple type theory is suited as framework for combining classical and non-classical logics. This claim is based on the observation that various prominent logics, including (quantified) multimodal logics and intuitionistic logics, can be…
We prove that the Bredon homology or cohomology of the partition complex with fairly general coefficients is either trivial or computable in terms of constructions with the Steinberg module. The argument involves developing a theory of…
Using a simplistic model of juggling based on physics, a natural map is constructed from the set of periodic juggling patterns (or site swaps) to links. We then show that all topological links can be juggled.
Basic pairs and their morphisms are the most elementary framework in which standard topological notions can be defined. We present here a new interpretation of topological concepts as those which can be communicated faithfully between the…
In a topological dynamical system the complexity of an orbit is a measure of the amount of information (algorithmic information content) that is necessary to describe the orbit. This indicator is invariant up to topological conjugation. We…
In this paper we introduce arrow algebras, simple algebraic structures which induce elementary toposes through the tripos-to-topos construction. This includes localic toposes as well as various realizability toposes, in particular, those…