Related papers: Free Commutative Monoids in Homotopy Type Theory
Containers represent a wide class of type constructions relevant for functional programming and (co)inductive reasoning. Indexed containers generalize this notion to better fit the scope of dependently typed programming. When interpreting…
In this paper, we study the topological structure of a universal construction related to quasitopological groups: the free quasitopological group $F_q(X)$ on a space $X$. We show that free quasitopological groups may be constructed directly…
Let $M$ be a monoid and $G:\mathbf{Mon} \to \mathbf{Grp}$ be the group completion functor from monoids to groups. Given a collection $\mathcal{X}$ of submonoids of $M$ and for each $N\in \mathcal{X}$ a collection $\mathcal{Y}_N$ of…
We study the algebraic properties of binary relations whose underlying digraph is smooth, that is has no source or sink. Such objects have been studied as surjective hyper-operations (shops) on the corresponding vertex set, and as binary…
We develop the theory of tricategorical limits and colimits, and show that they can be modelled up to biequivalence via certain homotopically well-behaved limits and colimits enriched over the monoidal model category $\mathbf{Gray}$ of…
We show that the bicategory of finite groupoids and right-free permutation bimodules is a quotient of the bicategory of Mackey 2-motives introduced in arXiv:1808.04902, obtained by modding out the so-called cohomological relations. This…
Polynomial functors are useful in the theory of data types, where they are often called containers. They are also useful in algebra, combinatorics, topology, and higher category theory, and in this broader perspective the polynomial aspect…
Varieties of quantitative algebras are fully described by their free-algebra monads on the category Met of metric spaces. For a longer time it has been an open problem whether the resulting enriched monads are precisely the strongly…
We show that if a complex has free finitely generated reduced homology groups for two consecutive dimensions and trivial homology for all other dimensions, then it must have the homotopy type of a wedge of spheres of two consecutive…
These notes are based on a series of three lectures given (online) by the first named author at the workshop "Higher Structures and Operadic Calculus" at CRM Barcelona in June 2021. The aim is to give a concise introduction to rational…
We start the general structure theory of not necessarily semisimple finite tensor categories, generalizing the results in the semisimple case (i.e. for fusion categories), obtained recently in our joint work with D.Nikshych. In particular,…
In a previous work, by extending the classical Quillen construction to the non-simply connected case, we have built a pair of adjoint functors, 'model' and 'realization', between the categories of simplicial sets and complete differential…
A finitely generated commutative monoid is uniquely presented if it has only a minimal presentation. We give necessary and sufficient conditions for finitely generated, combinatorially finite, cancellative, commutative monoids to be…
We discuss some finite homogeneous structures, addressing the question of universality of their automorphism groups. We also study the existence of so-called Kat\v{e}tov functors in finite categories of embeddings or homomorphisms.
In constructive set theory, an ordinal is a hereditarily transitive set. In homotopy type theory (HoTT), an ordinal is a type with a transitive, wellfounded, and extensional binary relation. We show that the two definitions are equivalent…
We use derived localization of the bar and nerve constructions to provide simple proofs of a number of results in algebraic topology. This includes a recent generalization of Adams' cobar-construction to the non-simply connected case, and a…
The stable category of modules over the algebra of a finite group with coefficients in a field is a compactly generated tensor triangulated category, that has been studied extensively in representation theory. In this paper, we provide a…
The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…
We introduce structured decompositions, category-theoretic structures which simultaneously generalize notions from graph theory (including treewidth, layered treewidth, co-treewidth, graph decomposition width, tree independence number,…
We develop a homotopy theory for additive categories endowed with endofunctors, analogous to the concept of a model structure. We use it to construct the homotopy theory of a Hovey triple (which consists of two compatible complete cotorsion…