Related papers: Kolmogorov complexities Kmax, Kmin on computable p…

For the ring of differential operators on a smooth affine algebraic variety $X$ over a field of characteristic zero a finite set of algebra generators and a finite set of defining relations are found explicitly. As a consequence, a finite…

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…

Specifying a computational problem requires fixing encodings for input and output: encoding graphs as adjacency matrices, characters as integers, integers as bit strings, and vice versa. For such discrete data, the actual encoding is…

We propose a simple proof of the worst-case iteration complexity for the Difference of Convex functions Algorithm (DCA) for unconstrained minimization, showing that the global rate of convergence of the norm of the objective function's…

The purpose of this thesis is to give a formal definition of quantum Kolmogorov complexity (QC), and rigorous mathematical proofs of its basic properties. The definition used here is similar to that by Berthiaume, van Dam, and Laplante. It…

In this paper, we gave a weighted compactness theory for the generalized commutators of vecotor-valued multilinear Calder\'{o}n-Zygmund operators. This was done by establishing a weighted Fr\'{e}chet-Kolmogorov theorem, which holds for…

Let $X \subseteq \mathbb{P}^r$ be a non-degenerate smooth projective variety of dimension $n$, codimension $e$, and degree $d$ defined over an algebraically closed field of characteristic zero. In this paper, we first show that $\text{reg}…

Let $B$ be a fixed rational function of one complex variable of degree at least two. In this paper, we study solutions of the functional equation $A\circ X=X\circ B$ in rational functions $A$ and $X$. Our main result states that, unless $B$…

A famous result due to Ko and Friedman (1982) asserts that the problems of integration and maximisation of a univariate real function are computationally hard in a well-defined sense. Yet, both functionals are routinely computed at great…

We prove the formula C(a,b) = K(a|C(a,b)) + C(b|a,C(a,b)) + O(1) that expresses the plain complexity of a pair in terms of prefix and plain conditional complexities of its components.

In this paper, we investigate Kolmogorov type theorems for small perturbations of degenerate Hamiltonian systems. These systems are index by a parameter $\xi$ as \( H(y,x,\xi) = \langle\omega(\xi),y\rangle + \varepsilon…

Let $K$ denote prefix-free Kolmogorov Complexity, and $K^A$ denote it relative to an oracle $A$. We show that for any $n$, $K^{\emptyset^{(n)}}$ is definable purely in terms of the unrelativized notion $K$. It was already known that…

Kolmogorov complexity and algorithmic probability are defined only up to an additive resp. multiplicative constant, since their actual values depend on the choice of the universal reference computer. In this paper, we analyze a natural…

It is known that point searching in basic semialgebraic sets and the search for globally minimal points in polynomial optimization tasks can be carried out using $(s\,d)^{O(n)}$ arithmetic operations, where $n$ and $s$ are the numbers of…

For a finite set $X \subset \mathbb{Z}^d$ that can be represented as $X = Q \cap \mathbb{Z}^d$ for some polyhedron $Q$, we call $Q$ a relaxation of $X$ and define the relaxation complexity $rc(X)$ of $X$ as the least number of facets among…

This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…

Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…

For a faithful linear representation $V$ of a finite group $G$ in coprime characteristic, we show that if the field Noether number $\beta_{\mathrm{field}}$ is the minimum $d$ such that the invariant polynomials of degree $\leq d$ generate…

We give some connections between various functions defined on finitely presented groups (isoperimetric, isodiametric, Todd-Coxeter radius, filling length functions, etc.), and we study the relation between those functions and 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…