Related papers: Isolated d.c.e. degrees and $\Sigma_1$ induction

The study of automorphisms of computable and other structures connects computability theory with classical group theory. Among the noncomputable countable structures, computably enumerable structures are one of the most important objects of…

Let $(a,a+d,a+2d)$ be an arithmetic progression of positive integers. The following statements are proved: (1) If $a\mid 2d$, then $(a, a+d, a+2d)\in\mdeg(\Tame(\mathbb{C}^3))$. (2) If $a\nmid 2d$, then, except for arithmetic progressions…

We construct an increasing $\omega$-sequence $(a_n)$ of Turing degrees which forms an initial segment of the Turing degrees, and such that each~$a_{n+1}$ is diagonally noncomputable relative to $a_n$. It follows that the~$\mathsf{DNR}$…

A cycle $C$ of a graph $G$ is \emph{isolating} if every component of $G-V(C)$ is a single vertex. We show that isolating cycles in polyhedral graphs can be extended to larger ones: every isolating cycle $C$ of length $6 \leq |E(C)| < \left…

Let $C\subset \bold P^r$ be an integral projective curve. One defines the speciality index $e(C)$ of $C$ as the maximal integer $t$ such that $h^0(C,\omega_C(-t))>0$, where $\omega_C$ denotes the dualizing sheaf of $C$. Extending a…

We study the degree spectra and reverse-mathematical applications of computably enumerable and co-computably enumerable partial orders. We formulate versions of the chain/antichain principle and ascending/descending sequence principle for…

Richter, Stephan, and Zhang asked whether every nonrecursive many-one degree contains a least finite-one degree. We solve this question in the negative, already within the class of computably enumerable many-one degrees. Positive answers…

We consider the constrained-degree percolation (CDP) model on the hypercubic lattice. This is a continuous-time percolation model defined by a sequence $(U_e)_{e\in\mathcal{E}^d}$ of i.i.d. uniform random variables and a positive integer…

A computable graph $\mathcal{G}$ is computably categorical relative to a degree $\mathbf{d}$ if and only if for all $\mathbf{d}$-computable copies $\mathcal{B}$ of $\mathcal{G}$, there is a $\mathbf{d}$-computable isomorphism…

We present a uniqueness theorem for the reduced C*-algebra of a twist $\mathcal{E}$ over a Hausdorff \'etale groupoid $\mathcal{G}$. We show that the interior $\mathcal{I}^\mathcal{E}$ of the isotropy of $\mathcal{E}$ is a twist over the…

Suppose $T$ is totally transcendental and every minimal non-locally-modular type is nonorthogonal to a nonisolated minimal type over the empty set. It is shown that a finite rank type $p=tp(a/A)$ is isolated if and only if $a$ is…

We consider manifolds with isolated singularities, i.e., topological spaces which are manifolds (say, $C^\infty$--) outside discrete subsets (sets of singular points). For (germs of) manifolds with, so called, cone--like singularities, a…

A Turing degree d bounds a principle P of reverse mathematics if every computable instance of P has a d-computable solution. P admits a universal instance if there exists a computable instance such that every solution bounds P. We prove…

Let $d\geq3$ and $g\geq1$ be integers. Using a geometric construction involving the symmetric product of a projective curve, we exhibit a $d$-dimensional complete local normal domain over $\mathbb{C}$ with an isolated singularity such that…

We say a closed point $x$ on a curve $C$ is sporadic if $C$ has only finitely many closed points of degree at most $\operatorname{deg}(x)$ and that $x$ is isolated if it is not in a family of effective degree $d$ divisors parametrized by…

A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees,…

Computably enumerable equivalence relations (ceers) received a lot of attention in the literature. The standard tool to classify ceers is provided by the computable reducibility $\leq_c$. This gives rise to a rich degree-structure. In this…

An isolating set in a graph is a set $X$ of vertices such that every edge of the graph is incident with a vertex of $X$ or its neighborhood. The isolation number of a graph, or equivalently the vertex-edge domination number, is the minimum…

A computable structure $\mathcal{A}$ has degree of categoricity $\mathbf{d}$ if $\mathbf{d}$ is exactly the degree of difficulty of computing isomorphisms between isomorphic computable copies of $\mathcal{A}$. Fokina, Kalimullin, and Miller…

Let $G$ be a graph and $k \geq 3$ an integer. A subset $D \subseteq V(G)$ is a $k$-clique (resp., cycle) isolating set of $G$ if $G-N[D]$ contains no $k$-clique (resp., cycle). In this paper, we prove that every connected graph with maximum…