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

Let $\mathrm{R}$ be a real closed field, and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We describe an algorithm that given as input a polynomial $P \in \mathrm{D} [ X_{1},\ldots,X_{k} ]$, and a finite set, $\mathcal{A}= \{ p_{1},…

The classical coding theorem in Kolmogorov complexity states that if an $n$-bit string $x$ is sampled with probability $\delta$ by an algorithm with prefix-free domain then K$(x) \leq \log(1/\delta) + O(1)$. In a recent work, Lu and…

The main goal of this paper is to put some known results in a common perspective and to simplify their proofs. We start with a simple proof of a result from (Vereshchagin, 2002) saying that $\limsup_n\KS(x|n)$ (here $\KS(x|n)$ is…

Finite free convolutions, $\boxplus_d$ and $\boxtimes_d$, are binary operations on polynomials of degree $d$ that are central to finite free probability, a developing field at the intersection of free probability and the geometry of…

The development of new classification and regression algorithms based on empirical risk minimization (ERM) over deep neural network hypothesis classes, coined deep learning, revolutionized the area of artificial intelligence, machine…

The synthesis of classical Computational Complexity Theory with Recursive Analysis provides a quantitative foundation to reliable numerics. Here the operators of maximization, integration, and solving ordinary differential equations are…

Given a domain $D$ in $\mathbb{C}^n$ and $K$ a compact subset of $D$, the set $\mathcal{A}_K^D$ of all restrictions of functions holomorphic on $D$ the modulus of which is bounded by $1$ is a compact subset of the Banach space $C(K)$ of…

The theory of imprecise Markov chains has achieved significant progress in recent years. Its applicability, however, is still very much limited, due in large part to the lack of efficient computational methods for calculating…

We introduce the monic rank of a vector relative to an affine-hyperplane section of an irreducible Zariski-closed affine cone $X$. We show that the monic rank is finite and greater than or equal to the usual $X$-rank. We describe an…

We show uniqueness in law for the critical SPDE \begin{eqnarray} \label{qq1} dX_t = AX_t dt + (-A)^{1/2}F(X(t))dt + dW_t,\;\; X_0 =x \in H, \end{eqnarray} where $A$ $ : \text{dom}(A) \subset H \to H$ is a negative definite self-adjoint…

We use the theory of Kolyvagin systems to prove (most of) a refined class number formula conjectured by Darmon. We show that for every odd prime $p$, each side of Darmon's conjectured formula (indexed by positive integers $n$) is "almost" a…

Let A be a noetherian AS regular Koszul quiver algebra (if A is commutative, it is essentially a polynomial ring), and grA the category of finitely generated graded left A-modules. Following Jorgensen, we define the Castelnuovo-Mumford…

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…

We show uniqueness in law for the critical SPDE $$ dX_t = AX_t dt + (-A)^{1/2}F(X(t))dt + dW_t,\;\; X_0 =x \in H, $$ where $A$ $ : dom(A) \subset H \to H$ is a negative definite self-adjoint operator on a separable Hilbert space $H$ having…

We study approximation properties of sequences of centered random elements $X_d$, $d\in\mathbb N$, with values in separable Hilbert spaces. We focus on sequences of tensor product-type and, in particular, degree-type random elements, which…

Consider a polynomial vector field $\xi$ in $\mathbb{C}^n$ with algebraic coefficients, and $K$ a compact piece of a trajectory. Let $N(K,d)$ denote the maximal number of isolated intersections between $K$ and an algebraic hypersurface of…

Given a set X of finite strings, one interesting question to ask is whether there exists a member of X which is simple conditional to all other members of X. Conditional simplicity is measured by low conditional Kolmogorov complexity. We…

Ore operators with polynomial coefficients form a common algebraic abstraction for representing D-finite functions. They form the Ore ring $K(x)[D_x]$, where $K$ is the constant field. Suppose $K$ is the quotient field of some principal…

The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such…

A clone on a set X is a set of finitary functions on X which contains the projections and which is closed under composition. The set of all clones on X forms a complete algebraic lattice Cl(X). We obtain several results on the structure of…