betaFeedback

WorksMathematics

Mutation-acyclicity in rank four is decidable but not semialgebraic

Abstract

We prove that mutation-acyclicity of quivers on four vertices is decidable. If a four-vertex quiver QQ is mutation-acyclic, then some sequence of mutations takes it to an acyclic quiver without any arrow multiplicity exceeding max⁡{ht⁡(Q),m(Q)}\operatorname{max}\{\operatorname{ht}(Q),m(Q)\}, where ht⁡(Q)\operatorname{ht}(Q) is the largest arrow multiplicity of QQ and m(Q)m(Q) is the Markov invariant of Fomin and Neville evaluated on the totally proper wiggle class of QQ. A search within a computable form of this bound decides mutation-acyclicity of four-vertex quivers with O(h24)O(h^{24}) states for input height h≥1h\ge1. Together with a theorem of Caldero and Keller, it also decides mutation equivalence of two four-vertex quivers up to relabeling whenever one of them is mutation-acyclic. We conjecture that ht⁡(Q)\operatorname{ht}(Q) alone suffices as the bound, which would reduce the search to O(h6)O(h^{6}) states, and we verify this for all four-vertex quivers of height at most three. In the other direction, for every n≥4n\ge4 we construct an affine family of connected nn-vertex quivers whose nonnegative even members are mutation-acyclic and whose positive odd members are mutation-cyclic. Consequently, unlike in rank three, no fixed finite Boolean combination of polynomial equations and strict polynomial inequalities in the arrow weights (i.e., a semialgebraic criterion) decides mutation-acyclicity of nn-vertex quivers, even allowing polynomials that are not mutation-invariant. Finally, we correct the criterion for four-vertex quivers of height at most two stated in our earlier paper, and recover its classification counts with short certificates. The calculations in the proof of the height bound are verified by computer for all values of their parameters.

Introduction

Quivers are finite directed multigraphs without loops or directed 2-cycles. Fomin and Zelevinsky introduced quiver mutation in their theory of cluster algebras [35, 36]. A quiver is mutation-acyclic if some sequence of mutations takes it to a quiver without directed cycles, and mutation-cyclic otherwise. Mutation-acyclic quivers are the quivers of acyclic cluster algebras, which have been studied through cluster categories and quiver representations [BMR08, BMRT07, CK06, CK08], through cc-vectors [46, 44], and through reflection groups [9, 30, 31]. This paper concerns the following decision problem.

Problem 1. Given a quiver QQ, decide whether QQ is mutation-acyclic.

Neville records that no algorithm for Problem 1 is known [41 Chapter I], and in our earlier paper we noted that no algorithm or mutation invariant was known to decide mutation-acyclicity in rank four or higher [3]. The problem is closely related to deciding mutation equivalence, for which Fomin, Williams and Zelevinsky ask for an algorithm [34 Problem 2.6.12], and for which no algorithm is known [26 FI21, Remark 2.3], [27 slide 7].

For quivers with at most three vertices, Problem 1 is solved. Quivers with one or two vertices are acyclic. For three vertices, Assem, Blais, Brüstle and Samson gave a descent algorithm [1 Section 2.5], and Beineke, Brüstle and Hille proved that an oriented triangle is mutation-cyclic exactly when its multiplicities are at least two and its Markov constant is at most four [4 Theorem 1.2].

2020 Mathematics Subject Classification. 13F60, 05E10, 05C20, 68V05.

Key words and phrases. quiver mutation, mutation-acyclicity, decidability, Markov invariant, proper cyclic orderings, polynomial invariants, computer-assisted proof.

K.T.K.A.W. was supported by a Royal Society Career Development Fellowship. E.H. was supported by a São Paulo Research Foundation (FAPESP) grant 2024/18994-7. B.J. was supported by ICARM through NSF grant DMS-2425401. K.-H.L. was supported by NSF grant DMS-2617278. Seven extended the description of rank-three mutation classes to skew-symmetrizable matrices [43], Akagi gave the skew-symmetrizable form of the Markov-constant criterion [2], and Felikson and Tumarkin and Casals and Ke studied rank-three quivers with real weights [32, 17]. Quivers of finite mutation type, classified by Felikson, Shapiro and Tumarkin [29] (see also [20] and, for acyclic quivers, [12]), have finite mutation classes, so for them the problem reduces to a finite enumeration.

For quivers with four or more vertices, only partial results are known. Felikson and Tumarkin showed that a quiver mutation-equivalent to an acyclic quiver with at least two arrows between every pair of vertices reaches such a quiver by a descent that never increases an arrow multiplicity [31 Corollary 3.5 and Remark 3.6], and they note that Corollary 3.5 is also proved in Warkentin’s thesis [War14]. Lawson and Mills determined which minimal mutation-infinite quivers are mutation-acyclic [38 Section 4]. In an earlier paper, we classified the four-vertex quivers with at most two arrows between any two vertices [3], in the course of a machine-learning study; see [6 HJC+25, 19] for other applications of machine learning to quiver mutation. The criterion stated in [3 Theorem 2.9] is wrong, and we correct it in Section 6.

There is also a long list of necessary conditions for mutation-acyclicity. Buan, Marsh and Reiten proved that every full subquiver of a mutation-acyclic quiver is mutation-acyclic [BMR08, Corollary 5.3], a consequence of their Theorem 2.13 that was pointed out to them by A. Seven, and Warkentin gave a more explicit proof [48]. Both proofs are representation-theoretic, and an elementary proof is still wanted [FWZ17, Example 4.1.5], [27 slides 11–12]. Every mutation-acyclic quiver admits an admissible quasi-Cartan companion [44 Theorem 1.2], a notion going back to Barot, Geiss and Zelevinsky [8]. Every mutation-acyclic quiver also has a reddening sequence, since acyclic quivers have maximal green sequences [5 Lemma 2.20] and the existence of a reddening sequence is mutation invariant [40 Corollary 19]. Neville proved that every mutation-acyclic quiver is totally proper [42 Theorem 1.1], as conjectured by Fomin and Neville [26 Conjecture 15.9]. Warkentin’s forks give further mutation-invariant tools [War14], developed by Ervin [23]. In rank four there are mutation-cyclic quivers without mutation-cyclic full subquivers on three vertices, such as the dreaded torus [39 Section 7.2], whose cluster algebra comes from a torus with one boundary component and one marked point [28], and Warkentin’s oriented four-cycles with multiplicities a,b,c,d≥2a,b,c,d \ge2 [War14, Example 6.11]. Mutation invariants beyond the determinant are studied in [14, 13, 47, 23, 25, 26], and Ervin and Jackson ask for a description of mutation-acyclicity as an intersection of hereditary mutation-invariant properties [21].

The starting point for our main result is a finiteness theorem of Neville. Fomin and Neville attach to a quiver with a cyclic ordering of its vertices a Markov invariant [26]. For a mutation-acyclic quiver QQ, write m(Q)m(Q) for its value on the totally proper wiggle class of QQ (§ 2), and ht⁡(Q)\operatorname{ht}(Q) for the largest arrow multiplicity of QQ. Neville proved that the arrow multiplicities of every acyclic quiver in the mutation class of QQ are bounded in terms of m(Q)m(Q), so that only finitely many acyclic quivers share a given Markov invariant [42 Proposition 3.21]. Our main result extends this bound from the acyclic quivers of a mutation class to a mutation sequence leading to one of them.

Theorem 1.1. Let QQ be a mutation-acyclic quiver on four vertices. Then some sequence of mutations takes QQ to an acyclic quiver, with every quiver along the sequence of height at most max⁡{ht⁡(Q),m(Q)}\max\{\operatorname{ht}(Q),m(Q)\}. Consequently, mutation-acyclicity of four-vertex quivers is decidable. For input height h≥1h \ge1, the decision procedure searches O(h24)O(h^{24}) quivers.

The height statement is Theorem 5.1, and the decision procedure and the state count are Corollaries 5.2 and 5.3. Since the totally proper class of QQ is not known in advance, the procedure uses the largest Markov value over all proper wiggle classes of QQ in place of m(Q)m(Q), and a four-vertex quiver without proper wiggle classes is a vortex and hence mutation-cyclic. The bound concerns the existence of one suitable mutation sequence, and other routes to an acyclic quiver may climb arbitrarily high. The running time is pseudo-polynomial in the arrow multiplicities, rather than polynomial in their binary encoding length.

The proof chooses a route to an acyclic quiver that minimizes its maximum height, then the number of quivers at that height, then its length, and shows that a stretch of such a route above max⁡{ht⁡(Q),m(Q)}\max\{\operatorname{ht}(Q),m(Q)\} could be replaced by a lower one. The replacements are found by a case analysis on how the first two mutation vertices of such a stretch are joined. Every calculation in this case analysis is verified by a computer program, exactly and for all values of the parameters (Appendices § 7 and § 8). Descent methods face an obstacle in rank four. Fomin and Neville constructed arbitrarily long primitive mutation cycles of four-vertex quivers, and observed that any descent algorithm would have to be confluent over arbitrarily large diamonds [25]; see also [22] and [41 Chapter I]. Soukup observes that if mutation equivalence were undecidable, some equivalent quivers would be joined only by extremely long mutation sequences, going far “into the sky”, and suggests that a bound like that of Coward and Lackenby for Reidemeister moves may exist for quiver mutation [45 Sections 4.1–4.2], [18]. Theorem 1.1 gives such a bound for mutation-acyclicity in rank four, since a bound on height also bounds the length of a shortest route.

We do not know whether the term m(Q)m(Q) is needed. We conjecture that ht⁡(Q)\operatorname{ht}(Q) alone suffices, which would reduce the search to O(h6)O(h^6) quivers, and we verify this for all four-vertex quivers of height at most three (Conjecture 5.5). The height bound also certifies mutation-cyclicity in an example where none of the other obstructions of this paper applies to any quiver within the search range (Example 5.4). Combined with the description of acyclic seeds by Caldero and Keller [CK06, Corollary 4 and its proof], Theorem 1.1 also decides mutation equivalence of two four-vertex quivers up to relabeling whenever at least one of them is mutation-acyclic (Corollary 5.7).

Our second main result shows that no criterion of the kind that works in rank three can exist in higher rank. The rank-three criterion of Beineke, Brüstle and Hille is a finite Boolean combination of polynomial sign conditions on the arrow weights.

Theorem 1.2. Let n≥4n \ge4. No fixed, finite Boolean combination of polynomial equations and strict polynomial inequalities in the (n2)\binom{n}{2} arrow weights, with real coefficients and not necessarily mutation-invariant, decides mutation-acyclicity for all integral quivers on nn vertices. This remains true when the quivers are required to be connected.

For n=4n=4 the proof uses the affine family Q(t)Q(t), t∈Zt \in\mathbb{Z}, of § 3, with arrow weights (−2,t+2,t,−t,2−t,0)(-2,t+2,t,-t,2-t,0) in the coordinates of § 2. The family is mutation-acyclic exactly when t<0t<0 or tt is even, so for large positive tt its mutation-acyclicity changes at every successive integer. In contrast, substituting the six affine arrow weights into any fixed polynomial gives a one-variable polynomial, whose sign is eventually constant unless it vanishes identically. For n>4n>4 we attach a path to Q(t)Q(t).

Chelnokov proved that a mutation invariant of four-vertex quivers that is polynomial on each sign pattern of the arrow weights is a polynomial in the determinant [14 Theorem 1]. The family Q(t)Q(t) has determinant 1616 for every tt, so criteria built from such invariants cannot decide mutation-acyclicity, and Theorem 1.2 complements this by removing the invariance hypothesis. The family is also invisible to the Markov invariant and to properness, since every Q(t)Q(t) with t≥0t \ge0 has a single proper wiggle class, with the same Markov value as the acyclic quiver Q(0)Q(0) (Remark 3.3). Theorem 1.2 does not rule out arithmetic tests, mutation invariants in general, or algorithms whose number of steps depends on the input, and Theorem 1.1 is an algorithm of the last kind.

Finally, § 6 corrects the criterion of [AWHL25, Theorem 2.9] for four-vertex quivers of height at most two and recovers the classification counts with short certificates. All computations in this paper are carried out by a supplementary Python package, and checking them needs only the Python standard library. The program check_proofs.py verifies every calculation delegated from the appendices, check_census.py verifies the certificates of § 6 with an independent implementation of mutation, and examples.py checks the examples. The main results are also formalized in Lean 4 with mathlib, and the Lean sources are available with the supplement at https://github.com/KTKAW/rank4-paper. The formalization proves decidability of mutation-acyclicity in rank four with a coarser computable height bound than that of Theorem 1.1, the case n=4n=4 of Theorem 1.2 for rational coefficients, Theorems 3.2 and 6.2, and Proposition 6.1, the last for every oriented four-cycle with multiplicities a,b,a,b≥2a,b,a,b \ge2.

Quivers and mutation

A quiver of rank nn is a quiver on the vertices 1,…,n1,\ldots,n. Unless we explicitly take a smaller subquiver or say otherwise, our quivers have rank four. Every rank-nn quiver QQ has a skew-symmetric integral exchange matrix BQ=(bij(Q))B_Q=(b_{ij}(Q)), where bij(Q)>0b_{ij}(Q)>0 means that there are bij(Q)b_{ij}(Q) arrows i→ji \to j. For rank four, we encode QQ by the tuple

b(Q)=(b12(Q),b13(Q),b14(Q),b23(Q),b24(Q),b34(Q))=(a,b,c,d,e,f),(1)\mathbf{b}(Q)=(b_{12}(Q),b_{13}(Q),b_{14}(Q),b_{23}(Q),b_{24}(Q),b_{34}(Q))=(a,b,c,d,e,f), \tag*{(1)}

so that

BQ=(0abc−a0de−b−d0f−c−e−f0).B_Q=\begin{pmatrix} 0 & a & b & c \\ -a & 0 & d & e \\ -b & -d & 0 & f \\ -c & -e & -f & 0 \end{pmatrix}.

The coordinates of every six-tuple in this paper are in the fixed order 12,13,14,23,24,3412,13,14,23,24,34, unless a cyclic ordering is explicitly attached as a subscript. When a quiver is fixed in a calculation, we may suppress its argument and write bijb_{ij}. Six-entry parenthesized lists denote coordinate tuples; mutation words and cyclic orderings use different brackets, as specified below. We say a quiver is acyclic if it contains no directed cycles of any length.

The operation of interest is mutation at a vertex kk. To mutate at vertex kk, first add an arrow i→ji \to j for every two-path i→k→ji \to k \to j, counting multiplicities. Next, reverse all arrows touching kk, and cancel pairs of arrows pointing in opposite directions. The resulting quiver is denoted μkQ\mu_k Q. In matrix form [35], abbreviate bij=bij(Q)b_{ij}=b_{ij}(Q) and bij′=bij(μkQ)b'_{ij}=b_{ij}(\mu_k Q). Then

bij′={−bij,i=k or j=k,bij+[bik]+[bkj]+−[−bik]+[−bkj]+,i,j≠k,[x]+=max⁡(x,0).(2)b'_{ij}= \begin{cases} -b_{ij}, & i=k\text{ or }j=k,\\ b_{ij}+[b_{ik}]_+[b_{kj}]_+-[-b_{ik}]_+[-b_{kj}]_+, & i,j\ne k, \end{cases} \qquad[x]_+=\max(x,0). \tag*{(2)}

Mutation is an involution, and preserves the vertex sets of the connected components. A quiver is mutation-acyclic if a finite sequence of mutations takes it to an acyclic quiver; otherwise it is mutation-cyclic. If a quiver is acyclic, a topological ordering is a total order on its vertices such that every directed path of the quiver points from an earlier vertex to a later vertex. In other words, if there is a directed path i→ji \to j in the quiver, then i<ji<j in the topological ordering.

We write a mutation word as a bold letter w=[k1,…,kr]\mathbf{w}=[k_1,\ldots,k_r]. The square brackets list the vertices in the order of mutation, from left to right:

μwQ=μkr(⋯μk2(μk1Q)⋯ ).\mu_{\mathbf{w}}Q=\mu_{k_r}(\cdots\mu_{k_2}(\mu_{k_1}Q)\cdots).

For example, μ[1,2,3]Q=μ3(μ2(μ1Q))\mu_{[1,2,3]}Q=\mu_3(\mu_2(\mu_1Q)). The empty word is [ ][\,], and juxtaposition of words means concatenation in the order performed. A mutation sequence is reduced if consecutive mutation vertices differ; since mutation is an involution, mutations at the same vertex back-to-back cancel each other out.

The height of a quiver QQ is

ht⁡(Q)=max⁡i<j∣bij(Q)∣.\operatorname{ht}(Q)=\max_{i<j}|b_{ij}(Q)|.

A full subquiver of a quiver QQ consists of a subset of vertices and all arrows between them. On the level of the exchange matrix, the full subquiver on a subset of vertices is obtained by taking the full submatrix on the rows and columns corresponding to the subset of vertices.

For a permutation π∈Sn\pi\in S_n, write QπQ^\pi for the relabeling defined by

bij(Qπ)=bπ(i)π(j)(Q).b_{ij}(Q^\pi)=b_{\pi(i)\pi(j)}(Q).

Thus old vertex π(i)\pi(i) receives new label ii. We write permutations in cycle notation, with spaces between successive vertices and no commas. The two relabelings used repeatedly in rank four are

π12=(1 2),π123=(1 2 3),\pi_{12}=(1\ 2), \qquad\pi_{123}=(1\ 2\ 3),

with all unlisted vertices fixed. In particular, π123(1)=2\pi_{123}(1)=2, π123(2)=3\pi_{123}(2)=3, and π123(3)=1\pi_{123}(3)=1. Write QopQ^{\mathrm{op}} for the quiver obtained by reversing all arrows, so that BQop=−BQB_{Q^{\mathrm{op}}}=-B_Q. Relabeling and reversal of all arrows preserve height and acyclicity. Both commute with mutation, in the following sense. For reversal, (2) gives μk(Qop)=(μkQ)op\mu_k(Q^{\mathrm{op}})=(\mu_kQ)^{\mathrm{op}} directly. To transport a mutation through a relabeling, use

μπ−1(k)(Qπ)=(μkQ)π.(3)\mu_{\pi^{-1}(k)}(Q^\pi)=(\mu_kQ)^\pi. \tag*{(3)}

For a word w=[k1,…,kr]\mathbf{w}=[k_1,\ldots,k_r], let π−1w=[π−1(k1),…,π−1(kr)]\pi^{-1}\mathbf{w}=[\pi^{-1}(k_1),\ldots,\pi^{-1}(k_r)]. Then μπ−1w(Qπ)=(μwQ)π\mu_{\pi^{-1}\mathbf{w}}(Q^\pi)=(\mu_{\mathbf{w}}Q)^\pi. Thus replacing an endpoint QQ by QπQ^\pi requires replacing each later mutation vertex kk by π−1(k)\pi^{-1}(k); all later heights and the acyclicity of the final quiver are preserved.

We now state some classical results of [4 Theorem 1.2] and [BMR08, Corollary 5.3], which we will use frequently enough to warrant restating here.

Proposition 2.1 ([4 Theorem 1.2], [BMR08, Corollary 5.3]). A three-vertex quiver is mutation-cyclic if and only if it is an oriented triangle whose arrow multiplicities x,y,zx,y,z satisfy

x,y,z≥2,x2+y2+z2−xyz≤4.x,y,z \ge2,\qquad x^2+y^2+z^2-xyz\le4.

The value x2+y2+z2−xyzx^2+y^2+z^2-xyz is called the Markov constant, and the expression defining it is the Markov polynomial. Also, every full subquiver of a mutation-acyclic quiver is mutation-acyclic. This implies that a quiver is mutation-cyclic if it contains a mutation-cyclic full subquiver.

We call a full subquiver on three vertices a full triangle, even when some of its three pairs of vertices are not joined. Finding a mutation-cyclic full triangle is a practical way to prove mutation-cyclicity for quivers of larger rank.

Cyclic orderings

References

  1. [1][ABBS08] Ibrahim Assem, Martin Blais, Thomas Brüstle, and Audrey Samson, Mutation classes of skew-symmetric 3 × 3-matrices, Comm. Algebra 36 (2008), no. 4, 1209–1220. MR 2406581DOI
  2. [2][Aka24] Ryota Akagi, Cluster-cyclic condition of skew-symmetrizable matrices of rank 3 via the Markov constant, 2024, Preprint, arXiv:2411.07083v2, 29 July 2025.arxiv.org/abs/2411.07083
  3. [3][AWHJL25] Kymani T. K. Armstrong-Williams, Edward Hirst, Blake Jackson, and Kyu-Hwan Lee, Machine learning mutation-acyclicity of quivers, J. Comput. Algebra 15 (2025), Paper No. 100040, 16. MR 4956515
  4. [4][BBH11] Andre Beineke, Thomas Brüstle, and Lutz Hille, Cluster-cyclic quivers with three vertices and the Markov equation, Algebr. Represent. Theory 14 (2011), no. 1, 97–112, With an appendix by Otto Kerner. MR 2763295arxiv.org/abs/math/0612213
  5. [5][BDP14] Thomas Brüstle, Grégoire Dupont, and Matthieu Pérotin, On maximal green sequences, Int. Math. Res. Not. IMRN (2014), no. 16, 4547–4586. MR 3250044arxiv.org/abs/1205.2050
  6. [6][BFH+20] Jiakang Bao, Sebastián Franco, Yang-Hui He, Edward Hirst, Gregg Musiker, and Yan Xiao, Quiver mutations, Seiberg duality, and machine learning, Phys. Rev. D 102 (2020), no. 8, 086013, 28. MR 4178725DOI
  7. [7][BFZ05] Arkady Berenstein, Sergey Fomin, and Andrei Zelevinsky, Cluster algebras. III. Upper bounds and double Bruhat cells, Duke Math. J. 126 (2005), no. 1, 1–52. MR 2110627DOI
  8. [8]Michael Barot, Christof Geiss, and Andrei Zelevinsky, Cluster algebras of finite type and positive symmetrizable matrices, J. London Math. Soc. (2) 73 (2006), no. 3, 545–564. MR 2241966DOI
  9. [9]Michael Barot and Robert J. Marsh, Reflection group presentations arising from cluster algebras, Trans. Amer. Math. Soc. 367 (2015), no. 3, 1945–1967. MR 3286504arxiv.org/abs/1112.2300
  10. [11]Aslak Bakke Buan, Bethany R. Marsh, Idun Reiten, and Gordana Todorov, Clusters and seeds in acyclic cluster algebras, Proc. Amer. Math. Soc. 135 (2007), no. 10, 3049–3060, With an appendix coauthored in addition by P. Caldero and B. Keller. MR 2322734arxiv.org/abs/math/0510359
  11. [12]Aslak Bakke Buan and Idun Reiten, Acyclic quivers of finite mutation type, Int. Math. Res. Not. (2006), Art. ID 12804, 10. MR 2249997DOI
  12. [13]Roger Casals, A binary invariant of matrix mutation, J. Comb. Algebra (2024), Published online 27 August 2024, arXiv:2311.03601.arxiv.org/abs/2311.03601
  13. [14]G. Chelnokov, On the invariants of 4 × 4 skew-symmetric matrix under cluster mutations, 2023, Preprint, arXiv:2311.01784.arxiv.org/abs/2311.01784
  14. [17]Roger Casals and Kenton Ke, Boundedness criteria for real quivers of rank 3, Algebr. Comb. 9 (2026), no. 2, 403–425. MR 5067188arxiv.org/abs/2505.16955
  15. [18]Alexander Coward and Marc Lackenby, An upper bound on Reidemeister moves, Amer. J. Math. 136 (2014), no. 4, 1023–1066. MR 3245186arxiv.org/abs/1104.1882
  16. [19]Pierre-Philippe Dechant, Yang-Hui He, Elli Heyes, and Edward Hirst, Cluster algebras: network science and machine learning, J. Comput. Algebra 8 (2023), Paper No. 100008, 17. MR 4886186DOI
  17. [20]Harm Derksen and Theodore Owen, New graphs of finite mutation type, Electron. J. Combin. 15 (2008), no. 1, Research Paper 139, 15. MR 2465763arxiv.org/abs/0804.0787
  18. [21]Tucker J. Ervin and Blake Jackson, A topology on the poset of quiver mutation classes, Appl. Gen. Topol. 27 (2026), no. 2, Paper No. 24116.DOI
  19. [22]Tucker J. Ervin and Scott Neville, Mutation cycles from reddening sequences, Ann. Comb. (2026), Published online 7 September 2026, arXiv:2504.06573.arxiv.org/abs/2504.06573
  20. [23]Tucker J. Ervin, New hereditary and mutation-invariant properties arising from forks, Electron. J. Combin. 31 (2024), no. 1, Paper No. 1.16, 30. MR 4695532DOI
  21. [25]Sergey Fomin and Scott Neville, Long mutation cycles, Selecta Math. (N.S.) 31 (2025), no. 5, Paper No. 103, 44. MR 4984496arxiv.org/abs/2304.11505
  22. [26]———, Cyclically ordered quivers, Adv. Math. 500 (2026), Paper No. 111059, 81. MR 5083054arxiv.org/abs/2406.03604
  23. [27]Sergey Fomin, Quiver mutations, Slides, Open Problems in Algebraic Combinatorics, Minneapolis, May 16, 2022, https://www.samuelfhopkins.com/OPAC/files/slides/fomin.pdf.
  24. [28]Sergey Fomin, Michael Shapiro, and Dylan Thurston, Cluster algebras and triangulated surfaces. I. Cluster complexes, Acta Math. 201 (2008), no. 1, 83–146. MR 2448067arxiv.org/abs/math/0608367
  25. [29]Anna Felikson, Michael Shapiro, and Pavel Tumarkin, Skew-symmetric cluster algebras of finite mutation type, J. Eur. Math. Soc. (JEMS) 14 (2012), no. 4, 1135–1180. MR 2928847DOI
  26. [30]Anna Felikson and Pavel Tumarkin, Coxeter groups, quiver mutations and geometric manifolds, J. Lond. Math. Soc. (2) 94 (2016), no. 1, 38–60. MR 3532163DOI
  27. [31]———, Acyclic cluster algebras, reflection groups, and curves on a punctured disc, Adv. Math. 340 (2018), 855–882. MR 3886182DOI
  28. [32]———, Geometry of mutation classes of rank 3 quivers, Arnold Math. J. 5 (2019), no. 1, 37–55. MR 3981452DOI
  29. [34]———, Introduction to Cluster Algebras. Chapters 1–3, 2024, Preprint, arXiv:1608.05735v5, 10 December 2024; first posted 2016.
  30. [35]Sergey Fomin and Andrei Zelevinsky, Cluster algebras. I. Foundations, J. Amer. Math. Soc. 15 (2002), no. 2, 497–529. MR 1887642DOI
  31. [36]———, Cluster algebras. II. Finite type classification, Invent. Math. 154 (2003), no. 1, 63–121. MR 2004457
  32. [38]John W. Lawson and Matthew R. Mills, Properties of minimal mutation-infinite quivers, J. Combin. Theory Ser. A 155 (2018), 122–156. MR 3741423arxiv.org/abs/1610.08333
  33. [39]Jacob P. Matherne and Greg Muller, Computing upper cluster algebras, Int. Math. Res. Not. IMRN (2015), no. 11, 3121–3149. MR 3373046
  34. [40]Greg Muller, The existence of a maximal green sequence is not invariant under quiver mutation, Electron. J. Combin. 23 (2016), no. 2, Paper 2.47, 23. MR 3512669arxiv.org/abs/1503.04675
  35. [41]Scott Neville, Combinatorics of quiver mutations, Ph.D. thesis, University of Michigan, 2025, doi:10.7302/27036.DOI
  36. [42]———, Mutation-acyclic quivers are totally proper, 2025, arXiv:2409.17832v2.arxiv.org/abs/2409.17832
  37. [43]Ahmet I. Seven, Mutation classes of skew-symmetrizable 3 × 3 matrices, Proc. Amer. Math. Soc. 141 (2013), no. 5, 1493–1504. MR 3020837
  38. [44]———, Cluster algebras and symmetric matrices, Proc. Amer. Math. Soc. 143 (2015), no. 2, 469–478. MR 3283637arxiv.org/abs/1201.4270
  39. [45]David Soukup, Complexity of ice quiver mutation equivalence, Ann. Comb. 29 (2025), no. 1, 91–100, arXiv:2306.03232, titled “Complexity of quiver mutation equivalence” there. MR 4881672DOI
  40. [46]David Speyer and Hugh Thomas, Acyclic cluster algebras revisited, Algebras, quivers and representations, Abel Symp., vol. 8, Springer, Heidelberg, 2013, pp. 275–298. MR 3183889arxiv.org/abs/1203.0277
  41. [47]Ahmet I. Seven and İbrahim Ünal, Congruence invariants of matrix mutation, J. Pure Appl. Algebra 229 (2025), no. 3, Paper No. 107920, 14. MR 4869145arxiv.org/abs/2403.10626
  42. [48]Matthias Warkentin, Subquivers of mutation-acyclic quivers are mutation-acyclic, 2011, Preprint, arXiv:1102.3382v2.arxiv.org/abs/1102.3382

Paper details

vlnc:W_6da8c32a
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

GPT-Astra, AI systems, AI

View statement
Looking for related papers…
Contents