Related papers: Complexity of quiver mutation equivalence

We develop a mutation theory for quivers with oriented 2-cycles using a structure called a homotopy, defined as a normal subgroupoid of the quiver's fundamental groupoid. This framework extends Fomin-Zelevinsky mutations of 2-acyclic…

The notion of mixed representations of quivers can be derived from ordinary quiver representations by considering the dual action of groups on "vertex" vector spaces together with the usual action. A generating system for the algebra of…

We prove that the Crisp and Gow's quiver operation on a finite quiver Q produces a new quiver Q' with fewer vertices, such that the finite dimensional algebras kQ/J^2 and kQ'/J^2 are singularly equivalent. This operation is a general quiver…

Given a knot complement X and its p-fold cyclic cover X_p, we identify twisted polynomials associated to 1-dimensional linear representations of the fundamental group of X_p with twisted polynomials associated to related p-dimensional…

For a fixed property (graph class) ${\Pi}$, given a graph G and an integer k, the ${\Pi}$-deletion problem consists in deciding if we can turn $G$ into a graph with the property ${\Pi}$ by deleting at most $k$ edges. The ${\Pi}$-deletion…

We describe presentations of braid groups of type ADE and show how these presentations are compatible with mutation of quivers, building on work of Barot and Marsh for Coxeter groups. In types A and D these presentations can be understood…

This paper investigates the computational complexity of deciding whether the vertices of a graph can be partitioned into a disjoint union of cliques and a triangle-free subgraph. This problem is known to be $\NP$-complete on arbitrary…

Let $C$ be a simply laced generalized Cartan matrix. Given an element $b$ of the generalized braid semigroup related to $C$, we construct a collection of mutation-equivalent quivers with potentials. A quiver with potential in such a…

We prove that the quiver problem is NP complete.

It is shown that, given a representation of a quiver over a finite field, one can check in polynomial time whether it is absolutely indecomposable.

We prove that computing an evolutionary ordering of a family of sets, i.e. an ordering where each set intersects with --but is not included in-- the union earlier sets, is NP-hard.

We study the semistability of quiver representations from an algorithmic perspective. We present efficient algorithms for several fundamental computational problems on the semistability of quiver representations: deciding the semistability…

APR tilts for path algebra $kQ$ can be realized as the mutation of the quiver $Q$ in $\mathbb Z Q$ with respect to the translation. In this paper, we show that we have similar results for the quadratic dual of truncations of $n$-translation…

This paper addresses the combinatorial structure of $m$-colored mutation classes. We provide an explicit and purely combinatorial description of the $m$-colored quivers that arise within the $m$-colored mutation class of a quiver of type…

For a rooted cluster algebra $\mathcal{A}(Q)$ over a valued quiver $Q$, a \emph{symmetric cluster variable} is any cluster variable belonging to a cluster associated with a quiver $\sigma (Q)$, for some permutation $\sigma$. The subalgebra…

We show that two important problems that have applications in computational biology are ASP-complete, which implies that, given a solution to a problem, it is NP-complete to decide if another solution exists. We show first that a variation…

A mutation loop of a valued quiver $Q$, is a combination of quiver automorphisms (permutations of vertices and valuations) and mutations that sends $Q$ to itself. In this article we study what we called \emph{global mutations loops} which…

For a finite dimensional hereditary algebra, we consider: exceptional sequences in the category of finite dimensional modules, silting objects in the bounded derived category, and m-cluster tilting objects in the m-cluster category. There…

We give a short, self-contained, and easily verifiable proof that determining the outerthickness of a general graph is NP-hard. This resolves a long-standing open problem on the computational complexity of outerthickness. Moreover, our…

We present a geometric realization for all mutation classes of quivers of rank $3$ with real weights. This realization is via linear reflection groups for acyclic mutation classes and via groups generated by $\pi$-rotations for the cyclic…