Related papers: On Splits of Computably enumerable sets

While it is trivial to multiply two C-finite sequences (just like integers), it is not quite so trivial to "factorize" them, or to decide whether they are "prime". The former is plain linear algebra, while the latter is heavy-duty…

We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be.…

Generalizing the notion of split graphs to uniform hypergraphs, we prove that the class of these hypergraphs can be characterized by a finite list of excluded induced subhypergraphs. We show that a characterization by generalized degree…

We divide the class of infinite computable trees into three types. For the first and second types, $0'$ computes a nontrivial self-embedding while for the third type $0''$ computes a nontrivial self-embedding. These results are optimal and…

The author has recently introduced the class of CNED sets in Euclidean space, generalizing the classical notion of NED sets, and shown that they are quasiconformally removable. A set $E$ is CNED if the conformal modulus of a curve family is…

In this paper, we provide a partial answer to a problem posed by A. V.Arhangel'skii; we show that if X is a compactum cleavable over a separable linearly ordered topological space (LOTS) Y such that for some continuous function f from X to…

A set $A$ is said to split a finite set $B$ if exactly half the elements of $B$ (up to rounding) are contained in $A$. We study the dual notions: (1) splitting family, which is a collection of sets such that any subset of $\{1,\ldots,k\}$…

In many simple integral domains, such as $\mathbb{Z}$ or $\mathbb{Z}[i]$, there is a straightforward procedure to determine if an element is prime by simply reducing to a direct check of finitely many potential divisors. Despite the fact…

We call a finite, spanning set of a semi-simple real Lie algebra a distinguished set if it satisfies the following property: The Lie bracket of any two elements out of the set is, up to some constant, another element in the set; conversely,…

In [5] Soare and Stob prove that if $A$ is an r.e. set which isn't computable then there is a set of the form $A \oplus W^A_e$ which isn't of r.e. Turing degree. If we define a properly $n+1$-REA set to be an $n+1$-REA set which isn't…

We explore partitions that lie in the intersection of several sets of classical interest: partitions with parts indivisible by $m$, appearing fewer than $m$ times, or differing by less than $m$. We find results on their behavior and…

Let $G$ be a connected reductive complex algebraic group, and $E$ a complex elliptic curve. Let $G_E$ denote the connected component of the trivial bundle in the stack of semistable $G$-bundles on $E$. We introduce a complex analytic…

We present a stable uniqueness theorem for non-unital C*-algebras. Generalized tracial rank one is defined for stably projectionless simple C*-algebras. Let $A$ and $B$ be two stably projectionless separable simple amenable C*-algebras with…

We study computably enumerable equivalence relations (ceers) on N and unravel a rich structural theory for a strong notion of reducibility among ceers.

Fractional derivatives are generalization to classical integer-order derivatives. The rules which are true for classical derivative need not hold for the fractional derivatives, for example, we cannot simply add the fractional orders…

Let G be a finite group. A collection P={H1, ..., Hr} of subgroups of G, where r > 1, is said a non-trivial partition of G if every non-identity element of G belongs to one and only one Hi, for some 1 <=i<=r. We call a group G that does not…

Friedman and Stanley developed the notion of Borel reducibility and illustrated its use in comparing classification problems for some familiar classes of countable structures. For many embeddings, the fact that the embedding is $1-1$ on…

A longstanding question is to characterize the lattice of supersets (modulo finite sets), $\mathcal{L}^*(A)$, of a low$_2$ computably enumerable (c.e.) set. The conjecture is that $\mathcal{L}^*(A)\cong {\mathcal E}^*$. In spite of claims…

Peterzil and Starchenko have proved the following surprising generalization of Chow's theorem: A closed analytic subset of a complex algebraic variety that is definable in an o-minimal structure, is in fact an algebraic subset. In this…

We show that every separable simple tracially approximately divisible $C^*$-algebra has strict comparison, is either purely infinite, or has stable rank one. As a consequence, we show that every (non-unital) finite simple ${\cal Z}$-stable…