相关论文: Coherence of Proof-Net Categories

Naturally occurring diagrams in algebraic topology are commutative up to homotopy, but not on the nose. It was quickly realized that very little can be done with this information. Homotopy coherent category theory arose out of a desire to…

In this paper we construct a symmetric monoidal closed model category of coherently commutative monoidal categories. The main aim of this paper is to establish a Quillen equivalence between a model category of coherently commutative…

The category of (colored) props is an enhancement of the category of colored operads, and thus of the category of small categories. The titular category has nice formal properties: it is bicomplete and is a symmetric monoidal category, with…

In this paper we will prove that there exists a covariant functor from the category of schemes to the category of graphs. This functor provides a combination between algebraic varieties and combinatorial graphs so that the invariants…

Given a symmetric operad $P$, and a signature (or generating sequence) $\Phi$ for $P$, we define a notion of the "categorification" (or "weakening") of $P$ with respect to $\Phi$. When $P$ is the symmetric operad whose algebras are…

We introduce a tensor product for symmetric monoidal categories with the following properties. Let SMC denote the 2-category with objects small symmetric monoidal categories, arrows symmetric monoidal functors and 2-cells monoidal natural…

We present a general homotopical analysis of structured diagram spaces and discuss the relation to symmetric spectra. The main motivating examples are the I-spaces, which are diagrams indexed by finite sets and injections, and J-spaces,…

The classical matrix tree theorem relates the number of spanning trees of a connected graph with the product of the nonzero eigenvalues of its Laplacian matrix. The class of regular matroids generalizes that of graphical matroids, and a…

The long hunt for a symmetric monoidal category of spectra finally ended in success with the simultaneous discovery of the third author's discovery of symmetric spectra and the Elmendorf-Kriz-Mandell-May category of S-modules. In this paper…

Category theory has been recently used as a tool for constructing and modeling an information flow framework. Here, we show that the flow of information can be described using preradicals. We prove that preradicals generalize the notion of…

The main objective of this paper is to construct a symmetric monoidal closed model category of coherently commutative monoidal quasi-categories. We construct another model category structure whose fibrant objects are (essentially) those…

This paper develops a methodology for representing machine learning models as models of formal theories, grounded in the perspective that machine learning models are a form of database and that databases are models of theories in coherent…

This is a large audience version of our previous work (see math.AG/0301146) in which we prove the existence of an (exact) equivalence between the category of coherent analytic sheaves and the category of $\bar{\partial}$-coherent sheaves.…

This work derives closed-form expressions computing the expectation of co-presence and of number of co-occurrences of nodes on paths sampled from a network according to general path weights (a bag of paths). The underlying idea is that two…

Univalent categories constitute a well-behaved and useful notion of category in univalent foundations. The notion of univalence has subsequently been generalized to bicategories and other structures in (higher) category theory. Here, we…

We study the categorical framework for the computation of persistent homology, without reliance on a particular computational algorithm. The computation of persistent homology is commonly summarized as a matrix theorem, which we call the…

A theory is developed which uses "networks" (directed acyclic graphs with some extra structure) as a formalism for expressions in multilinear algebra. It is shown that this formalism is valid for arbitrary PROPs (short for 'PROducts and…

We introduce a new formalism for representing proofs in propositional logic called "scroll nets". Its fundamental construct is the "scroll", a topological notation for implication proposed by C. S. Peirce at the end of the 19th century as…

Our aim is to give a fairly complete account on the construction of compatible model structures on exact categories and symmetric monoidal exact categories, in some cases generalizing previously known results. We describe the close…

Categorical probability has recently seen significant advances through the formalism of Markov categories, within which several classical theorems have been proven in entirely abstract categorical terms. Closely related to Markov categories…