English
Related papers

Related papers: Spans of cospans

200 papers

In this survey we overview known results and get several new results on digraph compositions which generalize several classes of digraphs, such as quasi-transitive digraphs. After an introductory section, the paper is divided into six…

Combinatorics · Mathematics 2023-06-16 Yuefang Sun

We study the homotopy theory of locally ordered spaces, that is manifolds with boundary whose charts are partially ordered in a compatible way. Their category is not particularly well-behaved with respect to colimits. However, this category…

Algebraic Topology · Mathematics 2009-12-21 Krzysztof Worytkiewicz

We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly…

Combinatorics · Mathematics 2021-08-23 C. M. Mynhardt , A. K. Wright

A cocycle category H(X,Y) is defined for objects X and Y in a model category, and it is shown that the set of morphisms [X,Y] is isomorphic to the set of path components of H(X,Y) provided the ambient model category is right proper and…

Algebraic Topology · Mathematics 2007-05-23 J. F. Jardine

We develop a compositional framework for formal synthesis of hybrid systems using the language of category theory. More specifically, we provide mutually compatible tools for hierarchical, sequential, and independent parallel composition.…

Category Theory · Mathematics 2020-08-12 Jared Culbertson , Paul Gustafson , Daniel E. Koditschek , Peter F. Stiller

Herein we develop category-theoretic tools for understanding network-style diagrammatic languages. The archetypal network-style diagrammatic language is that of electric circuits; other examples include signal flow graphs, Markov processes,…

Category Theory · Mathematics 2016-09-20 Brendan Fong

We define a family of convex polytopes called constrainahedra, which index collisions of horizontal and vertical lines. Our construction proceeds by first defining a poset $C(m,n)$ of good rectangular preorders, then proving that $C(m,n)$…

Combinatorics · Mathematics 2022-09-01 Nathaniel Bottman , Daria Poliakova

One way of interpreting a left Kan extension is as taking a kind of "partial colimit", whereby one replaces parts of a diagram by their colimits. We make this intuition precise by means of the "partial evaluations" sitting in the so-called…

Category Theory · Mathematics 2024-04-15 Paolo Perrone , Walter Tholen

The chromatic polynomial is characterized as the unique polynomial invariant of graphs, compatible with two interacting bialgebras structures: the first coproduct is given by partitions of vertices into two parts, the second one by a…

Rings and Algebras · Mathematics 2021-05-05 Loïc Foissy

We develop the notion of the composition of two coalgebras, which arises naturally in higher category theory and the theory of species. We prove that the composition of two cofree coalgebras is cofree and give conditions which imply that…

Combinatorics · Mathematics 2010-12-17 Stefan Forcey , Aaron Lauve , Frank Sottile

We introduce categories $\M$ and $\S$ internal in the tricategory $\Bicat_3$ of bicategories, pseudofunctors, pseudonatural transformations and modifications, for matrices and spans in a 1-strict tricategory $V$. Their horizontal…

Category Theory · Mathematics 2022-07-28 Bojana Femić , Enrico Ghiorzi

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…

Category Theory · Mathematics 2012-11-13 Yves Guiraud , Philippe Malbos

We prove a number of results concerning monomorphisms, epimorphisms, dominions and codominions in categories of coalgebras. Examples include: (a) representation-theoretic characterizations of monomorphisms in all of these categories that…

Quantum Algebra · Mathematics 2023-02-28 Alexandru Chirvasitu

The category of all monads over many-sorted sets (and over other "set-like" categories) is proved to have coequalizers and strong cointersections. And a general diagram has a colimit whenever all the monads involved preserve monomorphisms…

Logic in Computer Science · Computer Science 2014-09-15 Jiří Adámek

We compare the bicategory of spans with that of bisets (a.k.a. bimodules, distributors, profunctors) in the context of finite groupoids. We construct in particular a well-behaved pseudo-functor from spans to bisets. This yields an…

Category Theory · Mathematics 2020-09-10 Ivo Dell'Ambrogio , James Huglo

In this note on coarse geometry we revisit coarse homotopy. We prove that coarse homotopy indeed is an equivalence relation, and this in the most general context of abstract coarse structures. We introduce (in a geometric way) coarse…

Geometric Topology · Mathematics 2023-08-14 Paul D. Mitchener , Behnam Norouzizadeh , Thomas Schick

A prescription for constructing dictionaries for cardinal spline spaces on a compact interval is provided. It is proved that such spaces can be spanned by dictionaries which are built by translating a prototype B-spline function of fixed…

Functional Analysis · Mathematics 2007-05-23 Miroslav Andrle , Laura Rebollo-Neira

We study rewriting for equational theories in the context of symmetric monoidal categories where there is a separable Frobenius monoid on each object. These categories, also called hypergraph categories, are increasingly relevant: Frobenius…

Logic in Computer Science · Computer Science 2018-01-04 Fabio Zanasi

It is known that the canonical double cover of any connected nonbipartite graph have an automorphism group of the form $H \rtimes \mathbb{Z}_2$, where $H$ is the set of automorphism which preserve bipartite parts. We construct connected…

Combinatorics · Mathematics 2024-06-11 Bartłomiej Bychawski

Nested conditions are used, among other things, as a graphical way to express first order formulas ruling the applicability of a graph transformation rule to a given match. In this paper, we propose (for the first time) a notion of…

Logic in Computer Science · Computer Science 2024-08-13 Arend Rensink , Andrea Corradini