Related papers: Amalgamable diagram shapes

Let $k$ be a field, $Q$ a finite directed graph, and $kQ$ its path algebra. Make $kQ$ an $\NN$-graded algebra by assigning each arrow a positive degree. Let $I$ be a homogeneous ideal in $kQ$ and write $A=kQ/I$. Let $\QGr A$ denote the…

Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…

The homotopy category of $N_\infty$ operads is equivalent to a finite lattice, and as the ambient group varies, there are various image constructions between these lattices. In this paper, we explain how to lift this algebraic structure…

In the standard category of directed graphs, graph morphisms map edges to edges. By allowing graph morphisms to map edges to finite paths (path homomorphisms of graphs), we obtain an ambient category in which we determine subcategories…

Given an associative algebra $A$, and the category, $\cC$, of its finite dimensional modules, additional structures on the algebra $A$ induce corresponding ones on the category $\cC$. Thus, the structure of a rigid quasi-tensor (braided…

We show that the free construction from multicategories to permutative categories is a categorically-enriched non-symmetric multifunctor. Our main result then shows that the induced functor between categories of algebras is an equivalence…

We show that every graph admits a canonical tree-like decomposition into its $k$-edge-connected pieces for all $k\in\mathbb{N}\cup\{\infty\}$ simultaneously.

This paper gives a uniform-theoretic refinement of classical homotopy theory. Both cubical sets (with connections) and uniform spaces admit classes of weak equivalences, special cases of classical weak equivalences, appropriate for the…

This paper lays the groundwork for the theory of categorical diagonalization. Given a diagonalizable operator, tools in linear algebra (such as Lagrange interpolation) allow one to construct a collection of idempotents which project to each…

In all $\kappa$-accessible additive categories, $\kappa$-pure monomorphisms and $\kappa$-pure epimorphisms are well-behaved, as shown in our previous paper arXiv:2311.02418. This is known to be not always true in $\kappa$-accessible…

In category theory, the use of string diagrams is well known to aid in the intuitive understanding of certain concepts, particularly when dealing with adjunctions and monoidal categories. We show that string diagrams are also useful in…

We completely classify the locally finite, infinite graphs with pure mapping class groups admitting a coarsely bounded generating set. We also study algebraic properties of the pure mapping class group: We establish a semidirect product…

For certain families of compact subsets of the plane, the isomorphism class of the algebra of absolutely continuous functions on a set is completely determined by the homeomorphism class of the set. This is analogous to the…

For a locally presentable abelian category $\mathsf B$ with a projective generator, we construct the projective derived and contraderived model structures on the category of complexes, proving in particular the existence of enough homotopy…

We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…

We construct a category of fibrant objects $\mathbb{C}\langle P\rangle$ in the sense of K. Brown from any indexed frame (a kind of indexed poset generalizing triposes) $P$, and show that its homotopy category is the Barr-exact category…

Thomason's Homotopy Colimit Theorem has been extended to bicategories and this extension can be adapted, through the delooping principle, to a corresponding theorem for diagrams of monoidal categories. In this version, we show that the…

A class $\mathcal{G}$ of graphs is called hereditary if it is closed under taking induced subgraphs. We denote by $\mathcal{G}^\mathrm{apex}$ the class of graphs $G$ that contain a vertex $v$ such that $G-v$ is in $\mathcal{G}$. We prove…

Let $\mathcal{C}$ be an additive category. The nilpotent category $\mathrm{Nil} (\mathcal{C})$ of $\mathcal{C}$, consists of objects pairs $(X, x)$ with $X\in\mathcal{C}, x\in\mathrm{End}_{\mathcal{C}}(X)$ such that $x^n=0$ for some…

The classifying diagram was defined by Rezk and is a generalization of the nerve of a category; in contrast to the nerve, the classifying diagram of two categories is equivalent if and only if the categories are equivalent. In this paper we…