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

A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…

In the early 1980s, Selman's seminal work on positive Turing reductions showed that positive Turing reduction to NP yields no greater computational power than NP itself. Thus, positive Turing and Turing reducibility to NP differ sharply…

We prove that any weakly idempotent complete $d$-exact category is equivalent to a $d$-cluster tilting subcategory of a weakly idempotent complete exact category, and that any weakly idempotent complete algebraic $(d+2)$-angulated category…

Members of the high Tc cuprate family (with defect free $CuO_2$ planes) are suggested to have an `{\em Intrinsic single layer superconducting} Tc', larger than the experimentally observed Tc, at a given hole concentration. This difference…

In this paper, the insulated conductivity model with two touching or close-to-touching inclusions is considered in $\mathbb{R}^{d}$ with $d\geq3$. We establish the pointwise upper bounds on the gradient of the solution for the generalized…

A state of an excitonic insulator with the electric current is studied. Initially, in the metallic phase, the electrons and holes are assumed to be moving in the opposite directions, so as the electric current exists. This state is…

The algebraic degree $Deg(G)$ of a graph $G$ is the dimension of the splitting field of the adjacency polynomial of $G$ over the field $\mathbb{Q}$. It can be shown that for every positive integer $d$, there exists a circulant graph with…

A degree-regular triangulation is one in which each vertex has identical degree. Our main result is that any such triangulation of a (possibly non-compact) surface $S$ is geometric, that is, it is combinatorially equivalent to a geodesic…

To every minimal model of a complete local isolated cDV singularity Donovan--Wemyss associate a finite dimensional symmetric algebra known as the contraction algebra. We construct the first known standard derived equivalences between these…

We examine the degree spectra of relations on ${(\omega, <)}$. Given an additional relation $R$ on ${(\omega,<)}$, such as the successor relation, the degree spectrum of $R$ is the set of Turing degrees of $R$ in computable copies of…

A set $D$ of vertices of a graph $G$ is isolating if the set of vertices not in $D$ or with no neighbor in $D$ is independent. The isolation number of $G$, denoted by $\iota (G)$, is the minimum cardinality of an isolating set of $G$. It is…

For a multiplicative cohomology theory E, complex orientations are in bijective correspondence with multiplicative natural transformations to E from complex bordism cohomology MU. If E is represented by a spectrum with a highly structured…

Let $G$ be a $t$-tough graph of order $n$ and minimum degree $\delta$ with $t>1$. It is proved that if $\delta\ge(n-2)/3$ then each longest cycle in $G$ is a dominating cycle.

Let $\mathfrak M=(M,\mathcal X)$ be a model of $\mathsf{RCA}_0+\text{$\Sigma^0_2$-bounding}$ in which $\Sigma^0_2(A)$-induction fails for some $A\in\mathcal X$. We show that (i) if $\mathfrak M$ is a model of the combinatorial principle…

Doped cuprates are inhomogeneous superconductors. The concept of an intrinsic critical temperature, Tcintr.$\equiv$ Tc*, whose value greatly exceeds that for the resistive Tcres.$\equiv$ Tc, is supported by a number of experimental studies,…

The directed preferential attachment model is revisited. A new exact characterization of the limiting in- and out-degree distribution is given by two \emph{independent} pure birth processes that are observed at a common exponentially…

An isolating set in a graph $G$ is a set $S$ of vertices such that removing $S$ and its neighborhood leaves no edge. The isolation number $\iota(G)$ of $G$ (also known as the vertex-edge domination number) is the minimum size among all…

Let ${\cal P}_n^c$ denote the set of all algebraic polynomials of degree at most $n$ with complex coefficients. Let $$D^+ := \{z \in \mathbb{C}: |z| \leq 1, \, \, \Im(z) \geq 0\}$$ be the closed upper half-disk of the complex plane. For…

We consider the problem of recovering an isotropic conductivity outside some perfectly conducting or insulating inclusions from the interior measurement of the magnitude of one current density field $|J|$. We prove that the conductivity…

We prove: (i) if $G$ is a 1-tough graph of order $n$ and minimum degree $\delta$ with $\delta\ge(n-2)/3$ then each longest cycle in $G$ is a dominating cycle unless $G$ belongs to an easily specified class of graphs with $\kappa(G)=2$ and…