Related papers: Adjoining colimits
In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…
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 construct a functor from the category of graphs to the category of groups which is faithful and "almost" full, in the sense that it induces bijections of the Hom sets up to trivial homomorphisms and conjugation in the category of groups.…
The purpose of this paper is to develop a theory of $(\infty, 1)$-stacks, in the sense of Hirschowitz-Simpson's `Descent Pour Les n-Champs', using the language of quasi-category theory and the author's local Joyal model structure. The main…
The arrows of a category are elements of particular sets, the hom-sets. These sets are functorial, and their functoriality specifies how to compose the arrows with other arrows of the same category. In particular, it allows to form…
We provide a criterion for the existence of right approximations in cocomplete additive categories; it is a straightforward generalisation of a result due to El Bashir. This criterion is used to construct adjoint functors in homotopy…
Generalizing different variants of "graph conditions and constraints" as well as "universal constraints" and "negative universal constraints" in the Diagram Predicate Framework (DPF), we introduce for arbitrary categories $\mathbf{Cxt}$ and…
One goal of applied category theory is to better understand networks appearing throughout science and engineering. Here we introduce "structured cospans" as a way to study networks with inputs and outputs. Given a functor $L \colon…
This paper aims to answer the following question: Given an adjunction between two categories, how is Quillen (co)homology in one category related to that in the other? We identify the induced comparison diagram, giving necessary and…
We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that…
Graphic sketch representations are effective for representing sketches. Existing methods take the patches cropped from sketches as the graph nodes, and construct the edges based on sketch's drawing order or Euclidean distances on the…
We study deterministic constructions of graphs for which the unique completion of low rank matrices is generically possible regardless of the values of the entries. We relate the completability to the presence of some patterns (particular…
Diagrammatic sets are presheaves on a rich category of shapes, whose definition is motivated by combinatorial topology and higher-dimensional diagram rewriting. These shapes include representatives of oriented simplices, cubes, and positive…
While any infimum in a poset can also be computed as a supremum, and vice versa, categorical limits and colimits do not always approximate each other. If I approach a point from below, and you approach it from above, then we will surely…
Twisted diagrams are "diagrams" with components in different categories. Structure maps are defined using auxiliary data which consists of functors relating the various categories to each other. Prime examples of the construction are…
We study a construction of diagrams of dualizable presentable stable $\infty$-categories associated with certain fiber-cofiber sequences over rigid bases, which are sent by localizing invariants, in particular continuous K-theory, to limit…
Calculi of string diagrams are increasingly used to present the syntax and algebraic structure of various families of circuits, including signal flow graphs, electrical circuits and quantum processes. In many such approaches, the semantic…
We recall several categories of graphs which are useful for describing homotopy-coherent versions of generalized operads (e.g. cyclic operads, modular operads, properads, and so on), and give new, uniform definitions for their morphisms.…
Structured high-cardinality data arises in many domains, and poses a major challenge for both modeling and inference. Graphical models are a popular approach to modeling structured data but they are unsuitable for high-cardinality…
A cohomology theory of the adjoint of Hopf algebras, via deformations, is presented by means of diagrammatic techniques. Explicit calculations are provided in the cases of group algebras, function algebras on groups, and the bosonization of…