Related papers: K-trivials are NCR

We prove the following results for a unital simple direct limit $A$ of recursive subhomogeneous algebras with no dimension growth: (1) A has stable rank 1. (2) The projections in $M_{\infty} (A)$ satisfy cancellation: if $e \oplus q \sim f…

This paper is motivated by basic complexity and probability questions about permanents of random matrices over finite fields, and in particular, about properties separating the permanent and the determinant. Fix $q = p^m$ some power of an…

We prove that 1) There exist infinitely many non-trivial codimension one "thick" knots in $\mathbb{R}^5$; 2) For each closed four-dimensional smooth manifold $M$ and for each sufficiently small positive $\epsilon$ the set of isometry…

Let $K$ denote prefix-free Kolmogorov Complexity, and $K^A$ denote it relative to an oracle $A$. We show that for any $n$, $K^{\emptyset^{(n)}}$ is definable purely in terms of the unrelativized notion $K$. It was already known that…

For every multivariable polynomial $p$, with $p(0)=1$, we construct a determinantal representation $$p=\det (I - K Z),$$ where $Z$ is a diagonal matrix with coordinate variables on the diagonal and $K$ is a complex square matrix. Such a…

Let $A$ be a unital simple AH-algebra with stable rank one and real rank zero such that $kx=0$ for all $x\in {\rm ker}\rho_A,$ the subgroup of infinitesmal elements in $K_0(A),$ and for the same integer $k\ge 1.$ We show that $A$ has…

We give upper bound for several highness properties in computability randomness theory. First, we prove that discrete covering property does not imply the ability to compute a 1-random real, answering a question of Greenberg, Miller and…

In [3] a short proof is given that some strings have maximal plain Kolmogorov complexity but not maximal prefix-free complexity. The proof uses Levin's symmetry of information, Levin's formula relating plain and prefix complexity and Gacs'…

We prove that there exist graphs which do not contain $K_t$ as an odd minor and whose chromatic number is at least $(\frac 32-o(1))t$. This disproves, in a strong form, the odd Hadwiger conjecture of Gerards and Seymour from 1993.

Let $R$ be a prime ring with center $Z(R)$ and with involution $*$. Given an additive subgroup $A$ of $R$, let $T(A):=\{x+x^*\mid x\in A\}$ and $K_0(A):=\{x-x^*\mid x\in A\}$. Let $L$ be a non-abelian Lie ideal of $R$. It is proved that if…

We compute the algebraic K-theory of the non-commutative ring k<x_1,...,x_n>/(m^a) when k is a perfect field of positive characteristic and m=(x_1,...,x_n). We express the answer in terms of the truncation poset Witt vectors developed in…

For a fixed $n\ge2$, consider an $n\times n$ matrix $M$ whose entries are random integers bounded by $k$ in absolute value. In this paper, we examine the probability that $M$ is singular (hence has eigenvalue 0), and the probability that…

We study degree-theoretic properties of reals that are not random with respect to any continuous probability measure (NCR). To this end, we introduce a family of generalized Hausdorff measures based on the iterates of the "dissipation"…

We consider a multi-parameter model for randomly constructing simplicial complexes. This model interpolates between random clique complexes and Linial-Meshulam random $k$-dimensional complexes, two models that have been extensively studied.…

In this article we describe the $G\times G$-equivariant $K$-ring of $X$, where $X$ is a regular compactification of a connected complex reductive algebraic group $G$. Furthermore, in the case when $G$ is a semisimple group of adjoint type,…

We show that badly approximable vectors are exactly those that cannot, for any inhomogeneous parameter, be inhomogeneously approximated at every monotone divergent rate. This implies in particular that Kurzweil's Theorem cannot be…

We prove that for every compact, connected, differentiable 3--manifold $M$ there is a compact complex manifold $X$ which can be obtained from projective 3--space by a sequence of smooth, real blow ups and downs such that $M$ is…

We study non-existence of non-constant regular maps from a partial flag variety $X=G/P$ to another partial flag variety $X'=G'/P'$ and prove that there does not exist any non-constant regular map from any partial non-complete flag variety…

In this paper, we introduce polynomial time algorithms that generate random $k$-noncrossing partitions and 2-regular, $k$-noncrossing partitions with uniform probability. A $k$-noncrossing partition does not contain any $k$ mutually…

We consider "unconstrained" random $k$-XORSAT, which is a uniformly random system of $m$ linear non-homogeneous equations in $\mathbb{F}_2$ over $n$ variables, each equation containing $k \geq 3$ variables, and also consider a "constrained"…