Related papers: An additivity theorem for plain Kolmogorov complex…
We consider classical representations of integers: Church's function iterators, cardinal equivalence classes of sets, ordinal equivalence classes of totally ordered sets. Since programs do not work on abstract entities and require formal…
The arithmetic complexity counts the number of algebraically independent entries in the periodic continued fraction $\theta=[b_1,\dots, b_N, \overline{a_1,\dots,a_k}]$. If $\mathscr{A}_{\theta}$ is a noncommutative torus corresponding to…
Let M be a (possibly non-orientable) compact 3-manifold with (possibly empty) boundary consisting of tori and Klein bottles. Let $X\subset\partial M$ be a trivalent graph such that $\partial M\setminus X$ is a union of one disc for each…
By Kolmogorov Complexity,two number-theoretic problems are solved in different way than before,one problem is Maxim Kontsevich and Don Bernard Zagier's Problem 3 \emph{Exhibit at least one number which does not belong to} $ \mathcal{P}$…
Let $P \subset A$ be an inclusion of $\sigma$-unital C*-algebras with a finite index in the sense of Izumi. Then we introduce the Rokhlin property for a conditional expectation $E$ from $A$ onto $P$ and show that if $A$ is simple and…
We show that the $C^*$-algebra associated by Nekrashevych to a contracting self-similar group is simple if and only if the corresponding complex $\ast$-algebra is simple. We also improve on Steinberg and Szaka\'c's algorithm to determine if…
In \cite{Ku0}, the ambiguity index $a_{(G,O)}$ was introduced for each equipped finite group $(G,O)$. It is equal to the number of connected components of a Hurwitz space parametrizing coverings of a projective line with Galois group $G$…
The famous G\"odel incompleteness theorem states that for every consistent sufficiently rich formal theory T there exist true statements that are unprovable in T. Such statements would be natural candidates for being added as axioms, but…
We introduce higher simplicial complexity of a simplicial complex $K$ and higher combinatorial complexity of a finite space $P$ (i.e. $P$ is a finite poset). We relate higher simplicial complexity with higher topological complexity of $|K|$…
The motivation of this paper is to construct a deformation theory of coderivations of coassociative coalgebras. We introduce a notion of a Coder pair, that is, a coassociative coalgebra with a coderivation. Then we define a proper…
Chaitin's incompleteness theorem states that sufficiently rich formal systems cannot prove lower bounds on Kolmogorov complexity. In this paper we extend this theorem by showing theories that prove the Kolmogorov complexity of a large (but…
In this paper, the improvement about the generalized Kolmogorov-type three series theorem, in the case of NQD random variables, is obtained by different method. Furthermore, the generalized Kolmogorov-type three series theorem is…
As a discretization of the Hodge Laplacian, the combinatorial Laplacian of simplicial complexes has garnered significant attention. In this paper, we study combinatorial Laplacians for complex pairs $(X, A)$, where $A$ is a subcomplex of a…
$ $Let $k$ be a field of characteristic zero. If $c_1, c_2\in k\setminus \{0\}, s,t\geq 1$ and $u\geq 0$, then it is shown that the $k$-derivations $\partial_x + x^u(c_1x^ty^s+c_2)\partial_y$ and $\partial_x +…
We resolve an open question by determining matching (asymptotic) upper and lower bounds on the state complexity of the operation that sends a language L to (c(L*))*, where c() denotes complement.
The (prefix-free) Kolmogorov complexity of a finite binary string is the length of the shortest description of the string. This gives rise to some `standard' lowness notions for reals: A is K-trivial if its initial segments have the lowest…
In this paper we present a two-component generalization of the C-integrable Calogero equation (see [1]). This system is C-integrable as well, and moreover we show that the Calogero equation and its two-component generalization are solvable…
The main object of study of this paper is the notion of a LieDer pair, i.e. a Lie algebra with a derivation. We introduce the concept of a representation of a LieDer pair and study the corresponding cohomologies. We show that a LieDer pair…
By using the properties of the uniformly distributed sequences of real numbers on $(0,1)$, a short proof of a certain version of Kolmogorov strong law of large numbers is presented which essentially differs from Kolmogorov's original proof.
Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…