Related papers: On Splits of Computably enumerable sets
The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such…
In this paper we prove a conjecture of J. Andrade, S. J. Miller, K. Pratt and M. Trinh, showing the existence of a non trivial infinite $F$-set over $\mathbb F_q[x]$ for every fixed $q$. We also provide the proof of a refinement of the…
A real X is defined to be relatively c.e. if there is a real Y such that X is c.e.(Y) and Y does not compute X. A real X is relatively simple and above if there is a real Y <_T X such that X is c.e.(Y) and there is no infinite subset Z of…
To enable the study of open sets in computational approaches to mathematics, lots of extra data and structure on these sets is assumed. For both foundational and mathematical reasons, it is then a natural question, and the subject of this…
We study the link between stably finiteness and stably projectionless-ness for $C^*$-algebras of solvable Lie groups. We show that these two properties are equivalent if the dimension of the group is not divisible by $4$; otherwise, they…
Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…
We prove that if $\vec{R}$ is a computable sequence of subsets of $\omega$ which admits no computable cohesive set, then no 3-generic computes any $\vec{R}$-cohesive set; and there exists a Martin-L\"{o}f random which computes no…
It has been proved by Boros and Makino that there is no output-polynomial-time algorithm enumerating the minimal redundant sets or the maximal irredundant sets of a hypergraph, unless P=NP. The same question was left open for graphs, with…
The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…
Let $R$ be a ring of prime characteristic $p$, and let $F^e_* R$ denote $R$ viewed as an $R$-module via the $e$th iterated Frobenius map. Given a surjective map $\phi : F^e_* R \to R$ (for example a Frobenius splitting), we exhibit an…
If E is a separable symmetric sequence space with trivial Boyd indices and $\cC^E$ is the corresponding ideal of compact operators, then there exists a $C^1$-function $f_E$, a self-adjoint element $W\in \cC^E$ and a densely defined closed…
In 1957, Lacombe initiated a systematic study of the different possible notions of "computable topological spaces". However, he interrupted this line of research, settling for the idea that "computably open sets should be computable unions…
For a set of nonnegative integers $S$ let $R_{S}(n)$ denote the number of unordered representations of the integer $n$ as the sum of two different terms from $S$. In this paper we focus on partitions of the natural numbers into two sets…
Over the past decade a considerable amount of research has been done to expand logic programming languages to handle incomplete information. One such language is the language of epistemic specifications. As is usual with logic programming…
A split graph is a graph whose vertices can be partitioned into a clique and a stable set. We investigate the combinatorial species of split graphs, providing species-theoretic generalizations of enumerative results due to B\'ina and…
We prove that the Bredon homology or cohomology of the partition complex with fairly general coefficients is either trivial or computable in terms of constructions with the Steinberg module. The argument involves developing a theory of…
We prove that universal differentiability sets in Euclidean spaces possess distinctive structural properties. Namely, we show that any universal differentiability set contains a `kernel' in which the points of differentiability of each…
Given partial information about a set, we are interested in fully recovering the original set from what is given. If a set encodes itself robustly, any partial information about the set suffices to fully recover the information about the…
We prove the existence of a nontrivial uniform algebra that is logmodular and regular on the Cantor set. As a consequence, we obtain that for every compact metrizable space X without isolated points there exists a nontrivial essential…
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…