Related papers: Positive enumerable functors
Expansions of abelian categories are introduced. These are certain functors between abelian categories and provide a tool for induction/reduction arguments. Expansions arise naturally in the study of coherent sheaves on weighted projective…
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…
We study the problem of enumerating answers of Conjunctive Queries ranked according to a given ranking function. Our main contribution is a novel algorithm with small preprocessing time, logarithmic delay, and non-trivial space usage during…
A recurrent formula is presented, for the enumeration of the compositions of positive integers as sums over multisets of positive integers, that closely resembles Euler's recurrence based on the pentagonal numbers, but where the…
We define and study expansion problems on countable structures in the setting of descriptive combinatorics. We consider both expansions on countable Borel equivalence relations and on countable groups, in the Borel, measure and category…
A new theory of data types which allows for the definition of types as initial algebras of certain functors Fam(C) -> Fam(C) is presented. This theory, which we call positive inductive-recursive definitions, is a generalisation of Dybjer…
We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…
In this paper, we extend some classes of structured matrices to higher order tensors. We discuss their relationships with positive semi-definite tensors and some other structured tensors. We show that every principal sub-tensor of such a…
Consider a coring with exact rational functor, and a finitely generated and projective right comodule. We construct a functor (\emph{coinduction functor}) which is right adjoint to the hom-functor represented by this comodule. Using the…
We consider the set of power functions defined on the set of positive real number, and their linear combinations. After recalling some properties of the gamma function, we give two general definitions of derivatives of positive and negative…
As suggested by the title, this paper is a survey of recent results and questions on the collection of computably enumerable sets under inclusion. This is not a broad survey but one focused on the author's and a few others' current…
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…
We establish properties of a new type of fractal which has partial self similarity at all scales. For any collection of iterated functions systems with an associated probability distribution and any positive integer V there is a…
Similarity metric which is not positive definite, and present a general theorem which provides a large family of similarity metrics which are positive definite.
We study the circumstances under which one can reconstruct a stack from its associated functor of isomorphism classes. This is possible surprisingly often: we show that many of the standard examples of moduli stacks are determined by their…
We present the notions of positively complete theory and general forms of amalgamation in the framework of positive logic. We explore the fundamental properties of positively complete theories and study the behaviour of companion theories…
We give an introduction to constructive category theory by answering two guiding computational questions. The first question is: how do we compute the set of all natural transformations between two finitely presented functors like…
Functorial semi-norms are semi-normed refinements of functors such as singular (co)homology. We investigate how different types of representability affect the (non-)triviality of finite functorial semi-norms on certain functors or classes.…
We introduce the notion of finitary computable reducibility on equivalence relations on the natural numbers. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular,…
In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational…