Related papers: On Reals with $\Delta^{0}_{2}$-Bounded Complexity …
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…
Consider a d*n matrix A, with d<n. The problem of solving for x in y=Ax is underdetermined, and has infinitely many solutions (if there are any). Given y, the minimum Kolmogorov complexity solution (MKCS) of the input x is defined to be an…
We study the pigeonhole principle for $\Sigma_2$-definable injections with domain twice as large as the codomain, and the weak K\"onig lemma for $\Delta^0_2$-definable trees in which every level has at least half of the possible nodes. We…
The Coding Theorem of L.A. Levin connects unconditional prefix Kolmogorov complexity with the discrete universal distribution. There are conditional versions referred to in several publications but as yet there exist no written proofs in…
Answering a question of Goode, we show that $k$-triviality collapses to (1-)triviality among simple theories. In particular, every stable theory with quantifier elimination in a relational language of bounded arity is trivial. We use our…
We define here the notion of a {\it weakly reversible ring} $R$ saying that a non-zero element $a\in R$ is weakly reversible if there exists an integer $m>0$ depending on $a$ such that $a^m\neq 0$ is reversible, that is,…
We study the minimal complexity of tilings of a plane with a given tile set. We note that every tile set admits either no tiling or some tiling with O(n) Kolmogorov complexity of its n-by-n squares. We construct tile sets for which this…
A group is small if it has countably many complete $n$-types over the empty set for each natural number n. More generally, a group $G$ is weakly small if it has countably many complete 1-types over every finite subset of G. We show here…
Complexity rank for $C^*$-algebras was introduced by the second author and Yu for applications towards the UCT: very roughly, this rank is at most $n$ if you can repeatedly cut the $C^*$-algebra in half at most $n$ times, and end up with…
We introduce the notions of triviality and order-triviality for global invariant types in an arbitrary first-order theory and show that they are well behaved in the NIP context. We show that these two notions agree for invariant global…
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…
This paper presents a self-contained new theory of weak fractional differential calculus in one-dimension. The crux of this new theory is the introduction of a weak fractional derivative notion which is a natural generalization of integer…
Let $\mathsf{TT}^2_k$ denote the combinatorial principle stating that every $k$-coloring of pairs of compatible nodes in the full binary tree has a homogeneous solution, i.e. an isomorphic subtree in which all pairs of compatible nodes have…
A not necessarily noetherian local ring O is called regular if every finitely generated ideal I of O possesses finite projective dimension. In the article localizations O of a finitely presented, flat algebra A over a Pruefer domain R at a…
We reconsider some classical natural semantics of integers (namely iterators of functions, cardinals of sets, index of equivalence relations), in the perspective of Kolmogorov complexity. To each such semantics one can attach a simple…
We derive explicit formulas for lambda-brackets of the affine classical W-algebras attached to the minimal and short nilpotent elements of any simple Lie algebra g. This is used to compute explicitly the first non-trivial PDE of the…
In [2], the authors prove Stillman's conjecture in all characteristics and all degrees by showing that, independent of the algebraically closed field $K$ or the number of variables, $n$ forms of degree at most $d$ in a polynomial ring $R$…
We prove that if $T$ is an $\omega$-categorical supersimple theory with nontrivial dependence (given by forking), then there is a nontrivial regular 1-type over a finite set of reals which is realized by real elements; hence forking induces…
We present several application of simple topological arguments in problems of Kolmogorov complexity. Basically we use the standard fact from topology that the disk is simply connected. It proves to be enough to construct strings with some…
We study the possibility of scaling down algorithmic information quantities in tuples of correlated strings. In particular, we address a question raised by Alexander Shen: whether, for any triple of strings $(a, b, c)$, there exists a…