Related papers: A note on stable recollements
We derive a simple analytical expression for the level correlation function of an integrable system. It accounts for both the lack of correlations at smaller energy scales and for global rigidity (level number conservation) at larger…
Given the pair of a dualizing $k$-variety and its functorially finite subcategory, we show that there exists a recollement consisting of their functor categories of finitely presented objects. We provide several applications for Auslander's…
This is a short expository account of the regularity lemma for stable graphs proved by the authors, with some comments on the model theoretic context, written for a general logical audience.
Taking advantage of a recently discovered associativity property of rule compositions, we extend the classical concurrency theory for rewriting systems over adhesive categories. We introduce the notion of tracelets, which are defined as…
We introduce a new concept of s-recollements of extriangulated categories, which generalizes recollements of abelian categories, recollements of triangulated categories, as well as recollements of extriangulated categories. Moreover, some…
In this paper, we prove that given a differential graded category C and B a full differential graded subcategory closed under coproducts, there is a canonical recollement of differential graded categories, for which we use enriched…
Ladders of recollements of abelian categories are introduced, and used to address three general problems. Ladders of a certain height allow to construct recollements of triangulated categories, involving derived categories and singularity…
When identified with sequences of irreducible Hermitian-Einstein connections, sequences of stable holomorphic bundles of fixed topological type and bounded degree on a compact complex surface equipped with a Gauduchon metric are shown to…
This paper explores alternative statements of the axioms for lattice gluing, focusing on lattices that are modular, locally finite, and have finite covers, but may have infinite height. We give a set of "maximal" axioms that maximize what…
We obtain a characterization of left perfect rings via superstability of the class of flat left modules with pure embeddings. $\mathbf{Theorem.}$ For a ring $R$ the following are equivalent. - $R$ is left perfect. - The class of flat left…
Various problems on integers lead to the class of congruence preserving functions on rings, i.e. functions verifying $a-b$ divides $f(a)-f(b)$ for all $a,b$. We characterized these classes of functions in terms of sums of rational…
This paper considers quasi-reductivity - essentially, the property that an evaluation cannot get "stuck" due to a missing case in pattern matching - in the context of term rewriting with logical constraints.
This is mostly an overview. Given finitely presentable abelian categories $A$ and $B$, we sketch the construction of an abelian category of continuous functors from $A$ to $B$ that has nice $2$-categorical behaviour and gives an explicit…
Recently, Wang, Wei and Zhang define the recollement of extriangulated categories, which is a generalization of both recollement of abelian categories and recollement of triangulated categories. For a recollement $(\mathcal A ,\mathcal…
The (co)completeness problem for the (projectively) stable module category of an associative ring is studied. (Normal) monomorphisms and (normal) epimorphisms in such a category are characterized. As an application, we give a criterion for…
We give a general framework for the treatment of perturbations of types and structures in continuous logic, allowing to specify which parts of the logic may be perturbed. We prove that separable, elementarily equivalent structures which are…
This paper investigates coherent-like conditions and related properties that a trivial extension might inherit from the ground ring over some classes of modules. It captures previous results dealing primarily with coherence, and also…
It is shown that a recollement of derived categories of algebras induces those of tensor product algebras and opposite algebras respectively, which is applied to clarify the relations between recollements of derived categories of algebras…
Logically constrained term rewriting is a rewriting framework that supports built-in data structures such as integers and bit vectors. Recently, constrained terms play a key role in various analyses and applications of logically constrained…
We initiate the study of reducts of relational structures up to primitive positive interdefinability: After providing the tools for such a study, we apply these tools in order to obtain a classification of the reducts of the logic of…