alphaFeedback

WorksMathematics

Decidability of Mutation-Acyclicity

AI contributions
Not recorded for this paper
View details

Abstract

Mutation-acyclicity is decidable for all finite integral skew-symmetrizable exchange matrices. Mutation equivalence up to relabeling is decidable when at least one of the two inputs is mutation-acyclic.

Introduction

An exchange matrix is an integral n×nn \times n matrix B=(bij)B=(b_{ij}), with n≥0n \ge0, that admits a symmetrizer: a diagonal matrix D=diag⁡(d1,…,dn)D=\operatorname{diag}(d_1,\ldots,d_n) with positive integer entries such that dibij=−djbjid_i b_{ij}=-d_j b_{ji} for all i,ji,j. Such a matrix is called skew-symmetrizable. Its directed graph has an arrow i→ji \to j when bij>0b_{ij}>0. If BB itself is skew-symmetric, we take bijb_{ij} parallel arrows in this direction and obtain a quiver. We call BB acyclic if its directed graph has no directed cycle.

For an integer xx, put [x]+=max⁡(x,0)[x]_+=\max(x,0). For 1≤k≤n1 \le k \le n, mutation μk\mu_k at index kk sends BB to the matrix with entries

(μkB)ij={−bij,i=k or j=k,bij+[bik]+[bkj]+−[−bik]+[−bkj]+,i,j≠k.(\mu_k 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}

Applying μk\mu_k twice negates the incident entries twice and subtracts the correction made to each other entry. To check that DD remains a symmetrizer, use di[bik]+=dk[−bki]+d_i[b_{ik}]_+=d_k[-b_{ki}]_+ and dk[bkj]+=dj[−bjk]+d_k[b_{kj}]_+=d_j[-b_{jk}]_+ and the identities with all signs reversed. They show that the corrections to opposite entries are negatives after multiplication by their row weights [16].

A matrix is mutation-acyclic if a finite sequence of mutations, possibly empty, takes it to an acyclic matrix. Otherwise it is mutation-cyclic. Two matrices are mutation equivalent up to relabeling if a sequence of mutations and a simultaneous permutation of rows and columns takes one to the other. Relabeling commutes with mutation after relabeling its index, so a single permutation at the end suffices.

Fomin and Zelevinsky introduced matrix mutation in their definition of cluster algebras [16]. A coefficient-free seed of size nn consists of an exchange matrix BB and an ordered transcendence basis (x1,…,xn)(x_1,\ldots,x_n) of a rational function field in nn indeterminates over Q\mathbb{Q}. The basis is called its cluster. Mutation at kk updates the matrix and replaces xkx_k by

∏i=1nxi[bik]++∏i=1nxi[−bik]+xk.\frac{\prod_{i=1}^{n}x_i^{[b_{ik}]_+}+\prod_{i=1}^{n}x_i^{[-b_{ik}]_+}}{x_k}.

with empty products equal to one. The variables in all the resulting clusters generate the cluster algebra. The finite-type classification gives acyclic seeds of Dynkin type for the algebras with finitely many cluster variables [5]. Beyond finite type, an acyclic quiver has a hereditary path algebra, and its cluster category realizes mutations as exchanges of indecomposable summands [13, 12, 14]. The recognition problem asks whether an acyclic seed exists when the given seed has directed cycles.

Assem, Blais, Brü stle, and Samson [2] decided the first nontrivial case, that of skew-symmetric matrices on three vertices, by reducing arrow multiplicities under mutation. For a directed triangle with multiplicities x,y,zx,y,z, Beineke, Brüstle, and Hille [3 Theorem 1.2] showed that the triangle is mutation-cyclic precisely when x,y,z≥2x,y,z \ge2 and x2+y2+z2−xyz≤4x^2+y^2+z^2-xyz \le4. Akagi [1 Theorem 1.2] gave the corresponding Markov-constant criterion for skew-symmetrizable matrices on three vertices. In arbitrary size, Buan, Marsh, and Reiten [12 Corollary 5.3] showed that full subquivers inherit mutation-acyclicity. A full subquiver retains all arrows between the selected vertices, so finding a mutation-cyclic full subquiver gives an obstruction. Neville [6] extended the use of the Markov invariant to mutation-acyclic quivers of arbitrary size.

Soukup explicitly posed algorithmic recognition for arbitrary quivers [7 Section 2.4.5]. For four vertices, Armstrong-Williams, Hirst, Jackson, and Lee [8 Theorem 1.1 and Corollaries 5.2–5.3] proved that a mutation-acyclic quiver of maximum arrow multiplicity hh has a path to an acyclic quiver along which the multiplicities stay at most h4+4h3+6h2h^4+4h^3+6h^2. This bounds a finite search.

The two-input problem asks whether given matrices lie in the same mutation class. Fomin, Williams, and Zelevinsky posed the unrestricted problem for quivers and for skew-symmetrizable matrices [4 Problems 2.6.14 and 2.8.2]. For two acyclic quivers, the description of acyclic seeds by Caldero and Keller [14 Corollary 4] reduces comparison to mutations at sources and sinks. Liu and Pan [21 Theorem 3] give the matrix version used here. Under a one-sided promise, recognition of the other input lets this comparison apply. Armstrong-Williams, Hirst, Jackson, and Lee combined recognition and source–sink comparison for four vertices [8 Corollary 5.7].

Theorem 1.1. Mutation-acyclicity is decidable for integral skew-symmetrizable matrices of arbitrary finite size.

Theorem 1.2. There is an algorithm that halts on every pair of integral skew-symmetrizable matrices. It reports when both are mutation-cyclic and otherwise decides whether they are mutation equivalent up to relabeling.

For skew-symmetric inputs, a dimension bound gives a finite list of algebras whose relation-extension quivers can realize the input. A spectral test and finite-dimensional module witnesses then give a search that terminates on mutation-cyclic inputs. A finite folding reduction handles general skew-symmetrizable matrices.

Mutations act separately on the connected components of the underlying undirected graph. Every mutation term across two components vanishes, and involutivity prevents a connected component from splitting. Thus mutation-acyclicity is equivalent to mutation-acyclicity of every component. The empty matrix is acyclic.

Recognizing mutation-acyclic quivers

Proposition 2.1. There is an algorithm that decides whether a finite integral skew-symmetric exchange matrix is mutation-acyclic.

It suffices to treat connected quivers. Enumerating finite mutation sequences already gives a procedure that halts with a positive answer on every mutation-acyclic input. We construct a second procedure that halts with a negative answer on every other input.

Throughout this section K=QK=\mathbb{Q}, the computable algebraic closure of the rational numbers. Algebras are finite-dimensional associative unital KK-algebras, and modules are finite-dimensional right modules unless specified otherwise. For an algebra RR, write rad⁡R\operatorname{rad} R for its Jacobson radical, the ideal annihilating every simple right module, and DR=Hom⁡K(R,K)DR=\operatorname{Hom}_K(R,K) for the linear dual of its regular bimodule, with (afb)(x)=f(bxa)(afb)(x)=f(bxa) for a,b,x∈Ra,b,x\in R and f∈DRf\in DR. The trace tr⁡\operatorname{tr} below is the sum of the diagonal entries of an endomorphism in any basis. An algebra is basic if its semisimple quotient is a product of copies of KK. For modules M,NM,N, the space Ext⁡Rq(M,N)\operatorname{Ext}^{q}_{R}(M,N) is the degree-qq right derived functor of Hom⁡R(M,N)\operatorname{Hom}_{R}(M,N), computed from a projective resolution of MM. For a basic algebra with simple right modules S1,…,SnS_1,\ldots,S_n, we take the ordinary quiver to have dim⁡KExt⁡R1(Si,Sj)\dim_K\operatorname{Ext}^{1}_{R}(S_i,S_j) arrows from ii to jj. The relation extension of RR is the algebra on R⊕Ext⁡R2(DR,R)R \oplus\operatorname{Ext}^{2}_{R}(DR,R) with multiplication, for r,s∈Rr,s \in R and ξ,η∈Ext⁡R2(DR,R)\xi,\eta\in\operatorname{Ext}^{2}_{R}(DR,R),

(r,ξ)(s,η)=(rs,rη+ξs).(r,\xi)(s,\eta)=(rs,r\eta+\xi s).

The left action on Ext⁡R2(DR,R)\operatorname{Ext}^{2}_{R}(DR,R) is induced by left multiplication on RR, and the right action is induced contravariantly by the left action on DRDR.

A finite list of candidates

Let QQ be a connected input quiver on n≥1n \ge1 vertices and let hh be its maximum arrow multiplicity, with h=0h=0 when it has no arrows. If QQ is mutation-acyclic, the exchange theorem for cluster categories realizes QQ as the ordinary quiver of a cluster-tilted algebra of a connected hereditary path algebra [12, 13]. The relation extension theorem of Assem, Brüstle and Schiffler [9 Theorem 3.4] then gives a basic tilted algebra RR whose relation extension has quiver QQ. Here a tilted algebra is the endomorphism algebra of a tilting module over a finite-dimensional hereditary algebra. Its ordinary quiver is acyclic, and is a subquiver of the relation-extension quiver [9 Theorem 2.6]. The algebra RR is connected. Indeed, a nontrivial product has relation extension the product of the relation extensions of its factors, since extensions between modules supported on distinct factors vanish. The tilted algebra furnished by the theorem has global dimension at most two. It is a quotient of the path algebra of its ordinary quiver. In a topological ordering, a path of length ℓ\ell uses ℓ+1\ell+1 increasing vertices and has at most hℓh^\ell choices of arrows for any given vertex sequence. Consequently

dim⁡KR≤∑ℓ=0n−1(nℓ+1)hℓ(1)\dim_K R \le\sum_{\ell=0}^{n-1} \binom{n}{\ell+1}h^\ell \tag*{(1)}

where the term for ℓ=0\ell=0 counts the nn stationary paths. Write HHq(R)HH^q(R) for the degree-qq Hochschild cohomology with coefficients in the regular bimodule. A path algebra has a projective bimodule resolution of length one. For clarity, let PP be such an algebra, VV the subalgebra spanned by the stationary paths, and WW the VV-bimodule spanned by the arrows. The resolution is

0⟶P⊗VW⊗VP⟶P⊗VP⟶P⟶0.0 \longrightarrow P \otimes_V W \otimes_V P \longrightarrow P \otimes_V P \longrightarrow P \longrightarrow0.

The right map multiplies the factors; the preceding map sends p⊗w⊗qp \otimes w \otimes q to pw⊗q−p⊗wqpw \otimes q-p \otimes wq, for p,q∈Pp,q \in P and w∈Ww \in W. For each path, the tensors in the middle term represent its cuts at vertices. The tensors to the left represent cuts at arrows, and their images are differences of consecutive vertex cuts. These differences are independent and span the kernel of multiplication on that path. Both tensor terms are projective bimodules, since the stationary idempotents decompose them into sums of tensor products of principal left and right projectives. Thus HH2(P)=0HH^2(P)=0. The tilted algebra RR is derived equivalent to a hereditary path algebra, and Hochschild cohomology is preserved under this equivalence [19].

Lemma 2.2. For each positive integer dd, one can compute a complete list, up to KK-algebra isomorphism, of dd-dimensional algebras RR with HH2(R)=0HH^2(R)=0.

Proof. Fix the first vector e1e_1 of the standard basis of KdK^d as the unit. The associative laws with that unit form an affine algebraic set, defined by the equations for the structure constants of a bilinear multiplication. The group of invertible linear maps fixing e1e_1 acts by change of basis, and its orbits are the isomorphism classes.

For each law RR, the normalized Hochschild cochains in degree qq are the KK-multilinear maps Rq→RR^q \to R vanishing when an argument is the unit. Denote the cochain space by CqC^q and its differential by δq:Cq→Cq+1\delta^q:C^q \to C^{q+1}. For a linear map uu with u(1)=0u(1)=0 and a normalized bilinear map vv, the first two differentials are

(δ1u)(a,b)=au(b)−u(ab)+u(a)b,(\delta^1u)(a,b)=au(b)-u(ab)+u(a)b,
(δ2v)(a,b,c)=av(b,c)−v(ab,c)+v(a,bc)−v(a,b)c(a,b,c∈R).(\delta^2v)(a,b,c)=av(b,c)-v(ab,c)+v(a,bc)-v(a,b)c \qquad(a,b,c \in R).

Indeed, a perturbation of the product by ϵv\epsilon v over K[ϵ]/(ϵ2)K[\epsilon]/(\epsilon^2), preserves the unit exactly when vv is normalized. Expanding the two associations of abcabc and equating the coefficients of ϵ\epsilon gives the normalized cocycles ker⁡δ2\ker\delta^2. Transporting the product by the basis change 1+ϵu1+\epsilon u gives the coboundaries im⁡δ1\operatorname{im}\delta^1, since the inverse change is 1−ϵu1-\epsilon u and substitution gives δ1u\delta^1u up to sign. In characteristic zero the stabilizer is smooth and the orbit map has differential of rank equal to the orbit dimension. If HH2(R)=0HH^2(R)=0, the orbit dimension thus equals the dimension of the linearized space. The local dimension of the algebraic set lies between the orbit dimension and the dimension of the Zariski tangent space, which is bounded above by the dimension of the linearized space. Hence the point is smooth and belongs to a unique irreducible component. The orbit is locally closed and has full dimension in that component, so it contains a neighborhood of the point. Translating this neighborhood by changes of basis shows that the orbit is open. Two different open orbits cannot meet the same irreducible component. There are only finitely many components, so there are finitely many isomorphism classes satisfying HH2(R)=0HH^2(R)=0.

The condition HH2(R)=0HH^2(R)=0 is the polynomial rank test

rank⁡δ1+rank⁡δ2=dim⁡KC2.\operatorname{rank}\delta^1+\operatorname{rank}\delta^2=\dim_K C^2.

Each possible rank is expressed using minors. Isomorphism to a specified algebra is a polynomial condition with existentially quantified entries of an invertible matrix fixing e1e_1. We use quantifier elimination for algebraically closed fields in its effective form. To eliminate an existential quantifier, write the quantifier-free formula as a disjunction of conjunctions of polynomial equations and inequations. In each conjunction take the product of the inequation polynomials, with empty product one. In the quantified variable, branch on the vanishing of leading coefficients and compute the greatest common divisor of the nonzero equation polynomials by the Euclidean algorithm. If all equations vanish identically, the conjunction has a solution exactly when the product of the inequation polynomials is nonzero as a polynomial. Otherwise take the square-free part of the greatest common divisor by dividing it by its greatest common divisor with its derivative. There is a solution exactly when this square-free part fails to divide the product of inequation polynomials. In particular a constant greatest common divisor gives no solution. Branching makes these conditions polynomial conditions in the remaining variables. Negation handles universal quantifiers. Given a list of pairwise nonisomorphic representatives, effective quantifier elimination for algebraically closed fields decides whether there is a law satisfying the rank test and isomorphic to none of those representatives. If the answer is yes, enumerate tuples of algebraic numbers, testing that same condition on each tuple, until a new representative is found. If the answer is no, return the list. Finiteness of the isomorphism classes makes this process halt.

Apply Lemma 2.2 to every dimension in the range (1). Retain the basic connected algebras of global dimension at most two with nn simple modules, acyclic ordinary quiver, and relation-extension quiver isomorphic to QQ.

For a finite-dimensional algebra RR, let LxL_x be left multiplication by x∈Rx\in R on its underlying vector space. The Jacobson radical is the kernel of the bilinear form (x,y)↦tr⁡Lxy(x,y)\mapsto\operatorname{tr}L_{xy}. Indeed, the radical pairs to zero because xyxy is nilpotent when xx is in the radical. The form on the semisimple quotient is a sum of matrix trace pairings, weighted by the multiplicities of the simple left modules in a composition series of the left regular module. Each multiplicity is positive since the regular module surjects onto the semisimple quotient. The weighted trace pairings are nondegenerate in characteristic zero. This gives the radical by linear algebra. The algebra is basic exactly when its semisimple quotient is commutative. In that case the quotient is a product of as many copies of KK as its dimension. The corresponding one-dimensional simple modules are obtained by solving the unital character equations, one solution for each factor. Enumerate algebraic-number tuples satisfying these equations until the number of distinct solutions equals the dimension of the quotient.

For right modules MM, NN, the ordinary bar resolution of MM in degree q≥0q \ge0 is M⊗KR⊗Kq⊗KRM \otimes_K R^{\otimes_K q} \otimes_K R, with the free right action on the last factor. The augmentation sends m⊗r1m \otimes r_1 to mr1mr_1 for m∈Mm \in M and r1∈Rr_1 \in R. In degree q≥1q \ge1 its differential sends m⊗r1⊗⋯⊗rq+1m \otimes r_1 \otimes\cdots\otimes r_{q+1}, with m∈Mm \in M and ri∈Rr_i \in R, to

mr1⊗r2⊗⋯⊗rq+1+∑i=1q(−1)im⊗r1⊗⋯⊗(riri+1)⊗⋯⊗rq+1.mr_1 \otimes r_2 \otimes\cdots\otimes r_{q+1} + \sum_{i=1}^{q}(-1)^i m \otimes r_1 \otimes\cdots\otimes(r_i r_{i+1}) \otimes\cdots\otimes r_{q+1}.

As a complex of vector spaces it contracts by appending the unit, with sign (−1)q+1(-1)^{q+1} in degree qq and sign +1+1 from MM to degree zero. Substitution cancels all terms except the identity, proving exactness. Each term is free as a right module. Applying Hom⁡R(−,N)\operatorname{Hom}_R(-,N) gives a cochain complex whose cohomology in any fixed degree is computed from just the incoming and outgoing differentials in that degree. These are finite matrices with entries polynomial in the algebra and module structure constants. This computes the ordinary quiver using M=SiM = S_i, N=SjN = S_j, and q=1q = 1. Connectivity and acyclicity are graph tests. With S=R/rad⁡RS = R/\operatorname{rad} R considered as a right module, the global dimension is at most two exactly when Ext⁡R3(S,S)=0\operatorname{Ext}^3_R(S,S) = 0. In a minimal projective resolution, applying Hom⁡R(−,S)\operatorname{Hom}_R(-,S) makes the differentials zero, and each nonzero projective term has nonzero top. Thus the vanishing test forces the third projective term of every simple to vanish. The bound on the projective dimensions of the simples extends to all modules by composition series. For the relation extension, compute Ext⁡R2(DR,R)\operatorname{Ext}^2_R(DR,R) as a kernel modulo an image in the bar cochain complex. On these cochains the left action applies left multiplication to the output, and the right action precomposes with left multiplication on the DRDR input. These operations commute with the differential and give the two actions on the quotient. Use them to form the multiplication table of the relation extension. Compute its quiver by the same radical and Ext⁡1\operatorname{Ext}^1 calculations and compare to QQ over all vertex bijections.

A test on Euler forms

For each remaining algebra RR, define its Euler matrix ERE_R by

(ER)ij=∑q=02(−1)qdim⁡KExt⁡Rq(Si,Sj).(E_R)_{ij} = \sum_{q=0}^{2}(-1)^q \dim_K \operatorname{Ext}^q_R(S_i,S_j).

It represents the Euler pairing on the Grothendieck group of finite-dimensional modules in the simple basis. Its pairing between the classes of the indecomposable projectives and the simple classes is the identity matrix, so ERE_R is invertible. Write ρ(−ER−1ERT)\rho(-E_R^{-1}E_R^{\mathsf T}) for the maximum modulus of the complex eigenvalues of the indicated Coxeter matrix. Retain RR only if

ρ(−ER−1ERT)>1orER+ERT is positive semidefinite of corank at most one.(2)\rho(-E_R^{-1}E_R^{\mathsf T}) > 1 \quad\text{or} \quad E_R + E_R^{\mathsf T}\text{ is positive semidefinite of corank at most one.} \tag*{(2)}

The roots of the Coxeter characteristic polynomial are algebraic numbers. For each root λ\lambda, compare λ‾\overline{\lambda} with one by exact real algebraic arithmetic. Rational congruence diagonalization gives the signs and number of zero entries of the symmetrized form. Derived equivalence induces an integral change of basis preserving the Euler pairing. Under ER↦TTERTE_R \mapsto T^{\mathsf T}E_R T for an invertible integral change-of-basis matrix TT, the symmetrized form changes by congruence and the Coxeter matrix changes by conjugation by TT.

For a connected acyclic path algebra, order the vertices so that each arrow goes from an earlier vertex to a later one. Let NN be the strictly upper triangular matrix of arrow multiplicities. The Euler matrix is I−NI-N, where II is the identity matrix, since the path algebra is hereditary and the first extensions of simples count arrows. If 2I−N−NT2I-N-N^{\mathsf T} is positive semidefinite, its corank is at most one. For more than one vertex, N+NTN+N^{\mathsf T} is irreducible and nonnegative by connectedness. If 22 is an eigenvalue, it is the largest eigenvalue and is simple by Perron–Frobenius. The one-vertex form is positive definite.

Otherwise N+NTN + N^{\mathsf{T}} has an eigenvalue greater than 2. For real t≥1t \ge1, the spectral radius of the nonnegative matrix

tN+NTt+1\frac{tN + N^{\mathsf{T}}}{t + 1}

is continuous in tt. At t=1t = 1 it exceeds one, and as tt tends to infinity it tends to zero, the spectral radius of the nilpotent matrix NN. At some t>1t > 1 the radius is one. By Perron–Frobenius, one is then an eigenvalue. Hence t(I−N)+(I−NT)t(I - N) + (I - N^{\mathsf{T}}) is singular, so tt is an eigenvalue of −(I−N)−1(I−NT)-(I - N)^{-1}(I - N^{\mathsf{T}}). Derived invariance now gives (2) for every algebra derived equivalent to a connected acyclic path algebra.

A quasitilted algebra is the endomorphism algebra of a tilting object in a hereditary Ext-finite abelian KK-category. Happel’s classification [17 Theorem 3.1] implies that a connected quasitilted algebra over an algebraically closed field is derived equivalent to a connected hereditary path algebra or to a canonical algebra. A canonical algebra has an integer number t≥2t \ge2 of directed arms from a common source to a common sink. Arm ii has pi≥2p_i \ge2 edges, and the t−2t - 2 minimal relations are linear combinations of the full arm paths. Write EE for its Euler matrix. Its diagonal entries are one, arrows contribute −1-1 in their source–target positions, and the relations contribute t−2t - 2 in the common source–sink position. In a minimal projective resolution of a simple, the outgoing arrows index the projectives in degree one, and the minimal relations starting at its vertex index those in degree two [9 Lemma 2.2].

For the Coxeter polynomial, let zz be an indeterminate and consider zE+ETzE + E^{\mathsf{T}}. The block of internal vertices of each arm is tridiagonal with diagonal z+1z + 1, upper diagonal −z-z, and lower diagonal −1-1. The determinant DrD_r of an rr-vertex block satisfies Dr=(z+1)Dr−1−zDr−2D_r = (z + 1)D_{r-1} - zD_{r-2} for r≥2r \ge2, by expansion at an end, with D0=1D_0 = 1 and D1=z+1D_1 = z + 1. Induction gives Dr=1+z+⋯+zrD_r = 1 + z + \cdots+ z^r. Put fi=Dpi−1f_i = D_{p_i-1}. In the inverse of the internal block of arm ii, the two end diagonal entries are Dpi−2/fiD_{p_i-2}/f_i, and the first-to-last and last-to-first entries are zpi−2/fiz^{p_i-2}/f_i and 1/fi1/f_i. The diagonal cofactors are the smaller tridiagonal determinants, and the off-diagonal cofactors are products of the respective adjacent entries with the cofactor sign. These formulas also apply when the internal block has size one.

Eliminate the internal blocks over the field of rational functions in zz. Each arm subtracts (fi−1)/fi(f_i - 1)/f_i from both endpoint diagonal entries and subtracts zpi/fiz^{p_i}/f_i and 1/fi1/f_i from the upper and lower off-diagonal entries, respectively. This uses zDpi−2=fi−1zD_{p_i-2} = f_i - 1 and the two end entries of the inverse just computed. The original off-diagonal entries are z(t−2)z(t - 2) and t−2t - 2. Using zpi=(z−1)fi+1z^{p_i} = (z - 1)f_i + 1, the resulting endpoint block is

(d−d+1−z−d+z−1d),d=z+1−t+∑i=1t1fi.\begin{pmatrix} d & -d + 1 - z \\ -d + z - 1 & d \end{pmatrix}, \qquad d = z + 1 - t + \sum_{i=1}^{t}\frac{1}{f_i}.

Its determinant is (z−1)2(z - 1)^2. Since EE is unit upper triangular in a topological ordering, the Coxeter polynomial is

det⁡(zE+ET)=(z−1)2∏i=1t(1+z+⋯+zpi−1).\det(zE + E^{\mathsf{T}}) = (z - 1)^2 \prod_{i=1}^{t}(1 + z + \cdots+ z^{p_i-1}).

In particular its spectral radius is one [20 Proposition 2.4]. Let x=(xu)ux = (x_u)_u be a real vector indexed by the vertices of the canonical quiver, with entries aa and bb at its source and sink. The Euler quadratic form xTExx^{\mathsf{T}}Ex is

12∑arm edges u→v(xu−xv)2−t−22(a−b)2.\frac{1}{2}\sum_{\text{arm edges }u\to v}(x_u - x_v)^2 - \frac{t - 2}{2}(a - b)^2.

Indeed, each internal vertex occurs in two edge squares, and each endpoint occurs in tt edge squares. Expanding the formula gives a unit square at each vertex, the negative arrow terms, and the term (t−2)ab(t - 2)ab from the t−2t - 2 canonical relations between the endpoints. On arm ii, subtract a+j(b−a)/pia + j(b - a)/p_i at distance jj from the source, for 0≤j≤pi0 \le j \le p_i. The squared differences then split into a positive definite form on the internal deviations with zero endpoint values and the contribution (a−b)2/pi(a-b)^2/p_i. The mixed term vanishes because differences of deviations sum to zero along the arm. Hence the coefficient on (a−b)2(a-b)^2 in the full form is

12(2−t+∑i=1t1pi).\frac{1}{2}\left(2-t+\sum_{i=1}^{t}\frac{1}{p_i}\right).

If this coefficient is zero, the form has corank two. If it is negative, the form is indefinite. Neither case satisfies (2). The canonical algebras with positive coefficient are the domestic ones, which are derived equivalent to affine hereditary path algebras [20 proof of Proposition 2.8]. It follows that every connected quasitilted algebra satisfying (2) is derived equivalent to a hereditary path algebra.

Finite-dimensional module witnesses

Happel, Reiten and Smalø characterize quasitilted algebras among the algebras of global dimension at most two [18 Theorem II.2.3]. In this range, RR is quasitilted if and only if every indecomposable module has projective dimension at most one or injective dimension at most one. Failure is therefore witnessed by an indecomposable module MM such that

Ext⁡R2(M,S)≠0andExt⁡R2(S,M)≠0.(3)\operatorname{Ext}^{2}_{R}(M,S) \ne0 \qquad\text{and} \qquad\operatorname{Ext}^{2}_{R}(S,M) \ne0. \tag*{(3)}

The first condition in (3) detects a nonzero second term in a minimal projective resolution, since every simple occurs in SS. In a minimal injective resolution, each differential vanishes on the socle, the sum of the simple submodules of its source. Applying Hom⁡R(S,−)\operatorname{Hom}_{R}(S,-) therefore makes the differentials zero. Every nonzero finite-dimensional injective has a simple submodule, so the second condition detects a nonzero term in degree two.

For a fixed dimension m≥1m \ge1, an RR-action on KmK^m is specified by m×mm \times m matrices for a basis of RR, subject to its multiplication and unit equations. The common centralizer consists of module endomorphisms. A nontrivial idempotent gives a decomposition into its image and kernel, and a direct-sum decomposition gives such an idempotent by projection. Thus indecomposability is expressed by the absence of these idempotents. Both conditions are first-order over KK. The nonvanishing tests (3) are also first-order. In degree two of each bar cochain complex, the ranks of the incoming and outgoing maps sum to less than the dimension of the middle space exactly when the cohomology is nonzero. Quantifier elimination thus decides whether a witness of dimension mm exists. Testing m=1,2,…m=1,2,\ldots gives a procedure that halts exactly when RR is not quasitilted.

Proof of Proposition 2.1. Use the finite candidate list after all the preceding tests. For each candidate run the module witness search, advancing the searches in parallel. If each candidate has a witness, return a negative answer. This includes the case of an empty list.

When QQ is mutation-acyclic, a tilted algebra from the relation extension theorem belongs to the candidate list. It passes (2) by its hereditary derived type. It is quasitilted, so the negative procedure never returns an answer in this case.

Conversely, suppose a candidate is quasitilted. The spectral test forces it to be derived equivalent to a hereditary path algebra, hence to be iterated tilted. By Barot, Fernández, Platzek, Pratti and Trepode [11 Theorem 1.1], an iterated tilted algebra of global dimension at most two has the same relation-extension quiver as the ordinary quiver of a cluster-tilted algebra. The cluster-tilting graph of the hereditary cluster category is connected [13 Proposition 3.5], and exchange of a cluster-tilting summand mutates the ordinary quiver [12 Theorem 1.3]. Therefore QQ is mutation-acyclic. If QQ is not mutation-acyclic, every candidate has a module witness and the negative procedure eventually returns an answer. Alternate steps of the two searches until one returns an answer. The positive search halts on mutation-acyclic inputs, and the negative search halts on the remaining inputs.

Reduction to skew-symmetric matrices

Let C=(cuv)C=(c_{uv}) be a skew-symmetric integer matrix and let gg be a permutation of its vertices preserving CC. We call the action admissible if there are no arrows within a vertex orbit and all nonzero entries of each block between two orbits have the same sign. Write E1,…,EnE_1,\ldots,E_n for the orbits. The fold is the matrix with entries

bij=∑u∈Eicuv(v∈Ej).b_{ij}=\sum_{u\in E_i}c_{uv}\qquad(v\in E_j).

The sum is independent of vv by invariance, and ∣Ej∣bij=−∣Ei∣bji|E_j|b_{ij}=-|E_i|b_{ji} by summing over the whole block and using skew-symmetry. Thus the fold is symmetrized by a diagonal matrix with entries proportional to 1/∣Ei∣1/|E_i|, scaled to positive integers. An orbit mutation mutates once at each vertex of one orbit. These mutations commute because there are no arrows within the orbit. We use Demonet’s theorem, as stated in [15 Theorem 2.23], that an admissible action on an acyclic quiver remains admissible after every orbit mutation sequence. For the fold-mutation identity [15 Theorem 2.24], fix an orbit EkE_k to mutate and v∈Ejv\in E_j with j≠kj\ne k. For i≠ki\ne k, sum the two product terms of the mutation formula over u∈Eiu\in E_i and w∈Ekw\in E_k. The factors at ww are unchanged by mutations at other vertices of EkE_k, since there are no arrows inside EkE_k. The common signs in the blocks give

∑w∈Ek∑u∈Ei[cuw]+[cwv]+=[bik]+[bkj]+.\sum_{w\in E_k}\sum_{u\in E_i}[c_{uw}]_+[c_{wv}]_+=[b_{ik}]_+[b_{kj}]_+.

The same computation with all entries negated gives [−bik]+[−bkj]+[-b_{ik}]_+[-b_{kj}]_+. Entries incident with the mutated orbit change sign. Thus the folded update is exactly matrix mutation.

Every action by a finite group of quiver automorphisms on an acyclic quiver is admissible, and its fold is acyclic. Indeed, a directed path between vertices of the same orbit can be concatenated with its successive translates under an element taking the first endpoint to the second. This would give a directed closed walk, hence a directed cycle. An arrow inside an orbit or arrows in opposite directions between two orbits would give such a path, translating one arrow to meet the other if necessary. The same translation argument lifts a directed cycle in the fold to a path between vertices of the same orbit.

Lemma 3.1. Suppose CC is connected and mutation-acyclic, and the action of gg on CC is admissible. If gcd⁡(∣E1∣,…,∣En∣)=1\gcd(|E_1|,\ldots,|E_n|)=1, then the fold of CC is mutation-acyclic.

Proof. Choose an acyclic representative QQ of CC. A seed with exchange quiver CC is a seed of the coefficient-free cluster algebra of QQ. Permuting its cluster variables by gg induces a direct cluster automorphism ff, that is, one preserving exchange quivers under the induced variable bijections. This follows by equivariance of the exchange relations under simultaneous permutation of the variables and the quiver. The order mm of ff is the order of gg, since the variables of this seed form a transcendence basis.

An invariant acyclic seed. Over an algebraically closed field, the cluster category of a hereditary path algebra is the orbit of its bounded derived category by F=τ−1[1]F=\tau^{-1}[1], with τ\tau the Auslander–Reiten translation and [1][1] the derived shift. We use the correspondence between clusters and basic cluster-tilting objects, which identifies a mutation with exchange of one indecomposable summand [10 Section 3.1] [14, 12]. A basic object has pairwise nonisomorphic indecomposable summands. The direct automorphism ff lifts to a derived equivalence and acts on the transjective Auslander–Reiten component, the component containing the initial shifted projectives [10 Lemma 3.1 and Corollary 3.2].

Consider the repetition quiver of the hereditary section formed by the initial shifted projectives. Index its vertices by (p,i)(p,i), with p∈Zp\in\mathbb{Z} and ii an initial vertex, so that τ(p,i)=(p−1,i)\tau(p,i)=(p-1,i). For each arrow i→ji\to j of this section, the repetition quiver has arrows

(p,i)⟶(p,j),(p,j)⟶(p+1,i)(p∈Z).(p,i)\longrightarrow(p,j),\qquad(p,j)\longrightarrow(p+1,i)\qquad(p\in\mathbb{Z}).

In particular, the orientation used here is that of the Auslander–Reiten section. An integer vector (hi)i(h_i)_i defines a section {(hi,i)}i\{(h_i,i)\}_i whenever

0≤hi−hj≤1for every arrow i→j of the initial section.0 \le h_i-h_j \le1 \qquad\text{for every arrow } i \to j \text{ of the initial section.}

Each initial arrow contributes one arrow to the section, and along every arrow the quantity p−hip-h_i at (p,i)(p,i) increases by 0 or 1. Thus paths between section vertices stay in the section. Such a section projects to an acyclic seed. To see this using source and sink exchanges, first subtract the minimum height from all heights, which is a common translate by a power of τ\tau. If the resulting vector is nonzero, choose a sink in the initial section restricted to the vertices of maximal height. In the current section, an incident edge to a lower vertex is oriented into the chosen vertex: by (∗)(*) it had the opposite orientation in the initial section. Edges at equal heights keep their initial orientation. Thus the chosen vertex is a sink in the current section. Lowering its height by one preserves (∗)(*) and reverses its incident edges. Iteration reaches the zero vector. Read the moves in reverse. Each move raises a source by one, which replaces its object by its τ−1\tau^{-1}-translate in the source exchange of a hereditary slice [10 Section 3.2]. Starting from the zero section, this proves that the sections project to acyclic seeds. A common τ\tau-translate also preserves cluster-tilting objects and their quivers.

The inequalities (∗)(*) are preserved by pointwise minimum: write them as hj≤hih_j \le h_i and hi≤hj+1h_i \le h_j+1, and take the minimum on both sides of each inequality. An automorphism of the repetition quiver commuting with τ\tau takes (p,i)(p,i) to (p+ci,σ(i))(p+c_i,\sigma(i)) for integers cic_i and a permutation σ\sigma. The image of a section is again a section: it has one vertex from each translation orbit and an arrow over every adjacency of the initial quiver. By the repetition-quiver formula, such an arrow requires the two chosen heights to satisfy (∗)(*) on that adjacency. The coordinate permutation and additions commute with pointwise minimum. For a finite-order translation-quiver automorphism, the pointwise minimum of the finitely many images of the zero section is an invariant section.

If QQ is not Dynkin, the transjective component in the cluster category is the repetition quiver itself [10 Section 3.2]. The induced action of ff has finite order, so the invariant section just constructed gives an ff-invariant acyclic seed. If QQ is Dynkin, its derived Auslander–Reiten quiver is the repetition quiver, and the projection onto the cluster Auslander–Reiten quiver is a connected regular covering with deck group generated by FF [13 Propositions 1.3 and 1.6]. The rank-one case is immediate. In higher rank let aa be the action of the derived lift on the repetition quiver. The derived lift commutes with the shift and the Auslander–Reiten translation, hence with FF. In Dynkin type every indecomposable object of the cluster category corresponds to a cluster variable. Thus fmf^m fixes every vertex of the quotient, and ama^m acts over the identity there. Its image at a chosen vertex equals that of FkF^k for some integer kk. Unique lifting of walks from that vertex and connectedness of the covering give am=Fka^m=F^k on all vertices. For each original orbit EiE_i, choose a lift viv_i of a summand corresponding to a variable in EiE_i. Since f∣Ei∣f^{|E_i|} fixes that variable, a∣Ei∣vi=Fkivia^{|E_i|}v_i=F^{k_i}v_i for some ki∈Zk_i\in\mathbb{Z}. Commutativity with FF and freeness of the deck action give

k∣Ei∣=mki.k|E_i|=mk_i.

An integer linear combination of the numbers ∣Ei∣|E_i| equals one. Multiplying that combination by kk and using the displayed identities gives m∣km\mid k. Hence F−k/maF^{-k/m}a is a finite-order lift of the same action, and its invariant section projects to an ff-invariant acyclic seed in this case as well.

An orbit mutation path. Write SS for the invariant acyclic seed and QSQ_S for its quiver. The permutation by ff on SS preserves QSQ_S. Extend it to an automorphism of the path algebra by numbering the parallel arrows in each ordered pair and sending each arrow to the arrow of the same number in the image pair. The resulting cluster action agrees with ff on the transcendence basis of SS, and therefore agrees on every cluster variable.

Work over F‾q\overline{\mathbb{F}}_q, the algebraic closure of a finite field Fq\mathbb{F}_q. The cluster labels and quivers in this category are obtained by the same seed mutation words, so the permutation of the cluster variables is independent of the field of the path algebra. Compose the path algebra automorphism with the scalar Frobenius λ↦λq\lambda\mapsto\lambda^q and write HH for the fixed algebra. Frobenius descent makes HH a finite-dimensional hereditary Fq\mathbb{F}_q-algebra whose scalar extension is the path algebra F‾qQS\overline{\mathbb{F}}_q Q_S [22 Section 3.1]. It is indecomposable because QSQ_S is connected. The corresponding action on cluster-tilting objects agrees on indecomposable summands with the action on variables by ff. Indeed, scalar Frobenius fixes the shifted projectives and hence every reachable indecomposable summand by equivariance of exchange and uniqueness of the other complement. Denote by MM the basic cluster-tilting object corresponding to the original seed with quiver CC. Its summands are permuted by the Frobenius action.

Frobenius descent in cluster categories gives the correspondence [22 Theorem 3.2 and Proposition 3.5]. The sum of a Frobenius orbit of indecomposable objects descends to one indecomposable object, and the Hom and extension spaces downstairs are the Frobenius-fixed spaces of their counterparts upstairs, with scalar extension recovering the latter spaces. In particular, a Frobenius-stable basic cluster-tilting object UU descends to a basic cluster-tilting object in the category of HH, denoted UdescU^{\mathrm{desc}}. Rigidity descends by the extension formula. For maximality, if an object downstairs has vanishing first extensions from UdescU^{\mathrm{desc}}, its scalar extension lies in the additive closure of UU, and the orbit correspondence puts the original object in the additive closure of UdescU^{\mathrm{desc}}. The additive closure here consists of direct summands of finite direct sums of copies.

By [13 Proposition 3.5], the cluster-tilting graph of HH is connected. Choose a path from the shifted regular object H[1]H[1] to MdescM^{\mathrm{desc}}. Lift it inductively, starting at the object for SS. At a stage with lifted object UU, the summand exchanged downstairs comes from a Frobenius orbit of summands of UU. The already lifted path consists of orbit mutations from QSQ_S, so Demonet’s theorem ensures admissibility at this stage. The mutations at the vertices of the orbit commute and produce a basic cluster-tilting object U′U'. By equivariance under Frobenius, the new summands constitute one orbit. They are distinct by basicness. They also differ from every removed summand: the mutation producing any given replacement can be performed first, when all the other old summands are still present. Consequently U′descU'^{\mathrm{desc}} has the same unchanged summands as UdescU^{\mathrm{desc}} and one different summand. By the two-complement theorem [13 Theorem 5.1], it is the next object of the chosen path. At its end the lifted object is isomorphic to MM, since scalar extension recovers the split object. We have obtained an orbit mutation path from QSQ_S to CC, with the prescribed action at its endpoint. Folding gives a mutation path from the acyclic fold of QSQ_S to the fold of CC, with the orbit labels transported along the path. Matching the specified labels at the endpoint relabels the full path and preserves its acyclic endpoint. □\square

Proposition 3.2. Mutation-acyclicity of a skew-symmetrizable integer matrix reduces to a computable finite disjunction of skew-symmetric mutation-acyclicity queries.

Proof. Treat a connected matrix B=(bij)B=(b_{ij}) of size nn. Compute a positive integral diagonal symmetrizer D=diag⁡(d1,…,dn)D=\operatorname{diag}(d_1,\ldots,d_n), so that DBDB is skew-symmetric. Set the diagonal weight of one vertex to one and propagate dj/di=−bij/bjid_j/d_i=-b_{ij}/b_{ji} along a spanning tree of the undirected support. The input admits a symmetrizer, so the propagated rational weights agree with a common rescaling of that symmetrizer and satisfy all edges. Clear denominators. Put

L=lcm⁡(d1,…,dn),ei=L/di,Ei=Z/eiZ.L=\operatorname{lcm}(d_1,\ldots,d_n), \qquad e_i=L/d_i, \qquad E_i=\mathbb{Z}/e_i\mathbb{Z.}

Here, the sets EiE_i are taken disjointly. We have gcd⁡(e1,…,en)=1\gcd(e_1,\ldots,e_n)=1, since each prime dividing LL attains its maximum exponent in some did_i. Let gg act by simultaneous successor on all the EiE_i.

Enumerate all skew-symmetric matrices on ⨆iEi\bigsqcup_i E_i invariant under gg, admissible for its action, and folding to BB. In the (i,j)(i,j) block every entry has absolute value at most ∣bij∣|b_{ij}|, by the common sign condition and the prescribed column sums. This gives a finite effective enumeration. Each such matrix is connected. Indeed, for a component XX write fi=∣X∩Ei∣f_i = |X \cap E_i|. A nonzero block has nonzero constant weighted degree at both ends, so XX meets every EiE_i by connectedness of BB. Counting the arrows of a nonzero block in XX from its two ends gives fjbij=−fibjif_jb_{ij}=-f_ib_{ji}, whereas ejbij=−eibjie_jb_{ij}=-e_ib_{ji}. Hence the ratios fi/eif_i/e_i all coincide. Their common reduced denominator divides every eie_i, so the ratio is a positive integer at most one. Thus XX is the entire vertex set. Lemma 3.1 now gives mutation-acyclicity of BB whenever one of the enumerated matrices is mutation-acyclic.

Conversely, suppose BB has an acyclic representative A=(aij)A=(a_{ij}) reached by a mutation sequence. The same diagonal DD symmetrizes every matrix along the sequence. Construct an acyclic lift of AA on the prescribed EiE_i as follows. For each pair with aij>0a_{ij}>0, simultaneous successor on Ei×EjE_i \times E_j has orbit length lcm⁡(ei,ej)\operatorname{lcm}(e_i,e_j). During one period, a given column occurs ei/gcd⁡(ei,ej)e_i/\gcd(e_i,e_j) times and a given row occurs ej/gcd⁡(ei,ej)e_j/\gcd(e_i,e_j) times. The equation ejaij=−eiajie_ja_{ij}=-e_ia_{ji} implies that ei/gcd⁡(ei,ej)e_i/\gcd(e_i,e_j) divides aija_{ij}. Give every pair in one such orbit weight aijgcd⁡(ei,ej)/eia_{ij}\gcd(e_i,e_j)/e_i in the (i,j)(i,j) block, put zero on the other pairs, and take the negative transpose in the opposite block. Use zero blocks when aij=aji=0a_{ij}=a_{ji}=0 and within each EiE_i. The resulting matrix folds to AA, and every arrow projects to an arrow of the acyclic support of AA, so the lift is acyclic. Lift the reverse mutation sequence A→BA \to B by orbit mutations. By stable admissibility and the fold-mutation formula, the endpoint is among the enumerated matrices and is mutation-acyclic. For a disconnected input, enumerate all block sums obtained by taking one lift per component. Such a block sum is mutation-acyclic exactly when each of its summands is. The empty block sum handles the empty input. □

Proof of Theorem 1.1. Construct the finite family in Proposition 3.2 and test its members by Proposition 2.1. Return yes exactly when one member is mutation-acyclic. □

Mutation equivalence with a mutation-acyclic input

Lemma 4.1. For two acyclic exchange matrices, mutation equivalence up to relabeling is decidable.

Proof. For a matrix A=(aij)A=(a_{ij}), a source is a vertex with no incoming arrow in the directed support i→ji \to j for aij>0a_{ij}>0, and a sink is a vertex with no outgoing arrow. A mutation at a source or a sink reverses the arrows incident to that vertex and preserves every absolute entry. Indeed, the two-step terms in the matrix mutation formula vanish at such a vertex. A source becomes a sink and a sink becomes a source, so no directed cycle is created.

By the acyclic source-sink theorem of Liu and Pan [21 Theorem 3], if two acyclic sign-skew-symmetric matrices are mutation equivalent up to relabeling, they can be joined by source and sink mutations up to relabeling. Here sign-skew-symmetric means that for every pair of distinct indices the two opposite entries are both zero or have opposite signs, as they do for every skew-symmetrizable exchange matrix. In the skew-symmetric case the theorem is due to Caldero and Keller [14 Corollary 4]. The converse holds because source and sink mutations are mutations.

Matrices of different sizes are inequivalent. For equal sizes, search all matrices reachable from the first by source and sink mutations. If mm is the number of unordered pairs carrying nonzero entries in the first matrix, there are at most 2m2^m states, because the absolute entries are fixed and each such pair has two possible orientations. Compare every visited matrix with every simultaneous row and column relabeling of the second matrix. The search finds a match exactly when the matrices are mutation equivalent up to relabeling. □

Proof of Theorem 1.2. Apply Theorem 1.1 to both matrices. If neither is mutation-acyclic, report that both are mutation-cyclic. If exactly one is mutation-acyclic, return inequivalence, since the existence of an acyclic representative is invariant under mutation and relabeling. Suppose both are mutation-acyclic. For each matrix, enumerate all mutation words in order of length, including the empty word, and stop when the directed support of the resulting matrix is acyclic. Both searches terminate because both inputs are mutation-acyclic. By reversibility of mutation and equivariance under relabeling, the input matrices are mutation equivalent up to relabeling exactly when the two acyclic representatives are. Apply Lemma 4.1 to them. □

Zhilì College, Tsinghua University, Beijing 100084, China

Email address: [email protected]

References

  1. [1]R. Akagi, Cluster-cyclic condition of skew-symmetrizable matrices of rank 3 via the Markov constant, arXiv:2411.07083v2.arxiv.org/abs/2411.07083
  2. [2]I. Assem, M. Blais, T. Brüstle, and A. Samson, Mutation classes of skew-symmetric 3 × 3-matrices, arXiv:math/0610627, 2006.DOI
  3. [3]A. Beineke, T. Brüstle, and L. Hille, Cluster-cyclic quivers with three vertices and the Markov equation, Algebra. Represent. Theory 14 (2011), 97–112.arxiv.org/abs/math/0612213
  4. [4]S. Fomin, L. Williams, and A. Zelevinsky, Introduction to cluster algebras. Chapters 1–3, arXiv:1608.05735; problem numbers refer to the combined draft.
  5. [5]S. Fomin and A. Zelevinsky, Cluster algebras II: Finite type classification, Invent. Math. 154 (2003), 63–121.
  6. [6]S. Neville, Mutation-acyclic quivers are totally proper, arXiv:2409.17832v2, 2025.arxiv.org/abs/2409.17832
  7. [7]D. Soukup, Computational complexity in combinatorics and algebra, Ph.D. thesis, University of California, Los Angeles, 2024.
  8. [8]K. T. K. Armstrong-Williams, E. Hirst, B. Jackson, and K.-H. Lee, Mutation-acyclicity in rank four is decidable but not semialgebraic, arXiv:2610.36179v1, 2026.
  9. [9]I. Assem, T. Brüstle, and R. Schiffler, Cluster-tilted algebras as trivial extensions, Bull. Lond. Math. Soc. 40 (2008), 151–162.DOI
  10. [10]I. Assem, R. Schiffler, and V. Shramchenko, Cluster automorphisms, Proc. Lond. Math. Soc. (3) 104 (2012), 1271–1302.
  11. [11]M. Barot, E. Fernández, M. I. Platzeck, N. I. Pratti, and S. Trepode, From iterated tilted algebras to cluster-tilted algebras, Adv. Math. 223 (2010), 1468–1494.arxiv.org/abs/0811.1328
  12. [12]A. B. Buan, R. J. Marsh, and I. Reiten, Cluster mutation via quiver representations, Comment. Math. Helv. 83 (2008), 143–177.arxiv.org/abs/math/0412077
  13. [13]A. B. Buan, R. J. Marsh, M. Reineke, I. Reiten, and G. Todorov, Tilting theory and cluster combinatorics, Adv. Math. 204 (2006), 572–618.arxiv.org/abs/math/0402054
  14. [14]P. Caldero and B. Keller, From triangulated categories to cluster algebras II, Ann. Sci. Éc. Norm. Sup. (4) 39 (2006), 983–1009.DOI
  15. [15]G. Dupont, An approach to non-simply laced cluster algebras, J. Algebra 320 (2008), 1626–1661.arxiv.org/abs/math/0512043
  16. [16]S. Fomin and A. Zelevinsky, Cluster algebras I: Foundations, J. Amer. Math. Soc. 15 (2002), 497–529.DOI
  17. [17]D. Happel, A characterization of hereditary categories with tilting object, Invent. Math. 144 (2001), 381–398.DOI
  18. [18]D. Happel, I. Reiten, and S. O. Smalø, Tilting in abelian categories and quas tilted algebras, Mem. Amer. Math. Soc. 120 (1996), no. 575.
  19. [19]B. Keller, Derived invariance of higher structures on the Hochschild complex, preprint, 2003.
  20. [20]H. Lenzing and J. A. de la Peña, Spectral analysis of finite dimensional algebras and singularities, arXiv:0805.1018, 2008.arxiv.org/abs/0805.1018
  21. [21]S. Liu and J. Pan, A note on mutation equivalence, Mathematics 13 (2025), no. 3, 339.DOI
  22. [22]D. Yang, Non-simply-laced clusters of finite type via Frobenius morphism, arXiv:math/0608114, 2006.DOI

Paper details

vlnc:W_zyqphp4p
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 0

downloads · 0

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

CC BY 4.0

Original source

  • Mathematics

Not recorded for this paper · View statement →

Looking for related papers…
Contents