Related papers: Computability of 1-manifolds

In this article, we investigate the geometry of compact quasi-Einstein manifolds with boundary. We show that a $3$-dimensional simply connected compact quasi-Einstein manifold with boundary and constant scalar curvature is isometric, up to…

Semigroup theory is a branch of abstract algebra, and it provides mathematical tools for the theory of computation. Finite semigroups can describe state transition systems and thus they model physically realizable computers. Engineering…

We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and…

Let (M,g) a compact Riemannian n-dimensional manifold with umbilic boundary. It is well know that, under certain hypothesis, in the conformal class of g there are scalar-flat metrics that have the boundary of M as a constant mean curvature…

A topological space $A$ is said to be compatible with a set $\Sigma$ of equations (involving operation symbols $F_t$) iff there are continuous operations $\overline F_t$ identically satisfying $\Sigma$ on $A$. The paper's main focus is on…

The doubling conjecture predicts that a manifold admits positive scalar curvature with mean convex boundary if and only if its double admits positive scalar curvature. We show that it holds true for manifolds where the inclusion of the…

Consider a manifold with boundary, and such that the interior is equipped with a pseudo-Riemannian metric. We prove that, under mild asymptotic non-vanishing conditions on the scalar curvature, if the Levi-Civita connection of the interior…

In computability theory and computable analysis, finite programs can compute infinite objects. Presenting a computable object via any program for it, provides at least as much information as presenting the object itself, written on an…

The problem of computing spectra of operators is arguably one of the most investigated areas of computational mathematics. However, the problem of computing spectra of general bounded infinite matrices has only recently been solved. We…

We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…

Prompted by a recent question of G. Hjorth as to whether a bounded Urysohn space is indivisible, that is to say has the property that any partition into finitely many pieces has one piece which contains an isometric copy of the space, we…

We give a sufficient condition to rule out complete Riemannian metrics with nonnegative scalar curvature on the interiors of handlebodies. In higher dimensions, we give examples of ends of manifolds with positive scalar curvature metrics.

We prove that a locally compact space with an upper curvature bound is a topological manifold if and only if all of its spaces of directions are homotopy equivalent and not contractible. We discuss applications to homology manifolds, limits…

Let $S$ be a generic submanifold of $C^N$ of real codimension m. In this work we continue the study, carried over by various authors, of the set of analytic discs attached to S. Let $M$ be the set of analytic discs attached to $S.$ Given $q…

A set $A$ of integers is called total if there is an algorithm which, given an enumeration of $A$, enumerates the complement of $A$, and called cototal if there is an algorithm which, given an enumeration of the complement of $A$,…

We prove an algebraic extension theorem for the computably enumerable sets, $\mathcal{E}$. Using this extension theorem and other work we then show if $A$ and $\hat{A}$ are automorphic via $\Psi$ then they are automorphic via $\Lambda$…

A compact space X is I-favorable if, and only if X can be representing as a limit of $\sigma$-complete inverse system of compact metrizable spaces with skeletal bonding maps.

We analyze the effective content of countable, second countable topological spaces by directly calculating the complexity of several topologically defined index sets. We focus on the separation principles, calibrating an arithmetic…

We argue that computation is an abstract algebraic concept, and a computer is a result of a morphism (a structure preserving map) from a finite universal semigroup.

We introduce the operators "modified limit" and "accumulation" on a Banach space, and we use this to define what we mean by being internally computable over the space. We prove that any externally computable function from a computable…