Related papers: On the Kolmogorov Superposition Theorem and Regula…
We unify Linear Algebra by proposing a definition of determinants via one equation that implies all known properties of them:\\ 1. Cramer's Rule,\\ 2. Cofactor expansion,\\ 3. Antisymmetry of determinants,\\ 4. Linearity of determinants,\\…
We derive normal approximation results for a class of stabilizing functionals of binomial or Poisson point process, that are not necessarily expressible as sums of certain score functions. Our approach is based on a flexible notion of the…
In Sternfeld's work on Kolmogorov's Superposition Theorem appeared the combinatorial-geometric notion of a basic set and a certain kind of arrays. A subset $X \subset \mathbb R^n$ is basic if any continuous function $X\to \mathbb R$ could…
Lie systems form a class of systems of first-order ordinary differential equations whose general solutions can be described in terms of certain finite families of particular solutions and a set of constants, by means of a particular type of…
In this paper we study two types of means of the entries of a nonnegative matrix: the \emph{permanental mean}, which is defined using permanents, and the \emph{scaling mean}, which is defined in terms of an optimization problem. We explore…
This paper defines a new notion of bounded computable randomness for certain classes of sub-computable functions which lack a universal machine. In particular, we define such versions of randomness for primitive recursive functions and for…
Link prediction in graphs is an important task in the fields of network science and machine learning. We investigate a flexible means of regularization for link prediction based on an approximation of the Kolmogorov complexity of graphs…
In this paper we present results on asymptotic characteristics of multivariate function classes in the uniform norm. Our main interest is the approximation of functions with mixed smoothness parameter not larger than $1/2$. Our focus will…
The article introduces the concept of uniformity, which is formulated as a scheme of axioms. The connection of this concept with ordered sets is studied. The effectiveness of using axiom schemes as a convenient and short way of replacing…
This essay points to many of the interesting ramifications of Margulis' arithmeticity theorem, the superrigidity theorem, and normal subgroup theorem. We provide some history and background, but the main goal is to point to interesting open…
The additivity of classical probabilities is only the first in a hierarchy of possible sum-rules, each of which implies its successor. The first and most restrictive sum-rule of the hierarchy yields measure-theory in the Kolmogorov sense,…
This paper provides a short introduction to the notion of regular category and its use in categorical algebra. We first prove some of its basic properties, and consider some fundamental algebraic examples. We then analyse the algebraic…
We introduce a {\it non-regular} generalisation of the N\"{o}rlund mean, and show its equivalence with a certain moving average. The Abelian and Tauberian theorems establish relations with convergent sequences and certain power series. A…
For a stationary sequence that is regularly varying and associated we give conditions which guarantee that partial sums of this sequence, under normalization related to the exponent of regular variation, converge in distribution to a…
The famous Prohorov theorem for Radon probability measures is generalized in terms of usco mappings. In the case of completely metrizable spaces this is achieved by applying a classical Michael result on the existence of usco selections for…
This paper introduces a novel extension of Fr\'{e}chet means, called \textit{generalized Fr\'{e}chet means} as a comprehensive framework for characterizing features in probability distributions in general topological spaces. The generalized…
It is shown that the standard Kolmogorov model for probability spaces cannot in general allow the elimination but of only a small amount of probabilistic redundancy. This issue, a purely theoretical weakness, not necessarily related to…
We define a general notion of set of indices which, using concepts from pre-ordered sets theory, permits to unify the presentation of several Colombeau-type algebras of nonlinear generalized functions. In every set of indices it is possible…
Due to M\"{u}ller's theorem, the Kolmogorov complexity of a string was shown to be equal to its quantum Kolmogorov complexity. Thus there are no benefits to using quantum mechanics to compress classical information. The quantitative amount…
The addition of polymers fundamentally alters the dynamics of turbulent flows in a way that defies Kolmogorov predictions. However, we now present a formalism that reconciles our understanding of polymeric turbulence with the classical…