Related papers: A constructive approach to Freyd categories
Systems of fixpoint equations over complete lattices, consisting of (mixed) least and greatest fixpoint equations, allow one to express a number of verification tasks such as model-checking of various kinds of specification logics or the…
We consider notions of metrized categories, and then approximate categorical structures defined by a function of three variables generalizing the notion of $2$-metric space. We prove an embedding theorem giving sufficient conditions for an…
In this paper we consider a construction in an arbitrary triangulated category T which resembles the notion of a Moore spectrum in algebraic topology. Namely, given a compact object C of T satisfying some finite tilting assumptions, we…
We construct tensor and bitensor categories with given Grothedieck rig (fusion algebra) in simple cases. The results provide examples on which to test the conjectural construction of 4-D TQFT's proposed by Crane and Frenkel and shed light…
Few-shot learning aims at leveraging knowledge learned by one or more deep learning models, in order to obtain good classification performance on new problems, where only a few labeled samples per class are available. Recent years have seen…
We study the interaction between two structures on the group of polynomial automorphisms of the affine plane: its structure as an amalgamated free product and as an infinite-dimensional algebraic variety. We introduce a new conjecture, and…
We propose a classification of all one-dimensional discrete statistical models with maximum likelihood degree one based on their rational parametrization. We show how all such models can be constructed from members of a smaller class of…
We present constructive arithmetic in Deduction modulo with rewrite rules only.
This paper shows how internal models for polymorphic lambda calculi arise in any 2-category with a notion of discreteness. We generalise to a 2-categorical setting the famous theorem of Peter Freyd saying that there are no sufficiently…
A fragment of second-order lambda calculus (System F) is defined that characterizes the elementary recursive functions. Type quantification is restricted to be non-interleaved and stratified, i.e., the types are assigned levels, and a…
Modular functors, i.e. consistent systems of projective representations of mapping class groups of surfaces, have been constructed for non-semisimple modular categories already decades ago. Concepts from homological algebra have not been…
We define a notion on preadditive categories which plays a role similar to the notion of a Grothendieck pretopology on an unenriched category. Each such additive pretopology defines an additive Grothendieck topology and suffices to define…
This is a generalization of some results of Ma-Sauter from module categories over artin algebras to more general functor categories (and partly to exact categories). In particular, we generalize the definition of a faithfully balanced…
In this survey, we first present basic facts on A-infinity algebras and modules including their use in describing triangulated categories. Then we describe the Quillen model approach to A-infinity structures following K. Lefevre's thesis.…
We present a formalization of quasi-compact and quasi-separated schemes (qcqs-schemes) in the Cubical Agda proof assistant. We follow Grothendieck's functor of points approach, which defines schemes, the quintessential notion of modern…
fc-multicategories are a very general kind of two-dimensional structure, encompassing bicategories, monoidal categories, double categories and ordinary multicategories. We define them and explain how they provide a natural setting for two…
The ability to represent complex high dimensional probability distributions in a compact form is one of the key insights in the field of graphical models. Factored representations are ubiquitous in machine learning and lead to major…
We present a practical and powerful new framework for both unconstrained and constrained submodular function optimization based on discrete semidifferentials (sub- and super-differentials). The resulting algorithms, which repeatedly compute…
The aim of this paper is to introduce and study a large class of $\mathfrak{g}$-module algebras which we call factorizable by generalizing the Gauss factorization of (square or rectangular) matrices. This class includes coordinate algebras…
The unprecedented pace of machine learning research has lead to incredible advances, but also poses hard challenges. At present, the field lacks strong theoretical underpinnings, and many important achievements stem from ad hoc design…