English
Related papers

Related papers: Polynomial recognition of cluster algebras of fini…

200 papers

This paper continues the study of cluster algebras initiated in math.RT/0104151. Its main result is the complete classification of the cluster algebras of finite type, i.e., those with finitely many clusters. This classification turns out…

Rings and Algebras · Mathematics 2015-06-26 Sergey Fomin , Andrei Zelevinsky

The paper is motivated by an analogy between cluster algebras and Kac-Moody algebras: both theories share the same classification of finite type objects by familiar Cartan-Killing types. However the underlying combinatorics beyond the two…

Combinatorics · Mathematics 2019-03-05 Michael Barot , Christof Geiss , Andrei Zelevinsky

In 2003, Fomin and Zelevinsky obtained Cartan-Killing type classification of all cluster algebras of finite type, i.e. cluster algebras having only finitely many distinct cluster variables. A wider class of cluster algebras is formed by…

Combinatorics · Mathematics 2019-10-25 Anna Felikson , Michael Shapiro , Pavel Tumarkin

We provide a complete classification of the singularities of cluster algebras of finite type with trivial coefficients. Alongside, we develop a constructive desingularization of these singularities via blowups in regular centers over fields…

Algebraic Geometry · Mathematics 2022-06-01 Angelica Benito , Eleonore Faber , Hussein Mourtada , Bernd Schober

In this paper, we prove Conjecture 4.8 of "Cluster algebras IV" by S. Fomin and A. Zelevinsky, stating that the mutation classes of rectangular matrices associated with cluster algebras of finite type are precisely those classes which are…

Combinatorics · Mathematics 2011-06-30 Ahmet Seven

Barot, Geiss and Zelevinsky define a notion of a ``cyclically orientable graph'' and use it to devise a test for whether a cluster algebra is of finite type. Barot, Geiss and Zelivinsky's work leaves open the question of giving an efficient…

Combinatorics · Mathematics 2007-05-23 David E Speyer

We give a uniform geometric realization for the cluster algebra of an arbitrary finite type with principal coefficients at an arbitrary acyclic seed. This algebra is realized as the coordinate ring of a certain reduced double Bruhat cell in…

Rings and Algebras · Mathematics 2008-05-19 Shih-Wei Yang , Andrei Zelevinsky

We complete classification of mutation-finite cluster algebras by extending the technique derived by Fomin, Shapiro, and Thurston to skew-symmetrizable case. We show that for every mutation-finite skew-symmetrizable matrix a diagram…

Combinatorics · Mathematics 2019-10-25 Anna Felikson , Michael Shapiro , Pavel Tumarkin

We show that cluster algebras do not contain non-trivial units and that all cluster variables are irreducible elements. Both statements follow from Fomin and Zelevinsky's Laurent phenomenon. As an application we give a criterion for a…

Rings and Algebras · Mathematics 2013-05-10 Christof Geiß , Bernard Leclerc , Jan Schröer

This paper studies cluster algebras locally, by identifying a special class of localizations which are themselves cluster algebras. A `locally acyclic cluster algebra' is a cluster algebra which admits a finite cover (in a geometric sense)…

Algebraic Geometry · Mathematics 2014-05-19 Greg Muller

We classify mutation-finite cluster algebras with arbitrary coefficients of geometric type.

Combinatorics · Mathematics 2023-08-29 Anna Felikson , Pavel Tumarkin

We investigate the cluster-tilted algebras of finite representation type over an algebraically closed field. We give an explicit description of the relations for the quivers for finite representation type. As a consequence we show that a…

Representation Theory · Mathematics 2020-12-21 Aslak Bakke Buan , Bethany Marsh , Idun Reiten

Cluster algebras have recently become an important player in mathematics and physics. In this work, we investigate them through the lens of modern data science, specifically with techniques from network science and machine learning. Network…

Combinatorics · Mathematics 2024-02-26 Pierre-Philippe Dechant , Yang-Hui He , Elli Heyes , Edward Hirst

Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…

Discrete Mathematics · Computer Science 2015-03-12 Elisângela Silva Dias , Diane Castonguay , Mitre Costa Dourado

We describe a new way to relate an acyclic, skew-symmetrizable cluster algebra to the representation theory of a finite dimensional hereditary algebra. This approach is designed to explain the c-vectors of the cluster algebra. We obtain a…

Representation Theory · Mathematics 2012-03-02 David Speyer , Hugh Thomas

We continue our investigation on denominator conjecture of Fomin and Zelevinsky for cluster algebras via geometric models initialed in \cite{FG22}. In this paper, we confirm the denominator conjecture for cluster algebras of finite type.…

Representation Theory · Mathematics 2024-11-19 Changjian Fu , Shengfei Geng

We study the notion of positive and negative complexity of pairs of objects in cluster categories. The first main result shows that the maximal complexity occurring is either one, two or infinite, depending on the representation type of the…

Category Theory · Mathematics 2010-01-06 Petter Andreas Bergh , Steffen Oppermann

We provide a complete classification of the singularities of cluster algebras of finite cluster type. This extends our previous work about the case of trivial coefficients. Additionally, we classify the singularities of cluster algebras for…

Algebraic Geometry · Mathematics 2025-09-23 Angélica Benito , Eleonore Faber , Hussein Mourtada , Bernd Schober

In this paper, we study combinatorial properties of quasi-Cartan companions defined by the c-vectors of acyclic skew-symmetrizable cluster algebras. In particular, we show that the diagram of any skew-symmetrizable matrix associated with an…

Combinatorics · Mathematics 2018-02-27 Ahmet Seven

Satisfiability of Boolean circuits is among the most known and important problems in theoretical computer science. This problem is NP-complete in general but becomes polynomial time when restricted either to monotone gates or linear gates.…

Computational Complexity · Computer Science 2017-10-24 Paweł M. Idziak , Jacek Krzaczkowski
‹ Prev 1 2 3 10 Next ›