相关论文: Adhesive category theory for graph rewriting in Ro…

An n-category is some sort of algebraic structure consisting of objects, morphisms between objects, 2-morphisms between morphisms, and so on up to n-morphisms, together with various ways of composing them. We survey various concepts of…

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…

We investigate the (separated) monomorphism category $\operatorname{mono}(Q,\Lambda)$ of a quiver $Q$ over an Artin algebra $\Lambda$. We construct an epivalence from $\overline{\operatorname{mono}}(Q,\Lambda)$ to…

Hierarchical text classification (HTC) is a special sub-task of multi-label classification (MLC) whose taxonomy is constructed as a tree and each sample is assigned with at least one path in the tree. Latest HTC models contain three…

Milner's bigraphs are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the pi-calculus and the Ambient calculus. This paper is only concerned with…

We develop a new framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a scenario we expect is common when working with real-world…

A conjecture in algorithmic model theory predicts that the model-checking problem for first-order logic is fixed-parameter tractable on a hereditary graph class if and only if the class is monadically dependent. Originating in model theory,…

We define the notion of whiskered categories and groupoids, showing that whiskered groupoids have a commutator theory. So also do whiskered $R$-categories, thus answering questions of what might be `commutative versions' of these theories.…

This paper characterizes hierarchical clustering methods that abide by two previously introduced axioms -- thus, denominated admissible methods -- and proposes tractable algorithms for their implementation. We leverage the fact that, for…

Increased reproducibility of machine learning research has been a driving force for dramatic improvements in learning performances. The scientific community further fosters this effort by including reproducibility ratings in reviewer forms…

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

Let X be a quasi-compact scheme, equipped with an open covering by affine schemes. A quasi-coherent sheaf on X gives rise, by taking sections over the covering sets, to a diagram of modules over the various coordinate rings. The resulting…

We present a common framework to study varieties in great generality from a categorical point of view. The main application of this study is in the setting of algebraic categories, where we introduce Birkhoff varieties which are essentially…

The question "What is category theory" is approached by focusing on universal mapping properties and adjoint functors. Category theory organizes mathematics using morphisms that transmit structure and determination. Structures of…

Hierarchical text classification is a challenging subtask of multi-label classification due to its complex label hierarchy. Existing methods encode text and label hierarchy separately and mix their representations for classification, where…

The well-known Lawvere category R of extended real positive numbers comes with a monoidal closed structure where the tensor product is the sum. But R has another such structure, given by multiplication, which is *-autonomous. Normed sets,…

Topologists are sometimes interested in space-valued diagrams over a given index category, but it is tricky to say what such a diagram even is if we look for a notion that is stable under equivalence. The same happens in (homotopy) type…

Subgraph and homomorphism counting are fundamental algorithmic problems. Given a constant-sized pattern graph $H$ and a large input graph $G$, we wish to count the number of $H$-homomorphisms/subgraphs in $G$. Given the massive sizes of…

We introduce homotopical methods based on rewriting on higher-dimensional categories to prove coherence results in categories with an algebraic structure. We express the coherence problem for (symmetric) monoidal categories as an…

We give an alternate conception of string diagrams as labeled 1-dimensional oriented cobordisms, the operad of which we denote by Cob/O, where O is the set of string labels. The axioms of traced (symmetric monoidal) categories are fully…