sign-coherence of c-vectors and maximal green sequences for acyclic sign-skew-symmetric matrices
Abstract.
In this paper we construct an unfolding for vectors of acyclic sign-skew symmetric matrices and we also prove that the sign-coherence property holds for acyclic sign-skew-symmetric matrices. Then we prove that every acyclic sign-skew-symmetric matrix admits a maximal green sequence.
1. introduction and preliminaries
The problem posed by A. Berenstein, S. Fomin and A. Zelevinsky in [2] on whether any acyclic sign-skew-symmetric integer matrix is totally sign-skew-symmetric or not, was a great motivation for many mathematicians to study such matrices. M. Huang and F. Li gave an affirmative answer to this problem and proved in [10] that acyclic sign-skew-symmetric matrices are totally mutable. The authors in [10] also proved that every acyclic sign-skew-symmetric matrix can be covered by an (infinite) skew-symmetric matrix which is represented by an (infinite) cluster quiver and this covering can perform arbitrary steps of orbit-mutations. This (infinite) quiver is called an unfolding of this acyclic sign-skew-symmetric matrix. The existence of such an unfolding quiver for every acyclic sign-skew-symmetric matrix allows us to tackle problems related to an acyclic sign-skew-symmetric cluster algebra by promoting these problems to an (infinite) skew-symmetric cluster algebra. In this note we try to find an unfolding for the vectores of an acyclic sign-skew-symmetric matrix and prove that it always exists (see paragraph 3 of Remark 2.7). In other words, we prove that every extended acyclic sign-skew-symmetric matrix can be covered by an (infinite) extended skew-symmetric matrix . The construction of this covering keeps the principal part as it was constructed in [10] which makes the ability of performing arbitrary steps of orbit-mutations remain valid. Using the unfolding method, we prove that the sign-coherence property holds for acyclic sign-skew-symmetric matrices, which together with the fact that these matrices are totally mutable, means that maximal green sequences are well-defined for acyclic sign-skew-symmetric matrices. Finally we prove that every acyclic sign-skew-symmetric matrix admits a maximal green sequence (see Theorem 3.10).
A skew-symmetric matrix is an integer matrix of the size , such that for all . A skew-symmetrizable matrix is an integer matrix of the size , such that for is a diagonal matrix with positive integers. is called the symmetrizing matrix. A sign-skew-symmetric matrix is an integer matrix of the size , such that either or for any .
The mutation of a matrix in direction where is the matrix
where:
(1.1) |
Equation (1.1) is called the matrix mutation formula. The mutation is an involution i.e . A skew-symmetric matrix can be represented by a directed diagram called a quiver with vertices such that there are many arrows from to if . is the set of vertices in and is the set of arrows in . The mutation formula can be translated to the language of quivers such that for every , the quiver mutation in direction is obtained by the following steps
-
(1)
for each subquiver add a new arrow .
-
(2)
reverse all arrows with source or target .
-
(3)
remove the arrows in a maximal set of pairwise disjoint 2-cycles.
is finite if and are both finite. A vertex falls in the neighbourhood of a vertex if there is an arrow connecting and .
We can easily check that the skew-symmetricity and the skew-symmetrizablity are invariant under mutation, whereas the sign-skew-symmetricity is not necessarily invariant under mutation.
A sign-skew-symmetric matrix which remains sign-skew-symmetric under any arbitrary finite sequence of mutation is called totally sign-skew-symmetric matrix.
An sign-skew-symmetric matrix can be associated with a (simple) quiver
with vertices such that for each pair with , there is exactly one
arrow from vertex to vertex . Trivially, has no loops and no 2-cycles.
Recall that the sign-skew-symmetric matrix is called acyclic if is acyclic i.e, does not admit any directed cycles [10].
Definition 1.1.
Let be a totally sign-skew-symmetric matrix, we call the extended matrix of . And let be the matrix obtained from by a composition of mutations such that for . Then the lower part of is called the matrix and its columns are called the vectors.
The mutation of a matrix in direction where is the matrix where is given as in Equation (1.1) and such that:
(1.2) |
Remark 1.2.
By convention .( means no mutation has been applied yet and any vector in has its entries either all non-positive or all non-negative.)
If the entries of any vector in the matrix such that are either all non-positive or all non-negative, then we say that the sign-coherence property for matrix holds for the matrix .
The idea of the unfolding method of an acyclic sign-skew-symmetric matrix is to create an (infinite) quiver which covers and can do orbit-mutations. We recall the way to create such quiver as it was mentioned in [10].
A locally-finite quiver is an infinite quiver which has finitely many arrows incident to each of its vertices. A locally-finite quiver can be represented by an infinite and well-defined matrix called the adjacency matrix of such that if there are many arrows from to in .
Definition 1.3.
Let be the adjacency matrix of a locally-finite quiver and let be a permutation acting on , then is said to be an automorphism of or an automorphism of if
Let be a locally-finite quiver and be a subgroup of the symmetric group . If all the elements of are automorphisms of , then is said to be a group of automorphisms of this quiver.
Let be a locally-finite quiver equipped with a group of automorphisms . We denote the orbits created under the action of by such that . A -loop at is an arrow and a -2 cycle at is a pair of arrows such that , and .
Let be a locally-finite quiver with as its adjacency matrix and a group of automorphisms acting on it such that does not admit a -loop or a -2 cycle at any of its orbits, the orbit-mutation in direction is defined as follows
(1.3) |
Since is locally-acyclic, the summation in Equation (1.3) is well-defined and mutations in directions which belong to the same orbit commute since the quiver does not admit a loop, hence we get the fact
(1.4) |
where denotes the indices of which are incident to or and denotes the the composition of mutations in directions .
Definition 1.4.
-
(1)
Let be a locally-finite quiver represented by with no -loops or -2 cycles and with the action of a group of automorphisms such that there are finitely many orbits under the action of this group. The matrix obtained by is called the folding of and denoted by .
-
(2)
Conversely, let be a sing-skew-symmetric matrix such that there is a pair where is a (locally-finite) quiver and is a group of automorphisms and , then is called a covering of .
-
(3)
If is a covering of a sign-skew-symmetric matrix and can perform arbitrary steps of orbit-mutation (the quiver obtained by any finite sequence of orbit-mutation does not have a -loop or -2 cycles), then is called an unfolding of .
Remark 1.5.
Through out this paper, sometimes we drop the group of automorphisms when pointing to an unfolding of a sign-skew-symmetric matrix and write is an unfolding of .
In [10] the authors proved the following Lemma.
Lemma 1.6.
Let be a locally-finite quiver and a group of automorphisms acting on it with finitely many number of orbits such that does not admit any -loops or -2 cycles, then the folding matrix of is a sign-skew-symmetric matrix.
In what follows, we recall the construction that M. Huang and F. Li set up in [10] to find a covering for acyclic sign-skew-symmetric matrices which can take arbitrary steps of orbit-mutation.
Construction 1.7.
Let be an acyclic sign-skew-symmetric matrix. An infinite quiver will be constructed inductively.
-
•
For each , we define a quiver as follows: has
vertices with one vertex labeled by and other vertices labeled by (). If there is an arrow from each vertex labeled by to the unique vertex labeled by . If there is an arrow from the unique vertex labeled by to each vertex labeled by . No arrows between and if . -
•
Suppose we start the constructing process at , we denote . The unique vertex labeled by in is called the old vertex, while the other vertices are called new vertices.
-
•
For a new vertex in labeled by , and share a common arrow denoted by . We glue and along this common arrow. By iterating the gluing procedure for all where is the set of the new vertices in , we get a new quiver whose old vertices are the vertices of and the other vertices are the new vertices. Clearly is a subquiver of .
-
•
Inductively, we obtain from . Similarly, the old vertices are the vertices of and the rest are new.
-
•
Finally, we define the (infinite) quiver , as is always a subquiver of for any .
Remark 1.8.
Clearly we have the following facts:
-
(1)
The underlying quiver is a acyclic, since it is a tree clearly.
-
(2)
The full subquiver of obtained by all the vertices incident to a vertex labeled by is .
-
(3)
Mostly, the quiver constructed as in Construction (1.7) is infinite but in some cases it might be finite. For example when is the adjacency skew-symmetric matrix of a finite tree , then and thus is finite here.
-
(4)
Let be the (infinite) skew-symmetric matrix corresponding to the (infinite) quiver . The entries of are either or .
-
(5)
Let be a subgroup of the symmetric group that sends a vertex of constructed as above to another vertex with the same label. By (2) in Remark 1.8, the vertices which carry different labels are always connected to each other by the same way. That is if , then for every and hence is the maximal subgroup of automorphisms which preserves the labels:
By the action of all the vertices which have the same label lie in the same orbit.
M. Huang and F. Li in [10], proved the following very important two Theorems.
Theorem 1.9.
[10, Theorem 2.17] Any acyclic sign-skew-symmetric matrix of the size is always totally sign-skew-symmetric.
Theorem 1.10.
Remark 1.11.
Through out the proof of Theorem 1.10 in [10], it was proved that the property of no loops and no 2 cycles is preserved under orbit-mutation for the (infinite) quiver constructed as in Construction 1.7 i.e, for any finite sequence of orbit-mutations the quiver does not admit any loops or 2 cycles where for every . This fact will be used later in this paper in places like the proof of Lemma 3.6.
2. The sign-coherence of vectors for an acyclic sign-skew-symmetric matrix
In this section, we modify Construction 1.7 to find an unfolding of the vectores of an extended sign-skew-symmetric matrix .
Let be a locally-finite quiver, the locally-finite framed quiver is the quiver obtained from by adding new vertices in a way that each vertex is connected to a new vertex by a single arrow while remains the same. The elements of the set are called the frozen vertices. This quiver is represented by the extended infinite skew-symmetric matrix . The bottom part of the matrix is called the -matrix and is called the principal part.
We extend the action of the group to the frozen vertices in the quiver such that for every , if and only if , that is two frozen vertices lie in the same -orbit if their mutable copies lie in the same orbit.
Let be a group of automorphisms acting on such that does not admit any loops or 2 cycles, clearly is also a group of automorphisms of . Hence is said to be a group of automorphisms of an extended matrix if it is a group of automorphisms of its principal part .
We define the orbit-mutation on the -matrix
in direction where as follows
(2.1) |
Again since does not admit a loop, the orbit-mutation of the matrix can be defined as
(2.2) |
Where denotes the indices of which are incident to or and denotes the the composition of mutations in directions .
By the definition of orbit-mutation for an extended infinite skew-symmetric matrix given in (1.3) and (2.1), it is easy to check that if is a group of automorphisms of , it will be a group of automorphisms of any extended infinite skew-symmetric matrix obtained from by any finite sequence of orbit-mutations.
Since the extended adjacency matrix of a locally-finite framed quiver is well-defined, we say that the sign-coherence property holds for a locally-finite framed quiver ( is sign-coherent) if after performing any finite sequence of ordinary mutations on where for every , the entries of any vector in the matrix are either all non-negative or all non-positive.
In other words a locally-finite framed quiver is sign-coherent if the arrows connecting any mutable vertex with the frozen vertices in the quiver are either all emerging from this mutable vertex or all reaching at this mutable vertex, where for every and .
Remark 2.1.
The definitions of finite framed quivers and the sign-coherence property for finite framed quivers coincide with the definitions of these concepts for locally-finite quivers.
Remark 2.2.
The quiver mutation for a framed quiver (finite or locally-finite) can be taken only in direction of a mutable vertex and is obtained as for the quiver with one modification which is to remove all arrows that can be created during the mutation process between any two frozen vertices.
The sign-coherence property was proved for finite skew-symmetric matrices (finite quivers) in [5] and for finite skew-symmetrizable matrices in [9]. Here we prove that the sign-coherence property holds for locally-finite framed quivers.
Lemma 2.3.
The sign-coherence property of vectors holds for locally-finite framed quivers.
Proof.
Suppose that is a locally-finite framed quiver, and is a composition of mutations such that for every . We consider the whole quiver as a quiver resulting from the gluing of two full subquivers of as follows
-
•
The first full subquiver of is which is obtained by the vertices and their frozen copies and the mutable vertices in with their frozen copies such that is the set of mutable vertices that are in the neighbourhood of . Clearly is a finite framed quiver.
-
•
The other full subquiver of is which is obtained by the vertices of and their frozen copies where is the set of mutable vertices in which are not contained in . Clearly is a locally-finite framed quiver satisfying the sign-coherence property by construction.
The gluing procedure occurs between and along the set of arrows in connecting and .
Since mutation at some mutable vertex reverses the direction of all arrows incident to the vertex and may affect the arrows between the vertices in the neighbourhood of , the quiver and the set of arrows remain unchanged during the composition of mutations .
Hence and the quiver is the gluing of two quivers along the set of arrows described as above and which connects mutable vertices. These two quivers are :
- •
-
•
The other one is which is sign-coherent by construction.
Thus is sign-coherent.
∎
Let be a matrix with as the matrix and its columns are the vectors. Suppose that this matrix is equipped with a group of automorphisms acting on its principal part such that the ordinary mutation and orbit-mutation are well-defined and can do arbitrary steps of ordinary mutation and orbit-mutation. If all the entries of any vector are either all non-positive or all non-negative after performing any finite sequence of orbit-mutation i.e, any vector in the matrix has entries which are all non-negative or all non-positive where is used to index the matrix for and , then we say that the orbit-sign coherence property holds for this matrix. By convention .( means no orbit-mutation has been applied yet and any vector in has its entries either all non-positive or all non-negative.)
Corollary 2.4.
The orbit-sign coherence property holds for a locally-finite framed quiver equipped with a group of automorphisms and can do arbitrary steps of orbit-mutation.
Proof.
For a locally-finite framed quiver, any finite sequence of orbit mutation can be regarded as a longer but still finite sequence of ordinary mutation (see Equations (1.4) and (2.2)) and by Lemma 2.3 the entries of any vector of the quiver obtained by any finite sequence of ordinary mutation performed on a locally-finite framed quiver are either all non-negative or all non-positive. Hence the result follows. ∎
We denote by the sign of the column indexed by in the matrix and when the entries of the column are non-negative while when the entries of the column are non-positive.
Lemma 2.5.
Let be a locally-finite framed quiver equipped with a group of automorphisms such that does not admit a loop or 2 cycle with as its adjacency matrix, and let be the matrix obtained by orbit-mutation in direction such that . If fall in the same orbit, the columns indexed by in the -matrix have the same sign.
Proof.
Since and fall in the same orbit, there exists an automorphism such that . Clearly is a group of automorphisms of . Thus for any index , thus . ∎
When for every , then and is said to be a green orbit. Respectively, when for every , then and is said to be a red orbit.
Let be the adjacency matrix of a locally-finite framed quiver , in [10] the authors defined the folding matrix of a locally-finite quiver endowed with a group of automorphisms
Analogously we define the folding of the -matrix
Clearly, when we have a finite number of orbits, the folding of the adjacency matrix of a locally-finite framed quiver , is the extended matrix .
Now we construct an unfolding for a given extended sign-skew-symmetric matrix.
Construction 2.6.
Let be an extended acyclic sign-skew-symmetric matrix. A (locally-finite) framed quiver will be constructed inductively.
-
•
For each mutable vertex , we define a quiver as follows: has vertices with one vertex labeled by and other vertices labeled by (). If there is an arrow from each vertex labeled by to the unique vertex labeled by . If there is an arrow from the unique vertex labeled by to each vertex labeled by . No arrows between and if . And finally with one vertex labeled by which is the frozen copy of such that there is one arrow .
-
•
We start by considering as the initial subquiver and we denote . During the constructing process which has as its initial subquiver, the mutable vertices are either old or new while the frozen vertices are not considered old or new. For the vertex is an old vertex and the other mutable vertices are new. For every new vertex , and share a common arrow , we glue and along this common arrow to get a new subquiver . The old vertices of are the mutable vertices of and the other mutable vertices are new.
-
•
We continue inductively as in Construction 1.7 and build from .
-
•
We define .
Remark 2.7.
-
(1)
The matrix associated with the (locally-finite) quiver obtained from Construction 2.6 is the (infinite) and well-defined matrix where the upper part of this matrix is the principal part such that if there are many arrows from the mutable vertex to the mutable vertex whereas if there are many arrows from the mutable vertex to the mutable vertex and if there are no arrows between the mutable vertices and . The lower part of this matrix is the matrix such that if there are many arrows from the mutable vertex to the frozen vertex whereas if there are many arrows from the frozen vertex to the mutable vertex and if there are no arrows between the mutable vertex and the frozen vertex .
-
(2)
Let be the maximum subgroup that preserves labels of the symmetric matrix acting on the set of mutable and frozen vertices of . By Construction 2.6, is a group of automorphisms and the orbits obtained by its action are such that the orbit contains all the mutable vertices labeled by and the orbit contains all the frozen vertices labeled by for every .
-
(3)
Clearly, the folding of the adjacency matrix of the quiver is . The full subquiver of obtained by the mutable vertices is exactly as constructed in Construction 1.7 taking into consideration the way we follow in this paper to associate a quiver with a matrix thus it is an unfolding of by Theorem 1.10 that is can take arbitrary steps of orbit mutations and since orbit-mutation is only taken in direction of an orbit whose elements are labels of mutable vertices, we conclude that is an unfolding of .
Remark 2.8.
Let be the folding of associated with a quiver , to avoid ambiguity, when we mutate of in direction , the mutation will be denoted as since this mutation is an ordinary mutation here and not orbit-mutation.
By convection and .
Lemma 2.9.
Let be an extended, finite and acyclic sign-skew-symmetric matrix and let be the (locally-finite) framed quiver associated with the (infinite) and well-defined skew-symmetric matrix obtained from Construction 2.6 as an unfolding of . We denote by the composition of orbit mutations such that for and we denote by the composition of ordinary mutation . Then is an unfolding of .
Proof.
Since can take arbitrary steps of orbit-mutation, can also take arbitrary steps of orbit-mutation so we need only to prove that is a covering of . We prove it by induction for the mutable part represented by the matrix first, then for the frozen part represented by the -matrix. Trivially, is a covering of . Suppose the result holds for every .
When or , .
When and ,
Since does not have a -2 cycles, when all the entries have the same sign and when , the entries have the same sign, hence
.
And now we will prove that a covering of the matrix is invariant under a composition of orbit mutation. Trivially, is a covering of .
When , .
When ,
By Corollary 2.4, when all the entries have the same sign and hence
.
∎
Example 2.10.





Theorem 2.11.
The sign-coherence property of vectors holds for acyclic sign-skew-symmetric matrices.
Proof.
Let be an extended sign-skew-symmetric matrix and let be the locally-finite framed quiver obtained from Construction 2.6 as an unfolding of with the adjacency matrix . We denote by the matrix obtained from after taking a finite sequence of orbit-mutation. We denote by the matrix obtained from after taking a finite sequence of ordinary mutation such that refers to the order of the row or column indexed by in the folding matrix where for . By convention and . By Lemma 2.9 is an unfolding of for . The orbit-sign coherence property holds for the locally-finite framed quiver by Lemma 2.4, thus the entries of any vector in the matrix are either all non-negative or all non-positive. By the definition of an unfolding, we find that the entries of any vector in are either all non-negative or non-positive for for any and thus the sign-coherence property holds for .
∎
3. Maximal green sequences for an acyclic sign-skew-symmetric matrix
After proving that the sign-coherence property holds for an acyclic sign-skew-symmetric matrix, it makes sense to define maximal green sequences for such matrices.
Definition 3.1.
Let be a totally sign-skew-symmetric matrix for which the sign coherence property holds and let be the matrix obtained from by a composition of mutations , for every ,
-
•
an index in the matrix for is called green (respectively, red) if the entries of the column indexed by in the matrix of are non-negative (respectively, non-positive).
-
•
A sequence of indices , where for all , is called a green sequence if is green in the matrix for . Such sequence is called maximal if does not have any green indices.
Definition 3.2.
A source in a sign-skew-symmetric matrix of the size is an index where and for all . In the associated simple quiver of , the source has all the arrows incident to it emerging from it.
Definition 3.3.
An admissible numbering by sources of an acyclic sign-skew-symmetric matrix of the size is an -tuple such that the indices of are with a source in and the vertex is a source in for any .
Lemma 3.4.
Every acyclic sign-skew-symmetric matrix admits an admissible numbering by source.
Proof.
is a finite acyclic matrix, thus it has a source . When mutating at this source, if or and otherwise. Let denote the matrix obtained from by deleting the -th row and column, hence . Since is acyclic, every submatrix is also acyclic. Then is also acyclic and thus it has a source . Again the submatrix is the same submatrix obtained from by deleting the rows and columns , and it is acyclic with a new source . In every step the submatrix formed by the indices which haven’t been mutated at is the same as the submatrix obtained by the same indices in the original one and the new source in this submatrix is also a source in the whole matrix for since we are preforming mutations at sources so the entries of the other indices remain unchanged and moreover the sign of entry that connects the new source with an old one (which has already been mutated at) is non-positive in the matrix where . By repeating this process times, the index will definitely be a source and we get an admissible numbering by source . ∎
is a locally-finite quiver with a group of automorphisms and a finite number of orbits . If the index is a source in , then for every . Suppose , i.e there is an automorphism such that and suppose that for some , then by the definition of automorphism , contradiction. Thus any index in the orbit is also a source in . In this case we call an orbit-source in . If there is a sequence of orbit-mutations such that the orbit is an orbit-source in and the orbit is an orbit-source in for and the set represents all the orbits under the action of , then the sequence is called orbit-admissible numbering by source in .
Getting back to the pair as an unfolding of the principal part of an acyclic sign-skew-symmetric matrix constructed as in Construction 2.6. By the construction of , we notice that if a vertex labeled by is a source, then all the vertices labeled by are also sources.
Corollary 3.5.
Let be the unfolding of the principal part of an acyclic sign-skew-symmetric matrix built as in Construction 2.6 with a finite set of orbits obtained by the action of , and let be a sequence of orbit-mutation. If a vertex labeled by is a source in , then all the vertices labeled by are also sources in such that for .
Proof.
Clearly is a group of automorphism for . The statement holds true by the definition of automorphisms and since the indices which have the same label lie in the same orbit. ∎
Lemma 3.6.
Let be the unfolding of the principal part of an acyclic sign-skew-symmetric matrix built as in Construction 2.6 with the adjacency matrix , then admits an orbit-admissible numbering by source.
Proof.
By Lemma 3.4, the matrix defines an admissible numbering by source . There are orbits obtained by the action of the group of automorphisms defined in Construction 2.6, each orbit has the vertices with the same label in and since , the set . By Lemma 2.9 the adjacency matrix of the quiver is an unfolding of the matrix for . is a source in , thus by the folding relation we get
for every . Since does not admit any 2 cycles, the entries have the same sign for every and every . Thus each term in the summation above is non-positive and hence is a source in for every and every . Therefore is an orbit-admissible numbering by source. ∎
By Lemma 2.5, we can define orbit-green sequences and orbit-maximal green green sequences for a locally-finite framed quiver with an adjacency matrix equipped with a group of automorphisms such that can do arbitrary steps of orbit-mutations.
Definition 3.7.
Let be a locally-finite framed quiver with an adjacency matrix equipped with a group of automorphisms such that can do arbitrary steps of orbit-mutations, and let be a sequence of orbit-mutations and let be the -matrix of obtained from by the sequence of orbit-mutation for , then is said to be an orbit-green sequence if for every , is a green orbit in . The sequence is said to be orbit-maximal green sequence if doesn’t have any green orbits.
We always suppose that we have finitely many orbits under the action of on the unfolding locally-finite quiver of a sign-skew-symmetric matrix.
Lemma 3.8.
Let with the adjacency matrix be the unfolding of an acyclic sign-skew-symmetric matrix built as in Construction 2.6, then any orbit admissible numbering by source of is an orbit-maximal green sequence.
Proof.
Suppose that is an orbit-admissible numbering by source of . By the definition of orbit-mutation, the mutation at a specific orbit-source reflects the arrows incident to the vertices of that orbit while keeping other arrows the same. Hence at each step we get a new red orbit while the colors of other orbits remain the same. ∎
The following Theorem shows the relation between maximal green sequences for acyclic sign-skew-symmetric matrices and orbit-maximal green sequences for their unfolding matrices.
Theorem 3.9.
Let be the unfolding of an acyclic sign-skew symmetric matrix as constructed in Construction 2.6, then the sequence is an orbit-maximal green sequence for if and only if the corresponding sequence is a maximal green sequence for its folding matrix .
Proof.
By Lemma 2.9 the matrix is an unfolding of the matrix for every . Thus
(3.1) |
The sign-coherence property is satisfied for locally-finite framed quivers by Lemma 2.3. Consequently, the terms that compose the summation on the right hand of equation (3.1) have the same sign. Thus the is green (red) in the matrix if and only if the index is green (red) in the matrix and equivalently by Lemma 2.5 the orbit is green (red) in the matrix , hence the result follows. ∎
Now we can prove that every acyclic sign-skew-symmetric matrix admits a maximal green sequence.
Theorem 3.10.
Every acyclic sign-skew-symmetric matrix admits a maximal green sequence.
References
- [1] A. Assem, M. Blais, T. Brustle A. Samaon, Mutation Classes of Skew-Symmetric Matrices, Communications in Algebra, 36:4 (2008), 1209¨C1220.
- [2] A. Berenstein, S. Fomin, A. Zelevinsky, Cluster algebras III: upper bound and Bruhat cells, Duke Math. J. 126:1 (2005), 1-52.
- [3] T. Brustle, G. Dupton and M. Perotin, On Maximal Green Sequences, Int. Math. Res. Not. 16 (2014), 4547-4586.
- [4] P. Cao and F. Li, Uniformly column sign-coherence and the existence of maximal green sequences, Journal of Algebraic Combinatorics 50 (2019), 403-417.
- [5] H. Derksen, J. Weyman, A. Zelevinsky, Quivers with potentials and their representations II: applications to cluster algebras, J. Amer. Math. Soc. 23 (2010), 749-790.
- [6] G. Dupton, An Approach to Non-Simply-Laced Cluster Algebra, J. Algebra 320:4 (2008), 1626-1661.
- [7] S. Fomin and A. Zelevensky, Cluster Algebras. I.Foundations, J. Amer. Math. Soc. 15:2 (2002), 497-529.
- [8] S. Fomin, M. Shapiro and D. Thruston, Cluster Algrbra and Trangulated Surfaces Part I:Cluster Complex, Acta Math. 201:1 (2008), 83-146.
- [9] M. Gross, P. Hacking, S. Keel, M. Kontsevich, Canonical bases for cluster algebras, J. Amer. Math. Soc. 31 (2018), 497-608.
- [10] M. Huang and F. Li, Unfolding of sign-skew-symmetric cluster algebras and its applications to positivity and F-polynomials, Advances in Mathematics, 340 (2018), 221-283.
- [11] B. Keller, Quiver Mutation and Combinatorial DT-Invariants, corrected version of a contribution to FPSAC 2013, arXiv:1709.03143 [math.CO], 12 pages.
- [12] M. Mills, Maximal green sequences for quivers of finite mutation type, Advances in Mathematics, 319 (2017), 182-210.
- [13] G. Muller, The Existence of Maximal Green Sequence is Not Invariat Under Quiver Mutation, The Electronic Journal of Combinatorics, 23:2 (2016), Paper 2.47, 23pp.
- [14] T. Nakanishi, S. Stella, Diagrammatic Description of c-Vectors and d-Vectors of Cluster Algebra of Finit Type, The Electronic Journal of Combinatorics, 21:1 (2014), Paper 1.3, 107pp.
- [15] A. Seven, Maximal Green Sequences of Skew-Symmetrizable Matrices, Linear Algebra and its Applications, 440 (2014), 125-130.