Related papers: Incomputability of Simply Connected Planar Continu…

A type-2 computable real function is necessarily continuous; and this remains true for relative, i.e. oracle-based computations. Conversely, by the Weierstrass Approximation Theorem, every continuous f:[0,1]->R is computable relative to…

We show that the disintegration operator on a complete separable metric space along a projection map, restricted to measures for which there is a unique continuous disintegration, is strongly Weihrauch equivalent to the limit operator Lim.…

In this paper we prove that if S is a smooth, irreducible, projective, rational, complex surface and D an effective, connected, reduced divisor on S, then the pair (S,D) is contractible if the log-Kodaira dimension of the pair is $-\infty$.…

The Hausdorff-Alexandroff Theorem states that any compact metric space is the continuous image of Cantor's ternary set $C$. It is well known that there are compact Hausdorff spaces of cardinality equal to that of $C$ that are not continuous…

For any composant $E \subset \mathbb H^*$ and corresponding near-coherence class $\mathscr E \subset \omega^*$ we prove the following are equivalent : (1) $E$ properly contains a dense semicontinuum. (2) Each countable subset of $E$ is…

We consider a separable compact line $K$ and its extension $L$ consisting of $K$ and a countable number of isolated points. The main object of study is the existence of a bounded extension operator $E: C(K)\to C(L)$. We show that if such an…

This paper deals with the existence, or absence, of coalescent contractions of contractible spaces. These are the contractions such that when the tracks of any two points meet, at time t0, they remain together thereafter. If a finite…

We show that every connected graph can be approximated by a normal tree, up to some arbitrarily small error phrased in terms of neighbourhoods around its ends. The existence of such approximate normal trees has consequences of both…

In this paper we study the complexity of counting Constraint Satisfaction Problems (CSPs) of the form #CSP($\mathcal{C}$,-), in which the goal is, given a relational structure $\mathbf{A}$ from a class $\mathcal{C}$ of structures and an…

We introduce a numerical scale to quantify to which extent a planar continuum is not locally connected. For a locally connected continuum, the numerical scale is zero; for a continuum like the topologist's sine curve, the scale is one; for…

The topological reconstruction problem asks how much information about a topological space can be recovered from its point-complement subspaces. If the whole space can be recovered in this way, it is called reconstructible. Our main result…

To classify complex rational cuspidal curves $E\subseteq \mathbb{P}^2$ it remains to classify the ones with complement of log general type, i.e. the ones for which $\kappa(K_X+D)=2$, where $(X,D)$ is a log resolution of $(\mathbb{P}^2,E)$.…

We study the computably enumerable sets in terms of the: (a) Kolmogorov complexity of their initial segments; (b) Kolmogorov complexity of finite programs when they are used as oracles. We present an extended discussion of the existing…

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…

Indecomposable continua with one composant are $\textit{large}$ in the sense of being non-metrisable. We adapt the method of Smith $[18]$ to construct an example which is $\textit{small}$ in the sense of being separable.

We prove that the existence of a non-special tree of size $\lambda$ is equivalent to the existence of an uncountably chromatic graph with no $K_{\omega_1}$ minor of size $\lambda$, establishing a connection between the special tree number…

We study computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a non-trivial degree…

We demonstrate that the Weihrauch lattice can be used to classify the uniform computational content of computability-theoretic properties as well as the computational content of theorems in one common setting. The properties that we study…

The notion of computable reducibility between equivalence relations on the natural numbers provides a natural computable analogue of Borel reducibility. We investigate the computable reducibility hierarchy, comparing and contrasting it with…

A topological space is iso-dense if it has a dense set of isolated points. A topological space is scattered if each of its non-empty subspaces has an isolated point. In $\mathbf{ZF}$, in the absence of the axiom of choice, basic properties…