English
Related papers

Related papers: Compact manifolds with computable boundaries

200 papers

As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a…

Logic · Mathematics 2019-11-19 Nathanael L. Ackerman , Cameron E. Freer , Daniel M. Roy

We study the topology of metric spaces which are definable in o-minimal expansions of ordered fields. We show that a definable metric space either contains an infinite definable discrete set or is definably homeomorphic to a definable set…

Logic · Mathematics 2015-11-12 Erik Walsberg

Let (M,g) be a compact Riemannian manifold with boundary. This paper is concerned with the set of scalar-flat metrics which are in the conformal class of g and have the boundary as a constant mean curvature hypersurface. We prove that this…

Differential Geometry · Mathematics 2011-05-24 Sergio Almaraz

We characterize conformally removable sets in the plane with the aid of the recent developments in the theory of metric surfaces. We prove that a compact set in the plane is $S$-removable if and only if there exists a quasiconformal map…

Complex Variables · Mathematics 2024-09-02 Dimitrios Ntalampekos

The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…

Dynamical Systems · Mathematics 2019-06-06 Silvere Gangloff , Alonso Herrera , Cristobal Rojas , Mathieu Sablik

Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…

Logic in Computer Science · Computer Science 2010-08-04 Russell O'Connor

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…

Logic in Computer Science · Computer Science 2015-07-01 Martin Escardo

Given a metrizable space $X$, let $AM(X)$ be the space of continuous bounded admissible metrics on $X$, which is endowed with the sup-metric. In this paper, we shall investigate the Borel complexity and the complete metrizability of $AM(X)$…

General Topology · Mathematics 2024-04-09 Katsuhisa Koshino

We prove that there exists a $\Sigma^0_1$ closed subset of $[0,1]$ that is not homeomorphic to any computably compact space. We show that the index set of c.e. subspaces of $[0,1]$ that admit a computably compact presentation is not…

Consider the semialgebraic structure over the real field. More generally, let an ominimal structure be over a real closed field. We show that a definable metric space X with a definable metric d is embedded into a Euclidean space so that…

Algebraic Geometry · Mathematics 2017-08-31 Masahiro Shiota

A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…

Logic · Mathematics 2018-02-12 Russell Miller , Alexandra Shlapentokh

\emph{Scalable spaces} are simply connected compact manifolds or finite complexes whose real cohomology algebra embeds in their algebra of (flat) differential forms. This is a rational homotopy invariant property and all scalable spaces are…

Geometric Topology · Mathematics 2022-09-16 Aleksandr Berdnikov , Fedor Manin

This article is a fundamental study in computable analysis. In the framework of Type-2 effectivity, TTE, we investigate computability aspects on finite and infinite products of effective topological spaces. For obtaining uniform results we…

Logic in Computer Science · Computer Science 2015-07-01 Robert Rettinger , Klaus Weihrauch

The goal of this article is to study compact quasi-Einstein manifolds with boundary. We provide boundary estimates for compact quasi-Einstein manifolds simi\-lar to previous results obtained for static and $V$-static spaces. In addition, we…

Differential Geometry · Mathematics 2020-05-12 Rafael Diógenes , Tiago Gadelha

The topological properties of a set have a strong impact on its computability properties. A striking illustration of this idea is given by spheres and closed manifolds: if a set $X$ is homeomorphic to a sphere or a closed manifold, then any…

Logic · Mathematics 2022-02-11 Djamel Eddine Amir , Mathieu Hoyrup

For non-compact manifolds with boundary we prove that bounded geometry defined by coordinate-free curvature bounds is equivalent to bounded geometry defined using bounds on the metric tensor in geodesic coordinates. We produce a nice atlas…

Differential Geometry · Mathematics 2018-11-28 Thomas Schick

Let M be a 3-manifold (possibly with boundary). We show that, for any positive integer g, there exists an open nonempty set of metrics on M for each of which there are stable compact embedded minimal surfaces of genus g with arbitrarily…

Differential Geometry · Mathematics 2007-05-23 Brian Dean

We extend the Theory of Computation on real numbers, continuous real functions, and bounded closed Euclidean subsets, to compact metric spaces $(X,d)$: thereby generically including computational and optimization problems over higher types,…

Logic in Computer Science · Computer Science 2017-03-28 Chansu Park , Ji-Won Park , Sewon Park , Dongseong Seon , Martin Ziegler

We prove that an open manifold $M$ of dimension at least $5$ which admits a complete CAT(0) polyhedral metric is pseudo-collarable, its fundamental group at infinity is strongly perfectly semistable and has vanishing Chapman-Siebenmann…

Geometric Topology · Mathematics 2021-12-28 Karim A. Adiprasito , Louis Funar

This article is a fundamental study in computable measure theory. We use the framework of TTE, the representation approach, where computability on an abstract set X is defined by representing its elements with concrete "names", possibly…

Logic in Computer Science · Computer Science 2015-07-01 Klaus Weihrauch , Nazanin Tavana-Roshandel