Related papers: An additivity theorem for plain Kolmogorov complex…
In this paper, we introduce a property of topological dynamical systems that we call finite dynamical complexity. For systems with this property, one can in principle compute the $K$-theory of the associated crossed product $C^*$-algebra by…
We show that the K-theory of C*-algebras can be defined by pairs of matrices satisfying less strict relations than idempotency.
We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations $R, S$, a componentwise reducibility is defined by $ R\le S \iff \ex f \, \forall x, y \, [xRy…
We determine the representation-finiteness of $A\otimes B$, where both $A$ and $B$ are simply connected algebras with at least three simple modules.
The question whether a set of formulae G implies a formula f is fundamental. The present paper studies the complexity of the above implication problem for propositional formulae that are built from a systematically restricted set of Boolean…
We prove a new theorem on additive Levy processes and show that this theorem implies several proved theorems and a hard conjectured theorem.
The complexity of the simple and the Kac modules over the general linear Lie superalgebra $\mathfrak{gl}(m|n)$ of type $A$ was computed by Boe, Kujawa, and Nakano in 2012. A natural continuation to their work is computing the complexity of…
Below is a translation from my Russian paper. I added references, unavailable to me in Moscow. Similar results have been also given in [Schnorr Stumpf 75] (see also [Lynch 75]). Earlier relevant work (classical theorems like Compression,…
For quadratic spaces which represent 1 there is a characterization of hermitian compositions in the language of algebras-with-involutions using the even Clifford algebra. We extend this notion to define a generalized composition based on…
We find an explicit closed form for the subword complexity of the infinite fixed point of the morphism sending $a \rightarrow aab$ and $b \rightarrow b$. This morphism is then generalized in three different ways, and we find similar…
The K-theoretic quiver component formula expresses the K-polynomial of a type A quiver locus as an alternating sum of products of double Grothendieck polynomials. This formula was conjectured by A. Buch and R. Rim\'anyi and later proved by…
For a pair of spaces $X$ and $Y$ such that $Y \subseteq X$, we define the relative topological complexity of the pair $(X,Y)$ as a new variant of relative topological complexity. Intuitively, this corresponds to counting the smallest number…
We associate a non-commutative $C^*$-algebra with any locally finite simplicial complex. We determine the $K$-theory of these algebras and show that they can be used to obtain a conceptual explanation for the Baum-Connes conjecture.
We extend Matveev's theory of complexity for 3-manifolds, based on simple spines, to (closed, orientable, locally orientable) 3-orbifolds. We prove naturality and finiteness for irreducible 3-orbifolds, and, with certain restrictions and…
In this article we compute the {\em local algebraic $K$-theory}, $ i = 0, 1$, of the algebra of complex numbers $\mathbb{C}$ endowed with the trivial filtration, i.e. $\mathbb{C}_{\mu}= \mathbb{C}$, for any $\mu \in \mathbb{N}$; {\em local…
We show that there are infinitely many binary strings z, such that the sum of the on-line decision complexity of predicting the even bits of z given the previous uneven bits, and the decision complexity of predicting the uneven bits given…
The use of algorithmic information theory (Kolmogorov complexity theory) to explain the relation between mathematical probability theory and `real world' is discussed.
$KS$-algebra consists of expressions constructed with four kinds operations, the minimum, maximum, difference and additively homogeneous generalized means. Five families of $Z$-classifiers are investigated on binary classification tasks…
We prove a formula expressing the Kerov polynomial $\Sigma_k$ as a weighted sum over the lattice of noncrossing partitions of the set $\{1,...,k+1\}$. In particular, such a formula is related to a partial order $\mirr$ on the Lehner's…
We construct explicit Boolean square matrices whose rectifier complexity (OR-complexity) differs significantly from the complexity of their complement matrices.