Related papers: Localization theory for triangulated categories
We introduce and study mutation of torsion pairs, as a generalization of mutation of cluster tilting objects, rigid objects and maximal rigid objects. It is proved that any mutation of a torsion pair is again a torsion pair. A geometric…
We investigate the notions of \emph{localization} and \emph{filtration} in the context of extended affine Lie algebras. Our primary objective is to develop a localization theory that facilitates the construction of meaningful local…
Classification is a major tool of statistics and machine learning. A classification method first processes a training set of objects with given classes (labels), with the goal of afterward assigning new objects to one of these classes. When…
Transfer Learning (TL) aims to transfer knowledge acquired in one problem, the source problem, onto another problem, the target problem, dispensing with the bottom-up construction of the target model. Due to its relevance, TL has gained…
We develop the K-theory of sets with an action of a pointed monoid (or monoid scheme), analogous to the $K$-theory of modules over a ring (or scheme). In order to form localization sequences, we construct the quotient category of a nice…
Localization is a topological technique that allows us to make global equivariant computations in terms of local data at the fixed points. For example, we may compute a global integral by summing integrals at each of the fixed points. Or,…
Localization methods are ubiquitous in cyclic homology theory, but vary in detail and are used in different scenarios. In this paper we will elaborate on a common feature of localization methods in noncommutative geometry, namely…
Place classification is a fundamental ability that a robot should possess to carry out effective human-robot interactions. It is a nontrivial classification problem which has attracted many research. In recent years, there is a high…
A network is called localizable if the positions of all the nodes of the network can be computed uniquely. If a network is localizable and embedded in plane with generic configuration, the positions of the nodes may be computed uniquely in…
We give a characterisation of the extriangulated categories which admit the structure of a triangulated category. We show that these are the extriangulated categories where for every object $X$ in the extriangulated category, the morphism…
The goal of the article is to better understand cosupport in triangulated categories since it is still quite mysterious. We study boundedness of local cohomology and local homology functors using Koszul objects, give some characterizations…
Clustering is a common technique for statistical data analysis, which is used in many fields, including machine learning, data mining, pattern recognition, image analysis and bioinformatics. Clustering is the process of grouping similar…
We introduce the notion of a rank function on a triangulated category $\mathcal{C}$ which generalizes the Sylvester rank function in the case when $\mathcal{C}=\operatorname{Perf}(A)$ is the perfect derived category of a ring $A$. We show…
We study localizations of infinity categories that remain localizations after any base change.
We show that the class of inductively factored arrangements is closed under taking localizations. We illustrate the usefulness of this with an application.
We study abelian localizations of triangulated categories induced by rigid contravariantly finite subcategories, and also triangulated structures on subfactor categories of triangulated categories. In this context we generalize recent…
Data clustering is the process of identifying natural groupings or clusters within multidimensional data based on some similarity measure. Clustering is a fundamental process in many different disciplines. Hence, researchers from different…
Anderson localization provides a challenge to numerical approaches due to the inherent randomness, and hence absence of simple symmetries, in its discrete Hamiltonian representation. Numerous algorithmic approaches have been developed or…
Given a recollement of three proper dg algebras over a noetherian commutative ring, e.g. three algebras which are finitely generated over the base ring, which extends one step downwards, it is shown that there is a short exact sequence of…
We show how the categorial approach to inverse monoids can be described as a certain endofunctor (which we call the partialization functor) of some category. In this paper we show that this functor can be used to obtain several recently…