Related papers: A note on stable recollements
Many kinds of categorical structure require the existence of finite limits, of colimits of some specified type, and of "exactness" conditions between the finite limits and the specified colimits. Some examples are the notions of regular, or…
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…
We construct a compact closed category out of any symmetric monoidal category by freely adding adjoints to its objects. The morphisms of the completion are defined as string diagrams annotated by objects and morphisms from the original…
We redevelop persistent homology (topological persistence) from a categorical point of view. The main objects of study are diagrams, indexed by the poset of real numbers, in some target category. The set of such diagrams has an interleaving…
We describe the notion of stability of coherent systems as a framework to deal with redundancy. We define stable coherent systems and show how this notion can help the design of reliable systems. We demonstrate that the reliability of…
A planar graph is inscribable if it is combinatorial equivalent to the skeleton of a polyhedra which is inscribed in a sphere. For an inscribable graph, in its combinatorial equivalent class, if we could always find polyhedra inscribed in…
We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…
A foundational theory of compositional categorical rewriting theory is presented, based on a collection of fibration-like properties that collectively induce and intrinsically structure the large collection of lemmata used in the proofs of…
We study a structure of subcategories which are called a polygon of recollements in a triangulated category. First, we study a $2n$-gon of recollements in an $(m/n)$-Calabi-Yau triangulated category. Second, we show the homotopy category…
We introduce the blockwise gluing construction. This describes residuated integral chains which can be decomposed into (possibly) partial algebras, stacked one on top of the other, and such that elements in a certain component multiply in…
In this paper we investigate equivariant recollements of abelian (resp. triangulated) categories. We first characterize when a recollement of abelian (resp. triangulated) categories induces an equivariant recollement, i.e. a recollement…
We study $\varepsilon$-stability in continuous logic. We first consider stability in a model, where we obtain a definability of types result with a better approximation than that in the literature. We also prove forking symmetry for…
A general method of producing correspondences and spectral categories out of symmetric ring objects in general categories is given. As an application, stable homotopy theory of spectra $SH$ is recovered from modules over a commutative…
In this paper we continue the study of triangular matrix categories $\mathbf{\Lambda}=\left[ \begin{smallmatrix} \mathcal{T} & 0 \\ M & \mathcal{U} \end{smallmatrix}\right]$ initiated in [21]. First, given an additive category $\mathcal{C}$…
We identify spaces of half-translation surfaces, equivalently complex curves with quadratic differential, with spaces of stability structures on Fukaya-type categories of punctured surfaces. This is achieved by new methods involving the…
We present a short overview of the structure and couplings of supergravity theories at the component level. We do so with as little technical machinery as possible, working directly with the physical on-shell fields and using explicit…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
In this note we present an $\infty$-categorical framework for descent along adjunctions and a general formula for counting conjugates up to equivalence which unifies several known formulae from different fields.
In persistent topology, q-tame modules appear as a natural and large class of persistence modules indexed over the real line for which a persistence diagram is definable. However, unlike persistence modules indexed over a totally ordered…
In this paper we prove that a morphism between schemes or stacks naturally corresponds to a symmetric monoidal functor between stable infinity-categories of quasi-coherent complexes. It can be viewed as a derived analogue of Tannaka…