Related papers: Incomputability of Simply Connected Planar Continu…

The partition number $\pi(K)$ of a simplicial complex $K\subset 2^{[m]}$ is the minimum integer $\nu$ such that for each partition $A_1\uplus\ldots\uplus A_\nu = [m]$ of $[m]$ at least one of the sets $A_i$ is in $K$. A complex $K$ is…

In the first part of this article, we complete the program announced in the preliminary note [8] by proving a conjecture presented in [9] that states the equivalence of contractibility and p_{1}-stability for generalized spaces of formal…

We show that every connected set $X$ which is irreducible between two points $a$ and $b$ embeds into the Hilbert cube in a way that $X\cup \{c\}$ is irreducible between $a$ and $b$ for every point $c$ in the closure of $X$. Also, a…

Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…

The study is motivated by the known fact that, in the noncompact case, the main minimum-problem of the theory of interior capacities of condensers in a locally compact space is in general unsolvable, and this occurs even under very natural…

The following is an open problem in topology: Determine whether the Stone-\v{C}ech compactification of a widely-connected space is necessarily an indecomposable continuum. Herein we describe properties of $X$ that are necessary and…

For any given natural $d\ge 1$ we provide examples of rational self-maps of complex projective plane $\pp^2$ of degree $d$ without (holomorphic) fixed points. This makes a contrast with the situation in one dimension. We also prove that the…

We show that bounded type implies finite type for a constructible subcategory of the module category of a finitely generated algebra over a field, which is a variant of the first Brauer-Thrall conjecture. A full subcategory is constructible…

We investigate (2,1):1 structures, which consist of a countable set $A$ together with a function $f: A \to A$ such that for every element $x$ in $A$, $f$ maps either exactly one element or exactly two elements of $A$ to $x$. These…

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…

Geometric embedding of graphs in a point set in the plane is a well known problem. In this paper, the complexity of a variant of this problem, where the point set is bounded by a simple polygon, is considered. Given a point set in the plane…

We present a classification theorem for amenable simple stably projectionless C*-algebras with generalized tracial rank one whose $K_0$ vanish on traces which satisfy the Universal Coefficient Theorem. One of them is denoted by ${\cal Z}_0$…

Several researchers have recently established that for every Turing degree $\boldsymbol{c}$, the real closed field of all $\boldsymbol{c}$-computable real numbers has spectrum $\{\boldsymbol{d}~:~\boldsymbol{d}'\geq\boldsymbol{c}"\}$. We…

When can a model of a physical system be regarded as computable? We provide the definition of a computable physical model to answer this question. The connection between our definition and Kreisel's notion of a mechanistic theory is…

For an algebraic stack $\sX$ flat and of finite presentation over a scheme $S$, we introduce various notions of {\em relative connected components} and {\em relative irreducible components}. The main distinction between these notions is…

Choosing an encoding over binary strings for input/output to/by a Turing Machine is usually straightforward and/or inessential for discrete data (like graphs), but delicate -- heavily affecting computability and even more computational…

The paper investigates two invariants for totally disconnected locally compact groups: the number of ends and the rational discrete cohomological dimension. For such a compactly generated group $G$ it is shown that its number of ends can be…

We show that any simply connected topological closed $4$-manifold punctured along any compact, totally disconnected tame subset $\Lambda$ admits a continuum of smoothings which are not diffeomorphic to any leaf of a $C^{1,0}$ codimension…

We introduce a canonical, compact topology, which we call weakly causal, naturally generated by the causal site of J. D. Christensen and L. Crane, a pointless algebraic structure motivated by certain problems of quantum gravity. We show…