Continuously triangulating the continuous cluster category
نویسندگان
چکیده
منابع مشابه
Defining an m−cluster category
In this paper, starting with a simply laced root system, we define a triangulated category which we call the m-cluster category, and we show that it encodes the combinatorics of the m-clusters of Fomin and Reading in a fashion similar to the way the cluster category of Buan, Marsh, Reineke, Reiten, and Todorov encodes the combinatorics of the clusters of Fomin and Zelevinsky. For Φ any root sys...
متن کاملContinuous Cluster Categories Ii: Continuous Cluster-tilted Categories
We show that the quotients of the continuous cluster category Cπ and the rational subcategory X modulo the additive subcategory generated by any cluster are abelian categories and we show that they are isomorphic to categories of infinite and finite length modules, respectively, over the endomorphism ring of the cluster. These theorems extend the theorems of Caldero-ChapotonSchiffler and Buan-M...
متن کاملTriangulating the Real Projective Plane
We consider the problem of computing a triangulation of the real projective plane P , given a finite point set P = {p1, p2, . . . , pn} as input. We prove that a triangulation of P always exists if at least six points in P are in general position, i.e., no three of them are collinear. We also design an algorithm for triangulating P if this necessary condition holds. As far as we know, this is t...
متن کاملOn a category of cluster algebras
Abstract. We introduce a category of cluster algebras with fixed initial seeds. This category has countable coproducts, which can be constructed combinatorially, but no products. We characterise isomorphisms and monomorphisms in this category and provide combinatorial methods for constructing special classes of monomorphisms and epimorphisms. In the case of cluster algebras from surfaces, we de...
متن کاملHybrid Percolation Transition in Cluster Merging Processes: Continuously Varying Exponents.
Consider growing a network, in which every new connection is made between two disconnected nodes. At least one node is chosen randomly from a subset consisting of g fraction of the entire population in the smallest clusters. Here we show that this simple strategy for improving connection exhibits a more unusual phase transition, namely a hybrid percolation transition exhibiting the properties o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2020
ISSN: 0166-8641
DOI: 10.1016/j.topol.2020.107411