Related papers: Filters and G-convergence in Categories
Filter convergence of vector lattice-valued measures is considered, in order to deduce theorems of convergence for their decompositions. First the $\sigma$-additive case is studied, without particular assumptions on the filter; later the…
We study the localization along a filter of several dynamical notions. This generalizes and extends similar localizations that have been considered in the literature, e.g. near 0 and near an idempotent. Definitions and basic properties of…
Motivated by potential applications to theoretical computer science, in particular those areas where the Curry-Howard correspondence plays an important role, as well as by the ongoing search in pure mathematics for feasible approaches to…
Gillam proved that the category of locally ringed spaces admits a fully faithful embedding into a certain category, which has a right adjoint that maps some simple objects to the spectra of rings. In this paper, we use condensed mathematics…
The main aim of this paper is to provide a description of neighbourhood operators in finitely complete categories with finite coproducts and a proper factorisation system such that the semilattice of admissible subobjects make a…
This paper extends the notion of geometric control in algebraic K-theory from additive categories with split exact sequences to other exact structures. In particular, we construct exact categories of modules over a Noetherian ring filtered…
We give a classification theorem for a relevant class of $t$-structures in triangulated categories, which includes in the case of the derived category of a Grothendieck category, the $t$-structures whose hearts have at most $n$ fixed…
We consider a generalized version of the correlation clustering problem, defined as follows. Given a complete graph $G$ whose edges are labeled with $+$ or $-$, we wish to partition the graph into clusters while trying to avoid errors: $+$…
This is an exposition of homotopical results on the geometric realization of semi-simplicial spaces. We then use these to derive basic foundational results about classifying spaces of topological categories, possibly without units. The…
We prove a general theorem which includes most notions of "exact completion". The theorem is that "k-ary exact categories" are a reflective sub-2-category of "k-ary sites", for any regular cardinal k. A k-ary exact category is an exact…
We survey foundational principles of Grothendieck's generalized spaces, including a critical glossary of the various, and often conflicting, terminological usages. Known results using generalized points support a fully pointwise notation…
We relate the theory of purity of a locally finitely presented category with products to the study of exact structures on the full subcategory of finitely presented objects. Properties in the context of purity are translated to properties…
Abstract. We provide a characterization of classes of filters $\mathbb{D}$ for which the full subcategory $\operatorname{fix}\operatorname{A}_{\mathbb D}$ of $\mathsf{Conv}$ formed by convergences determined by the adherence of filters of…
Grothendieck Duality -- the theory of the twisted inverse image pseudofunctor (-)^! over a suitable category of scheme-maps -- can be developed concretely, with emphasis on explicit constructions, or abstractly, with emphasis on…
We present the notion of a filtered bundle as a generalisation of a graded bundle. In particular, we weaken the necessity of the transformation laws for local coordinates to exactly respect the weight of the coordinates by allowing more…
We study completeness of a topological vector space with respect to different filters on the set N of all naturals. In the metrizable case all these kinds of completeness are the same, but in non-metrizable case the situation changes. For…
Clustering methods group a set of data points into a few coherent groups or clusters of similar data points. As an example, consider clustering pixels in an image (or video) if they belong to the same object. Different clustering methods…
Graph clustering is the problem of identifying sparsely connected dense subgraphs (clusters) in a given graph. Proposed clustering algorithms usually optimize various fitness functions that measure the quality of a cluster within the graph.…
A non-self-contained gathering of notes on category theory, including the definition of locally cartesian closed category, of the cartesian structure in slice categories, or of the pseudo-cartesian structure on Eilenberg-Moore categories.…
This paper introduces a new definition of multiscale neighborhoods in 3D point clouds. This definition, based on spherical neighborhoods and proportional subsampling, allows the computation of features with a consistent geometrical meaning,…