English

Edmonds' problem and the membership problem for orbit semigroups of quiver representations

Representation Theory 2020-09-01 v1 Computational Complexity Data Structures and Algorithms

Abstract

A central problem in algebraic complexity, posed by J. Edmonds, asks to decide if the span of a given ll-tuple \V=(\V1,,\Vl)\V=(\V_1, \ldots, \V_l) of N×NN \times N complex matrices contains a non-singular matrix. In this paper, we provide a quiver invariant theoretic approach to this problem. Viewing \V\V as a representation of the ll-Kronecker quiver \Kl\K_l, Edmonds' problem can be rephrased as asking to decide if there exists a semi-invariant on the representation space (\CCN×N)l(\CC^{N\times N})^l of weight (1,1)(1,-1) that does not vanish at \V\V. In other words, Edmonds' problem is asking to decide if the weight (1,1)(1,-1) belongs to the orbit semigroup of \V\V. Let QQ be an arbitrary acyclic quiver and \V\V a representation of QQ. We study the membership problem for the orbit semi-group of \V\V by focusing on the so-called \V\V-saturated weights. We first show that for any given \V\V-saturated weight σ\sigma, checking if σ\sigma belongs to the orbit semigroup of \V\V can be done in deterministic polynomial time. Next, let (Q,R)(Q, \R) be an acyclic bound quiver with bound quiver algebra A=KQ/RA=KQ/\langle \R \rangle and assume that \V\V satisfies the relations in R\R. We show that if A/\AnnA(\V)A/\Ann_A(\V) is a tame algebra then any weight σ\sigma in the weight semigroup of \V\V is \V\V-saturated. Our results provide a systematic way of producing families of tuples of matrices for which Edmonds' problem can be solved effectively.

Cite

@article{arxiv.2008.13648,
  title  = {Edmonds' problem and the membership problem for orbit semigroups of quiver representations},
  author = {Calin Chindris and Daniel Kline},
  journal= {arXiv preprint arXiv:2008.13648},
  year   = {2020}
}
R2 v1 2026-06-23T18:12:49.426Z