Related papers: Relative to any non-hyperarithmetic set
Let $T$ be a totally ordered set and let $D(T)$ denote the set of all cuts of $T$. We prove the existence of a discrete valuation domain $O_{v}$ such that $T$ is order isomorphic to two special subsets of Spec$(O_{v})$. We prove that if $A$…
We give a characterization of the strong degrees of categoricity of computable structures greater or equal to $\mathbf 0''$. They are precisely the \emph{treeable} degrees -- the least degrees of paths through computable trees -- that…
We construct a class of noncommutative spectra and give the basic properties of the class of noncommutative spectra.
Given an associative graded algebra equipped with a degree +1 differential we define an A-infinity structure that measures the failure of the differential to be a derivation. This can be seen as a non-commutative analog of generalized…
This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…
Michalski gave a short and elegant proof of a theorem of A. Kumar which states that for each set A in R, there exists a subset B of A which is full in A and such that no distance between points in B is a rational number. He also proved a…
This thesis presents an alternative to Cantor's theory of cardinality, insofar as that is understood as a theory of set size. The alternative is based on a general theory, ClassSize. ClassSize contains all sentences in the first order…
We show that every interval in the homomorphism order of finite undirected graphs is either universal or a gap. Together with density and universality this "fractal" property contributes to the spectacular properties of the homomorphism…
We examine properties of achievement sets of series in $\mathbb{R}^2$. We show several examples of unusual sets of subsums on the plane. We prove that we can obtain any set of P-sums as a cut of an achievement set in $\mathbb{R}^2.$ We…
In this paper, we present some new results describing connections between the spectrum of a regular graph and its generalized connectivity, toughness, and the existence of spanning trees with bounded degree.
The problem of efficiently characterizing degree sequences of simple hypergraphs is a fundamental long-standing open problem in Graph Theory. Several results are known for restricted versions of this problem. This paper adds to the list of…
Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r,…
We introduce systematic methods to construct Grothendieck categories from colored quivers and develop a theory of the specialization orders on the atom spectra of Grothendieck categories. We show that any partially ordered set is realized…
We prove a theorem of Hinich type on existence of a model structure on a category related by an adjunction to the category of differential graded modules over a graded commutative ring.
The multiplicity (resp. degree) of a function $f$ relative to a semianalytic subset $S$ of $\mathbb{R}^n$ is the greatest (resp. smallest) exponent among numbers $j$ such that the inequality $|f(x)|\leq C\|x\|^j$ holds on $S$ near $0$…
We investigate what collections of c.e.\ Turing degrees can be realised as the collection of elements of a separating $\Pi^0_1$ class of c.e.\ degree. We show that for every c.e.\ degree $\mathbf{c}$, the collection $\{\mathbf{c},…
Categories over a field $k$ can be graded by different groups in a connected way; we consider morphisms between these gradings in order to define the fundamental grading group. We prove that this group is isomorphic to the fundamental group…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
We use discrete Morse theory to give a new proof of the Degree Theorem in Auter space A_n. There is a filtration of A_n into subspaces A_{n,k} using the degree of a graph, and the Degree Theorem says that each A_{n,k} is (k-1)-connected.…
A non-Hermitean random matrix model proposed a few years ago has a remarkably intricate spectrum. Various attempts have been made to understand the spectrum, but even its dimension is not known. Using the Dyson-Schmidt equation, we show…