Complexity of quiver mutation equivalence

DOI10.1007/S00026-023-00668-WMaRDI QIDQ6439306zbMATH OpenFDO

Authors David M. Soukup

Publication date 5 June 2023

Full work available at URL https://doi.org/10.1007/S00026-023-00668-W

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Representations of quivers and partially ordered sets (16G20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Abstract: We prove $extsfNP-hardness$ results for determining whether quivers are mutation equivalent to quivers with given properties. Specifically, determining whether a quiver is mutation-equivalent to a quiver with exactly $k$ arrows between any two of its vertices is $extsfNP-hard$. Also, determining whether a quiver is mutation equivalent to a quiver with no edges between frozen vertices is $extsfstronglyNP-hard$. Finally, we present a characterization of mutation classes of quivers with two mutable vertices.

This page was built for publication: Complexity of quiver mutation equivalence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6439306)