In a previous article, we introduced notions of finiteness obstruction , Euler characteristic, and L 2-Euler characteristic for wide classes of categories. In this sequel, we prove the compatibility of those notions with homo-topy colimits of I-indexed categories where I is any small category admitting a finite I-CW-model for its I-classifying space. Special cases of our Homotopy Colimit Formul...

In this paper we represent the Vassiliev model for the homotopy type of the one-point compactification of subspace arrangements as a homotopy colimit of an appropriate diagram over the nerve complex of the intersection semilattice of the arrangement. Furthermore, using a generalization of simplicial collapses to diagrams of topological spaces over simplicial complexes, we construct an explicit ...

1. Non-Banach limits C(R), C∞(R) of Banach spaces C[a, b] 2. Banach completion C o (R) of C c (R) 3. Rapid-decay functions, Schwartz functions 4. Non-Fréchet colimit C∞ c (R) of Fréchet spaces 5. LF-spaces of moderate-growth functions 6. Strong operator topology 7. Generalized functions (distributions) on R 8. Tempered distributions and Fourier transforms on R 9. Test functions and Paley-Wiener...

This paper tries to explain why and how category theory is useful in computing science, by giving guidelines for applying seven basic categorical concepts: category, functor, natural transformation, limit, adjoint, colimit and comma category. Some examples, intuition, and references are given for each concept, but completeness is not attempted. Some additional categorical concepts and some sugg...

We provide a graded and quantum version of the category of rooted cluster algebras introduced by Assem, Dupont and Schiffler and show that every graded quantum cluster algebra of infinite rank can be written as a colimit of graded quantum cluster algebras of finite rank. As an application, for each k we construct a graded quantum infinite Grassmannian admitting a cluster algebra structure, exte...

We present a new compositional approach to game theory (CGT) based upon Arrows, concept originally from functional programming, closely related Tambara modules, and operators build Arrows old. model equilibria as bimodule over an Arrow define operator such existing Arrow. also strategies graded which builds by taking the colimit of A final bimodule. use this CGT show how known previously unknow...

That is, maps from A to B∗ are given by integral kernels in (A⊗B)∗. However, the validity of this adjunction depends on existence of a genuine tensor product. We recall in an appendix the demonstration that infinitedimensional Hilbert spaces do not have tensor products. Also, we must specify the topology on the duals B∗ and (A⊗B)∗. The strongest conclusion gives these the strong topology, as co...