Related papers: Incomputability of Simply Connected Planar Continu…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

We consider *-linear maps into a commutative C*-algebra C (X) of continuous functions on a locally compact Hausdorff space X with certain specified properties and prove two results: (1) an extension result for a class of *-linear maps Y -->…

We study the computational difficulty of the problem of finding fixed points of nonexpansive mappings in uniformly convex Banach spaces. We show that the fixed point sets of computable nonexpansive self-maps of a nonempty, computably weakly…

It is shown that there is a computable conformal map of the unit disk onto a domain $D$ that has a computable extension to the closure of the unit disk even though the boundary of $D$ is not effectively locally connected. The proof encodes…

We construct a fully faithful functor from the category of graphs to the category of fields. Using this functor, we resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure S,…

A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…

In this short note we show that every connected reductive simply-connected algebraic group of rank $>1$ over the complex numbers has infinitely many pairs of irreducible representations which are not related by an automorphism of the…

Let $(X,\Delta)$ be a smooth complex projective simple normal crossing pair of dimension $n\geq 3$ endowed with an everywhere nondegenerate logarithmic conformal tensor. If $K_X+\Delta$ is not nef, then precisely one of the following…

In this paper we develop general techniques for classes of computable real numbers generated by subsets of total computable (recursive functions) with special restrictions on basic operations in order to investigate the following problems:…

We shall prove that if X, Y are compact metrizable spaces of positive dimension and h: X x Y --> X is a continuous map with zero-dimensional fibers then X contains a non-trivial continuum without one-dimensional subsets; in particular X is…

Absolutely continuous commuting row contractions admit a weak-$*$ continuous functional calculus. Building on recent work describing the first and second dual spaces of the closure of the polynomial multipliers on the Drury-Arveson space,…

We prove each embedded, constant mean curvature (CMC) surface in Euclidean space with genus zero and finitely many coplanar ends is nondegenerate: there is no nontrivial square-integrable solution to the Jacobi equation, the linearization…

A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…

The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular subgraph and a matching. We show that this conjecture holds for the class of connected plane cubic graphs.

We review results concerning homogeneous compacta and discuss some open questions. It is established that indecomposable continua are Alexandroff (resp., Mazurkiewicz, or strong Cantor) manifolds with respect to the class of all continua.…

We prove, for stably computably enumerable formal systems, direct analogues of the first and second incompleteness theorems of G\"odel. A typical stably computably enumerable set is the set of Diophantine equations with no integer…

We study the computational complexity of planar valued constraint satisfaction problems (VCSPs), which require the incidence graph of the instance be planar. First, we show that intractable Boolean VCSPs have to be self-complementary to be…

This note addresses the issue as to which ceers can be realized by word problems of computably enumerable (or, simply, c.e.) structures (such as c.e. semigroups, groups, and rings), where being realized means to fall in the same…

Danos and Regnier introduced generalized (non-binary) multiplicative connectives in Danos and Regnier [2]. They showed that there exist generalized multiplicative connectives that cannot be defined by any combination of the tensor and par…

Assume that A is a unital separable simple C*-algebra with real rank zero, stable rank one, strict comparison of projections, and that its tracial simplex T(A) has a finite number of extremal points. We prove that every self-adjoint element…