Related papers: Complexity of quiver mutation equivalence
We show that computing the interleaving distance between two multi-graded persistence modules is NP-hard. More precisely, we show that deciding whether two modules are $1$-interleaved is NP-complete, already for bigraded, interval…
We consider quivers/skew-symmetric matrices under the action of mutation (in the cluster algebra sense). We classify those which are isomorphic to their own mutation via a cycle permuting all the vertices, and give families of quivers which…
Let $\tilde{Q}$ (resp. $Q$) be an extended exchange (resp. exchange) cluster quiver of finite mutation type. We introduce the distribution set of the number of arrows for $Mut[\tilde{Q}]$ (resp. $Mut[Q]$), give the maximum and minimum…
We introduce a framework of translation quiver varieties which includes Nakajima quiver varieties as well as their graded and cyclic versions. An important feature of translation quiver varieties is that the sets of their fixed points under…
This paper proves that arrangement of music is NP-hard when subject to various constraints: avoiding musical dissonance, limiting how many notes can be played simultaneously, and limiting transition speed between chords. These results imply…
We introduce a new -as far as we know- problem, according to which we are asked to match sequences of two digits in matrices having entries among those two digits (but others too) and prove that this problem is NP-complete
Seiberg duality conjecture asserts that the Gromov-Witten theories (Gauged Linear Sigma Models) of two quiver varieties related by quiver mutations are equal via variable change. In this work, we prove this conjecture for $A_n$ type quiver…
We study silting mutations (Okuyama-Rickard complexes) for selfinjective algebras given by quivers with potential (QPs). We show that silting mutation is compatible with QP mutation. As an application, we get a family of derived…
This note provides a quiver which does not admit a maximal green sequence, but which is mutation-equivalent to a quiver which does admit a maximal green sequence. The proof uses the `scattering diagrams' of Gross-Hacking-Keel-Kontsevich to…
We prove that certain problems naturally arising in knot theory are NP--hard or NP--complete. These are the problems of obtaining one diagram from another one of a link in a bounded number of Reidemeister moves, determining whether a link…
We show that determining the crossing number of a link is NP-hard. For some weaker notions of link equivalence, we also show NP-completeness.
We show that the number of quivers in the mutation class of a quiver of Dynkin type $D_n$ is given by $\sum_{d|n} \phi(n/d)\binom{2d}{d}/(2n)$ for $n \geq 5$. To obtain this formula, we give a correspondence between the quivers in the…
The Surjective Homomorphism problem is to test whether a given graph G called the guest graph allows a vertex-surjective homomorphism to some other given graph H called the host graph. The bijective and injective homomorphism problems can…
We study smoothness of toric quiver varieties. When a quiver $Q$ is defined with the identity dimension vector, the corresponding quiver variety is also a toric variety. So it has both fan representation and quiver representation. We work…
Kearton observed that mutation can change the concordance class of a knot. A close examination of his example reveals that it is of 4-genus 1 and has a mutant of 4-genus 0. The first goal of this paper is to construct examples to show that…
We show NP-completeness for several planar variants of the monotone satisfiability problem with bounded variable appearances. With one exception the presented variants have an associated bipartite graph where the vertex degree is bounded by…
We unify problems about the equivariant geometry of symmetric quiver representation varieties, in the finite type setting, with the corresponding problems for symmetric varieties $GL(n)/K$ where $K$ is an orthogonal or symplectic group. In…
This technical note extends recent results on the computational complexity of globally minimizing the error of piecewise-affine models to the related problem of minimizing the error of switching linear regression models. In particular, we…
In this survey article we give a brief account of constructions and results concerning the quivers with potentials associated to triangulations of surfaces with marked points. Besides the fact that the mutations of these quivers with…
A cyclically ordered quiver is a quiver endowed with an additional structure of a cyclic ordering of its vertices. This structure, which naturally arises in many important applications, gives rise to new powerful mutation invariants.