Related papers: Kolmogorov complexities Kmax, Kmin on computable p…
In the paper, we prove an abstract KAM (Kolmogorov-Arnold-Moser) theorem for infinite dimensional reversible systems. Using this KAM theorem, we obtain the existence and linear stability of quasi-periodic solutions for a class of reversible…
We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating $n$-dimensional complexity by using an $n$-dimensional deterministic Turing…
Given a finite set $K$, we denote by $X=\Delta(K)$ the set of probabilities on $K$ and by $Z=\Delta_f(X)$ the set of Borel probabilities on $X$ with finite support. Studying a Markov Decision Process with partial information on $K$…
With the increasing interest in applying the methodology of difference-of-convex (dc) optimization to diverse problems in engineering and statistics, this paper establishes the dc property of many well-known functions not previously known…
We investigate the long-term dynamics of HD60532, an extrasolar system hosting two giant planets orbiting in a 3:1 mean motion resonance. We consider an average approximation at order one in the masses which results (after the reduction of…
In this paper we study MapReduce computations from a complexity-theoretic perspective. First, we formulate a uniform version of the MRC model of Karloff et al. (2010). We then show that the class of regular languages, and moreover all of…
Composite minimization involves a collection of functions which are aggregated in a nonsmooth manner. It covers, as a particular case, smooth approximation of minimax games, minimization of max-type functions, and simple composite…
Deterministic one-way time-bounded multi-counter automata are studied with respect to their ability to perform reversible computations, which means that the automata are also backward deterministic and, thus, are able to uniquely step the…
Let $f, f_1, \ldots, f_\nV$ be polynomials with rational coefficients in the indeterminates $\bfX=X_1, \ldots, X_n$ of maximum degree $D$ and $V$ be the set of common complex solutions of $\F=(f_1,\ldots, f_\nV)$. We give an algorithm…
A coarse description of a subset A of omega is a subset D of omega such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse…
A quasi-representation of a group is a map from the group into a matrix algebra (or similar object) that approximately satisfies the relations needed to be a representation. Work of many people starting with Kazhdan and Voiculescu, and…
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncountably many) distributions are not, this imposes a strong…
The XL algorithm is an algorithm for solving overdetermined systems of multivariate polynomial equations, which was initially introduced for quadratic equations. However, the algorithm works for polynomials of any degree, and in this paper…
The present work develops a construction of a CD category of partial kernels from a particular type of Markov category called a partializable Markov category. These are a generalization of earlier models of categories of partial morphisms…
Diverse applications of Kolmogorov complexity to learning [CIKK16], circuit complexity [OPS19], cryptography [LP20], average-case complexity [Hir21], and proof search [Kra22] have been discovered in recent years. Since the running time of…
If C and D are varieties of algebras in the sense of general algebra, then by a representable functor C --> D we understand a functor which, when composed with the forgetful functor D --> Set, gives a representable functor in the classical…
Tensor completion recovers a multi-dimensional array from a limited number of measurements. Using the recently proposed tensor ring (TR) decomposition, in this paper we show that a d-order tensor of dimensional size n and TR rank r can be…
By a [$K$-]approximate subring of a ring we mean an additively symmetric subset $X$ such that $X \cdot X \cup (X + X)$ is covered by finitely many [resp.\ $K$] additive translates of $X$. We prove a structure theorem for finite approximate…
We consider the problem of Robust PCA in the fully and partially observed settings. Without corruptions, this is the well-known matrix completion problem. From a statistical standpoint this problem has been recently well-studied, and…
Every set of natural numbers determines a generating function convergent for $q \in (-1,1)$ whose behavior as $q \rightarrow 1^-$ determines a germ. These germs admit a natural partial ordering that can be used to compare sizes of sets of…