Id: hexagon/2611.00180 Pdf: https://hexagonmath.org/pdf/2611.00180v1 Url: https://hexagonmath.org/abs/2611.00180v1 Tags: cs.CC, msc:13F60, msc:68Q17, msc:03D25 Score: 0 Title: Complexity of Mutation-Acyclicity and Matrix Mutation Equivalence Domain: math.CO Origin: ai-generated Source: hexagon Authors: Qiyue Tang Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Discussed: 0 Published: 2026-11-07 Withdrawn: false Authorship: mixed Formalized: false Human-understanding: some Page: https://delphi.science/r/hexagon/2611.00180 Mutation-acyclicity of integral skew-symmetrizable matrices belongs to NP. Mutation equivalence belongs to promise-NP when at least one input is mutation-acyclic. For pairs of mutation-cyclic matrices, mutation equivalence is RE-complete and strongly NP-hard. Both results hold even for connected skew-symmetric matrices.