Related papers: On the Kolmogorov Superposition Theorem and Regula…
The subject of this paper is regularity-preserving aggregation of regular norms on finite-dimensional linear spaces. Regular norms were introduced in [5] and are closely related to ``type 2'' spaces [9, Chapter 9] playing important role in…
Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal term-generated model for the…
The theory of random real numbers is exceedingly well-developed, and fascinating from many points of view. It is also quite challenging mathematically. The present notes are intended as no more than a gateway to the larger theory. They…
The results of the renormalization group are commonly advertised as the existence of power law singularities near critical points. The classic predictions are often violated and logarithmic and exponential corrections are treated on a…
Kolmogorovs axiomatic framework is the best-known approach to describing probabilities and, due to its use of the Lebesgue integral, leads to remarkably strong continuity properties. However, it relies on the specification of a probability…
Recently the theory of widths of Kolmogorov-Gelfand has received a great deal of interest due to its close relationship with the newly born area of Compressive Sensing in Signal Processing. However fundamental problems of the theory of…
This text presents an unified approach of probability and statistics in the pursuit of understanding and computation of randomness in engineering or physical or social system with prediction with generalizability. Starting from elementary…
We derive explicit formulas for the normal ordering of powers of arbitrary monomials of boson operators. These formulas lead to generalisations of conventional Bell and Stirling numbers and to appropriate generalisations of the Dobinski…
We consider distributions on a closed compact manifold $M$ as maps on smoothing operators. Thus spaces of certain maps between $\Psi^{-\infty}(M)\to \mathcal{C}^{\infty}(M)$ are considered as generalized functions. For any collection of…
Kolmogorov Complexity constitutes an integral part of computability theory, information theory, and computational complexity theory -- in the discrete setting of bits and Turing machines. Over real numbers, on the other hand, the…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
This is part II of our book on KAM theory. We start by defining functorial analysis and then switch to the particular case of Kolmogorov spaces. We develop functional calculus based on the notion of local operators. This allows to define…
Based on the theory of Fermat reals we introduce new topologies on spaces of Colombeau generalized points and derive some of their fundamental properties. In particular, we obtain metric topologies on the space of near-standard generalized…
Since its introduction by J. Karamata, regular variation has evolved from a purely mathematical concept into a cornerstone of theoretical probability and data analysis. It is extensively studied and applied in different areas. Its…
Composite minimization is a powerful framework in large-scale convex optimization, based on decoupling of the objective function into terms with structurally different properties and allowing for more flexible algorithmic design. We…
In parallel to the classical theory of central extensions of groups, we develop a version for extensions that preserve commutativity. It is shown that the Bogomolov multiplier is a universal object parametrising such extensions of a given…
In 1933 Kolmogorov constructed a general theory that defines the modern concept of conditional expectation. In 1955 Renyi fomulated a new axiomatic theory for probability motivated by the need to include unbounded measures. We introduce a…
General extensions of an inequality due to Rogozin, concerning the essential supremum of a convolution of probability density functions on the real line, are obtained. While a weak version of the inequality is proved in the very general…
Consider a probability measure supported by a regular geodesic ball in a manifold. For any p larger than or equal to 1 we define a stochastic algorithm which converges almost surely to the p-mean of the measure. Assuming furthermore that…
In 1920, P. A. MacMahon generalized the (classical) notion of divisor sums by relating it to the theory of partitions of integers. In this paper, we extend the idea of MacMahon. In doing so we reveal a wealth of divisibility theorems and…