Related papers: Kolmogorov-Arnold-Moser Theorem
Upon re-examining Arnold's established lemma for explaining his famous limit problem, we have determined that while the lemma itself is correct, there is a defect in the original geometric proof. In this paper, we prove the correctness of…
We document some versions, in real K-theory, of well-known properties of the coarse assembly map in complex K-theory. These results are well-known, but difficult to find in the literature.
We show that real-value approximations of Kolmogorov-Chaitin (K_m) using the algorithmic Coding theorem as calculated from the output frequency of a large set of small deterministic Turing machines with up to 5 states (and 2 symbols), is in…
We present an abstract KAM theorem, adapted to space-multidimensional hamiltonian PDEs with smoothing non-linearities. The main novelties of this theorem are that: $\bullet$ the integrable part of the hamiltonian may contain a hyperbolic…
Carl Friedrich Gauss is often given credit for providing the first correct proof of the fundamental theorem of algebra in his 1799 doctoral dissertation. However, Gauss's proof contained a significant gap. In this paper, we give an…
A classical theorem of Alexandroff states that every $n$-dimensional compactum $X$ contains an $n$-dimensional Cantor manifold. This theorem has a number of generalizations obtained by various authors. We consider extension-dimensional and…
In this paper, the improvement about the generalized Kolmogorov-type three series theorem, in the case of NQD random variables, is obtained by different method. Furthermore, the generalized Kolmogorov-type three series theorem is…
We consider the problem of generating pseudo-random matrices based on the similarity of their spectra to Wigner's semicircular law. We introduce the notion of an r-independent pseudo-Wigner matrix ensemble and prove closeness of the spectra…
The aim of the present work is to show that the results obtained earlier on the approximation of distributions of sums of independent summands by infinitely divisible laws may be transferred to the estimation of the closeness of…
In a 1985 commentary to his collected works, Kolmogorov informed the reader that his 1932 paper 'On the interpretation of intuitionistic logic' "was written in hope that with time, the logic of solution of problems [i.e., intuitionistic…
The Kolmogorov-Arnold Network (KAN) is a new network architecture known for its high accuracy in several tasks such as function fitting and PDE solving. The superior expressive capability of KAN arises from the Kolmogorov-Arnold…
Kolmogorov-Arnold Networks (KANs) are emerging as a powerful framework for interpretable and efficient system identification in dynamic systems. By leveraging the Kolmogorov-Arnold representation theorem, KANs enable function approximation…
This is a short introduction to Kolmogorov Complexity. The interested reader is referred to the text books by Cover & Thomas as well as Li & V\'itanyi, which cover the fields of information theory and Kolmogorov complexity in depth and with…
Chaitin's incompleteness theorem states that sufficiently rich formal systems cannot prove lower bounds on Kolmogorov complexity. In this paper we extend this theorem by showing theories that prove the Kolmogorov complexity of a large (but…
In 1998 D. Tamarkin announced a proof of Kontsevich formality theorem based on the existence of structure of homotopy Gerstenhaber algebra in the Hochschild cochains of an associative algebra. In this note we give a detailed explanation of…
Different observers do not have to agree on how they identify a quantum system. We explore a condition based on algorithmic complexity that allows a system to be described as an objective "element of reality". We also suggest an…
The assumptions needed to prove Cox's Theorem are discussed and examined. Various sets of assumptions under which a Cox-style theorem can be proved are provided, although all are rather strong and, arguably, not natural.
The reversible context 2 in KAM theory refers to the situation where dim Fix G < (1/2) codim T, here Fix G is the fixed point manifold of the reversing involution G and T is the invariant torus one deals with. Up to now, the persistence of…
The consistency of a second-order version of a theorem of Morley on the number of countable models was proved in arXiv:2107.07636 with the aid of large cardinals. We here dispense with them.
In this paper, a representation of the information-disturbance theorem based on the quantum Kolmogorov complexity that was defined by P. Vitanyi has been examined. In the quantum information theory, the information-disturbance relationship,…