Related papers: Algebraic weak factorisation systems I: accessible…
We analyze the structure of left maps in algebraic weak factorization systems constructed using Garner's algebraic small object argument. We find that any left map can be constructed from generators in Bourke and Garner's double category of…
Strong bisimulation for labelled transition systems is one of the most fundamental equivalences in process algebra, and has been generalised to numerous classes of systems that exhibit richer transition behaviour. Nearly all of the ensuing…
If a locally cartesian closed category carries a weak factorisation system, then the left maps are stable under pullback along right maps if and only if the right maps are closed under pushforward along right maps. We refer to this…
Recent models of intensional type theory have been constructed in algebraic weak factorization systems (AWFSs). AWFSs give rise to comprehension categories that feature non-trivial morphisms between types; these morphisms are not used in…
This paper introduces lax orthogonal algebraic weak factorisation systems on 2-categories and describes a method of constructing them. This method rests in the notion of simple 2-monad, that is a generalisation of the simple reflections…
Weak (Hopf) bialgebras are described as (Hopf) bimonoids in appropriate duoidal (also known as 2-monoidal) categories. This interpretation is used to define a category wba of weak bialgebras over a given field. As an application, the "free…
We investigate the extent to which the weak equivalences in a model category can be equipped with algebraic structure. We prove, for instance, that there exists a monad T such that a morphism of topological spaces admits T-algebra structure…
Introduced in the 1990s in the context of the algebraic approach to graph rewriting, gs-monoidal categories are symmetric monoidal categories where each object is equipped with the structure of a commutative comonoid. They arise for example…
Bourke and Garner described how to cofibrantly generate algebraic weak factorisation systems by a small double category of morphisms. However they did not give an explicit construction of the resulting factorisations as in the classical…
The Minimum Weighted Feedback Arc Set (MWFAS) problem is closely related to the task of deriving a global ranking from pairwise comparisons. Recent work by He et al. (ICML 2022) advanced the state of the art on ranking benchmarks using…
A weak mixed distributive law (also called weak entwining structure) in a 2-category consists of a monad and a comonad, together with a 2-cell relating them in a way which generalizes a mixed distributive law due to Beck. We show that a…
The small object argument is a method for transfinitely constructing weak factorization systems originally motivated by homotopy theory. We establish a variant of the small object argument that is enriched over a cofibrantly generated weak…
In this paper, we define and study weak monoidal Hom-Hopf algebras, which generalize both weak Hopf algebras and monoidal Hom-Hopf algebras. If $H$ is a weak monoidal Hom-Hopf algebra with bijective antipode and let $Aut_{wmHH}(H)$ be the…
We explain how any cofibrantly generated weak factorisation system on a category may be equipped with a universally and canonically determined choice of cofibrant replacement. We then apply this to the theory of weak omega-categories,…
We introduce a notion of signature whose sorts form a direct category, and study computads for such signatures. Algebras for such a signature are presheaves with an interpretation of every function symbol of the signature, and we describe…
We prove that a weak factorization system on a locally presentable category is accessible if and only if it is small generated in the sense of R. Garner. Moreover, we discuss an analogy of Smith's theorem for accessible model categories.
Weak bimonoids in duoidal categories are introduced. They provide a common generalization of bimonoids in duoidal categories and of weak bimonoids in braided monoidal categories. Under the assumption that idempotent morphisms in the base…
We relate weak distributive laws in SetMat to strictly associative (but not strictly unital) pseudoalgebras of the 2-monad (-)^2 on Cat. The corresponding orthogonal factorization systems are characterized by a certain bilinearity property.
Weighted labelled transition systems are LTSs whose transitions are given weights drawn from a commutative monoid. WLTSs subsume a wide range of LTSs, providing a general notion of strong (weighted) bisimulation. In this paper we extend…
The concept of a weak factorization system has been studied extensively in homotopy theory and has recently found an application in one of the proofs of the celebrated flat cover conjecture, categorical versions of which have been presented…