Related papers: On Reals with $\Delta^{0}_{2}$-Bounded Complexity …

We prove an inequality for the entropy numbers in terms of nonlinear Kolmogorov's widths. This inequality is in a spirit of known inequalities of this type and it is adjusted to the form convenient in applications for $m$-term…

Let $A \cong k\langle X \rangle / I$ be an associative algebra. A finite word over alphabet $X$ is $I${\it-reducible} if its image in $A$ is a $k$-linear combination of length-lexicographically lesser words. An {\it obstruction} in a…

We define the class of weakly approximately divisible unital C*-algebras and show that this class is closed under direct sums, direct limits, any tensor product with any C*-algebra, and quotients. A nuclear C*-algebra is weakly…

Our aim was to generalize some theorems about the saturation of ultra-powers to reduced powers. Naturally, we deal via saturation for types consisting of atomic formulas. We succeed to generalize the theory of dense linear is maximal and so…

We study the positive theory of groups acting on trees and show that under the presence of weak small cancellation elements, the positive theory of the group is trivial, i.e. coincides with the positive theory of a non-abelian free group.…

Let $R=k[x,y,z]$ be a standard graded $3$-variable polynomial ring, where $k$ denotes any field. We study grade $3$ homogeneous ideals $I \subseteq R$ defining compressed rings with socle $k(-s)^{\ell} \oplus k(-2s+1)$, where $s \geq3$ and…

The main aim of this paper is to prove $R$-triviality for simple, simply connected algebraic groups with Tits index $E_{8,2}^{78}$ or $E_{7,1}^{78}$, defined over a field $k$ of arbitrary characteristic. Let $G$ be such a group. We prove…

We suggest necessary conditions of soficness of multidimensional shifts formulated in termsof resource-bounded Kolmogorov complexity. Using this technique we provide examples ofeffective and non-sofic shifts on $\mathbb{Z}^2$ with very low…

A new class of rings, {\em the class of weakly left localizable rings}, is introduced. A ring $R$ is called {\em weakly left localizable} if each non-nilpotent element of $R$ is invertible in some left localization $S^{-1}R$ of the ring…

`What more than its truth do we know if we have a proof of a theorem in a given formal system?' We examine Kreisel's question in the particular context of program termination proofs, with an eye to deriving complexity bounds on program…

This paper develops an information-theoretic framework for algorithmic complexity under regular identifiable fibering. The central question is: when a decoder is given information about the fiber label in a fibered geometric set, how much…

In this paper, we revisit a central concept in Kolmogorov complexity in which one would equate program-size complexity with information content. Despite the fact that Kolmogorov complexity has been widely accepted as an objective measure of…

We define and study the derived categories of the first kind for curved DG and A-infinity algebras complete over a pro-Artinian local ring with the curvature elements divisible by the maximal ideal of the local ring. We develop the Koszul…

Classical versions of Kolmogorov complexity are incomputable. Nevertheless, in 1975 Solovay showed that there are computable functions $f > K+O(1)$ such that for infinitely many strings $\sigma$, $f(\sigma)=K(\sigma)+O(1)$, where $K$…

Asymptotically tight lower bounds are derived for the Input/Output (I/O) complexity of a class of dynamic programming algorithms including matrix chain multiplication, optimal polygon triangulation, and the construction of optimal binary…

For an integer $k$, a $k$-tree is a tree with maximum degree at most $k$. More generally, if $f$ is an integer-valued function on vertices, an $f$-tree is a tree in which each vertex $v$ has degree at most $f(v)$. Let $c(G)$ denote the…

In recent years, many connections have been made between minimal codes, a classical object in coding theory, and other remarkable structures in finite geometry and combinatorics. One of the main problems related to minimal codes is to give…

We study orthogonal decompositions of symmetric and ordinary tensors using methods from linear algebra. For the field of real numbers we show that the sets of decomposable tensors can be defined be equations of degree 2. This gives a new…

The normalized substring complexity $\delta$ of a string is defined as $\max_k \{c[k]/k\}$, where $c[k]$ is the number of \textit{distinct} substrings of length $k$. This simply defined measure has recently attracted attention due to its…

We introduce and study a new complexity function in combinatorics on words, which takes into account the smallest second occurrence time of a factor of an infinite word. We characterize the eventually periodic words and the Sturmian words…