Related papers: A structured proof of Kolmogorov's Superposition T…
Let $C({\mathbb R}^n)$ denote the set of real valued continuous functions defined on ${\mathbb R}^n$. We prove that for every $n\ge 2$ there are positive numbers $\lambda _1 , \ldots , \lambda _n$ and continuous functions $\phi_1 ,\ldots ,…
Kolmogorov famously proved that multivariate continuous functions can be represented as a superposition of a small number of univariate continuous functions, $$ f(x_1,\dots,x_n) = \sum_{q=0}^{2n+1} \chi^q \left( \sum_{p=1}^n \psi^{pq}(x_p)…
Every continuous function of two or more real variables can be written as the superposition of continuous functions of one real variable along with addition.
This work shows that for rational multivariate functions, the Kolmogorov Superposition Theorem (KST) involves several single-variable functions, which can be written down by inspection. In other words, no computation is required for…
In a number of papers, Y. Sternfeld investigated the problems of representation of continuous and bounded functions by linear superpositions. In particular, he proved that if such representation holds for continuous functions, then it holds…
Existence results for Hilbert's problem 13th mean that any equation constructed by continue functions can be given solution represented as a superposition of continue functions of one variable or of continue functions of two variables.…
Solovay proved that there exists a computable upper bound f of the prefix-free Kolmogorov complexity function K such that f (x) = K(x) for infinitely many x. In this paper, we consider the class of computable functions f such that K(x) <= f…
This note is purely expository. We show how in the course of the Kolmogorov-Arnold solution of Hilbert's 13-th problem on superpositions there appeared the notion of a basic embedding. A subset K of R^2 is {\it basic} if for each continuous…
It is shown that any continuous function depending on several $p$-adic variables, each of which is defined on $\mathbb{Z}_{p}$, can be represented as a superposition of continuous functions of one $p$-adic variable. This statement is true…
Classical versions of Kolmogorov complexity are incomputable. Nevertheless, in 1975 Solovay showed that there are computable functions $f > K+O(1)$ such that for infinitely many strings $\sigma$, $f(\sigma)=K(\sigma)+O(1)$, where $K$…
For a finite word $w$ we define and study the Kolmogorov structure function $h_w$ for nondeterministic automatic complexity. We prove upper bounds on $h_w$ that appear to be quite sharp, based on numerical evidence.
We study reduction schemes for functions of "many" variables into system of functions in one variable. Our setting includes infinite-dimensions. Following Cybenko-Kolmogorov, the outline for our results is as follows: We present explicit…
In this paper we solve Kolmogorov problem about existence of a function with given norms of derivatives for classes of multiple monotone functions and absolute monotone functions in the case of arbitrary number of norms. We also show the…
While Kolmogorov's probability axioms are widely recognized, it is less well known that in an often-overlooked 1930 note, Kolmogorov proposed an axiomatic framework for a unifying concept of the mean -- referred to as regular means. This…
This note is purely expository. In the course of the Kolmogorov-Arnold solution of Hilbert's 13th problem on superpositions there appeared the notion of basic embedding. A subset K of R^2 is basic if for each continuous function f:K->R…
We give a simple proof of Kolmogorov's theorem on the persistence of a quasiperiodic invariant torus in Hamiltonian systems. The theorem is first reduced to a well-posed inversion problem (Herman's normal form) by switching the frequency…
We explicitly construct an approximate version of the Kolmogorov superpositions, which is composed of C2-inner and outer functions, and can approximate an arbitrary alpha Holder continuous function with accuracy of N to the power -alpha,…
This is a thesis that was defended in 2009 at Lomonosov Moscow State University. In Chapter 1: 1. It is proved that that the class of lower (Skolem) elementary functions is the set of all polynomial-bounded functions that can be obtained by…
Kolmogorov's invariant torus theorem is proved using a simple fixed point theorem.
In this paper we present a proof of Hartogs' extension theorem, following T. Sobieszek's paper from 2003. Hartogs' theorem provides a large class of domains where holomorphic functions have analytic continuation to larger domains, and is "a…