Related papers: Realizing Computably Enumerable Degrees in Separat…

This article shows that PSPACE not equal EXP. A simple but novel proof technique has been used to separate these two classes. Whether an arbitrary Turing machine accepts an input when the running time is limited has been computed in this…

In this paper we define a degree for ends of infinite digraphs. The well-definedness of our definition in particular resolves a problem by Zuther. Furthermore, we extend our notion of end degree to also respect, among others, the vertices…

In the study of the arithmetic degrees (the degree structure induced by relative arithmetic definability, ($\leq_{a}$) the $\omega$-REA sets play a role analogous to the role the r.e. degrees play in the study of the Turing degrees.…

Classical circuit complexity characterizes parallel computation in purely combinatorial terms, ignoring the physical constraints that govern real hardware. The standard classes $\mathbf{NC}$, $\mathbf{AC}$, and $\mathbf{TC}$ treat unlimited…

We consider maps between commutative groups and their functional degrees. These degrees are defined based on a simple idea -- the functional degree should decrease if a discrete derivative is taken. We show that the maps of finite…

Let $\mathcal{A}$ be a separable nuclear C*-algebra, and $\mathcal{B}$ be a nonunital separable simple $\mathcal{Z}$-stable C*-algebra. Continuing the work from Gabe-Lin-Ng, we classify all essential extensions, with large complement, of…

This is the first of a series of papers. Our final goal is to establish Deligne-Riemann-Roch isomorphisms in various settings. In this paper, we establish a uniqueness theorem for Deligne pairings and prove the degree $1$ part of the…

It goes back to Ahlfors that a real algebraic curve $C$ admits a separating morphism $f$ to the complex projective line if and only if the real part of the curve disconnects its complex part, i.e. the curve is \textit{separating}. The…

We show that including degrees of a particular kind of provability in the search target for any theorem-prover in sufficiently powerful formal systems over finite-sized statements preserves well-definition and a sufficient consistency while…

We prove that in any $n$-vertex complete graph there is a collection $\mathcal{P}$ of $(1 + o(1))n$ paths that strongly separates any pair of distinct edges $e, f$, meaning that there is a path in $\mathcal{P}$ which contains $e$ but not…

We discuss the complexity of completions of partial combinatory algebras, in particular of Kleene's first model. Various completions of this model exist in the literature, but all of them have high complexity. We show that although there do…

We show that every countable ideal of degrees that are low for isomorphism is contained in a principal ideal of degrees that are low for isomorphism by adapting an exact pair construction. We further show that within the hyperimmune-free…

In previous definition of $\mathrm{E}$-theory, separability of the $\mathrm{C}^*$-algebras is needed either to construct the composition product or to prove the long exact sequences. Considering the latter, the potential failure of the long…

The "separation dimension" of a graph $G$ is the minimum positive integer $d$ for which there is an embedding of $G$ into $\mathbb{R}^d$, such that every pair of disjoint edges are separated by some axis-parallel hyperplane. We prove a…

We introduce the point degree spectrum of a represented space as a substructure of the Medvedev degrees, which integrates the notion of Turing degrees, enumeration degrees, continuous degrees, and so on. The notion of point degree spectrum…

We prove several results about the relationship between the word complexity function of a subshift and the set of Turing degrees of points of the subshift, which we call the Turing spectrum. Among other results, we show that a Turing…

We work with the structure consisting of all computably enumerable (c.e.) sets ordered by set inclusion. The question we will partially address is which c.e.\ sets are autormorphic to low (or low$_2$ sets. Using work of Miller, we can see…

For a projective curve $C$ and the canonical divisor $K_C$ on $C$, it is classically known that the canonical ring $R(C) = \oplus_{m=0}^\infty H^0(C, m K_C)$ is finitely generated in degree at most three. In this article, we study whether…

It is proved that the universal degree bound for separating polynomial invariants of a finite abelian group (in non-modular characteristic) is strictly smaller than the universal degree bound for generators of polynomial invariants, unless…

We study the \emph{Bipartite Degree Realization} (BDR) problem: given a graphic degree sequence $D$, decide whether it admits a realization as a bipartite graph. While bipartite realizability for a fixed vertex partition can be decided in…