Related papers: Kolmogorov complexities Kmax, Kmin on computable p…
We address combinatorial problems that can be formulated as minimization of a partially separable function of discrete variables (energy minimization in graphical models, weighted constraint satisfaction, pseudo-Boolean optimization, 0-1…
The purpose of this article is to extend the earliest results of A.A. Brudno, connecting topological entropy of a subshift X over $\mathbb{N}$ to the Kolmogorov complexity of words in X, to subshifts over computable groups that posses…
We study the degree spectra and reverse-mathematical applications of computably enumerable and co-computably enumerable partial orders. We formulate versions of the chain/antichain principle and ascending/descending sequence principle for…
A great variety of fundamental optimization and counting problems arising in computer science, mathematics and physics can be reduced to one of the following computational tasks involving polynomials and set systems: given an $m$-variate…
We prove that the stable image of an endomorphism of a virtually free group is computable. For an endomorphism $\varphi$, an element $x\in G$ and a subset $K\subseteq G$, we say that the relative $\varphi$-order of $g$ in $K$,…
Kolmogorov complexity is the length of the ultimately compressed version of a file (that is, anything which can be put in a computer). Formally, it is the length of a shortest program from which the file can be reconstructed. We discuss the…
The free Maxwell theory in D<>4 dimensions provides a physical example of a unitary, scale invariant theory which is NOT conformally invariant. The easiest way to see this is that the field strength operator F_mn is neither a primary nor a…
We consolidate two widely believed conjectures about tautologies -- no optimal proof system exists, and most require superpolynomial size proofs in any system -- into a $p$-isomorphism-invariant condition satisfied by all paddable…
Fixing an arbitrary set $\mathcal{F}$ of complex-valued functions over Boolean variables yields a counting problem $\#\mathcal{F}$. Taking only functions from $\mathcal{F}$ to form a tensor network as the problem's input, the counting…
We consider the minimax query complexity of online planning with a generative model in fixed-horizon Markov decision processes (MDPs) with linear function approximation. Following recent works, we consider broad classes of problems where…
We investigate the completeness and completions of the normed algebras $D^{(1)}(X)$ for perfect, compact plane sets $X$. In particular, we construct a radially self-absorbing, compact plane set $X$ such that the normed algebra $D^{(1)}(X)$…
We consider the Kolmogorov equation, where the right-hand side is given by a non-local integro-differential operator comparable to the fractional Laplacian in velocity with possibly time, space and velocity dependent density. We prove that…
In this paper we study the problem of computing a Kolchin characteristic set of a radical differential ideal. The central part of the article is the presentation of algorithms solving this problem in two principal cases: for ordinary…
We establish formulas for computation of the higher algebraic $K$-groups of the endomorphism rings of objects linked by a morphism in an additive category. Let ${\mathcal C}$ be an additive category, and let $Y\ra X$ be a covariant morphism…
We comment on some conceptual and and technical problems related to computational mechanics, point out some errors in several papers, and straighten out some wrong priority claims. We present explicitly the correct algorithm for…
So-called separation automata are in the core of several recently invented quasi-polynomial time algorithms for parity games. An explicit $q$-state separation automaton implies an algorithm for parity games with running time polynomial in…
We introduce arrangements of rational sections over curves. They generalize line arrangements on P^2. Each arrangement of d sections defines a single curve in P^{d-2} through the Kapranov's construction of \bar{M}_{0,d+1}. We show a…
It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…
In the \textsc{Maximum Degree Contraction} problem, input is a graph $G$ on $n$ vertices, and integers $k, d$, and the objective is to check whether $G$ can be transformed into a graph of maximum degree at most $d$, using at most $k$ edge…
Recently, many results on the computational complexity of sorting algorithms were obtained using Kolmogorov complexity (the incompressibility method). Especially, the usually hard average-case analysis is ammenable to this method. Here we…