Polynomial bounds on the gap for type A, Â and tree quivers make nullcone membership polynomial-time solvable, while other quivers have exponentially small gaps and weight margins.
Ranks of linear matrix pencils separate simultaneous similarity orbits
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the gap of quiver representations
Polynomial bounds on the gap for type A, Â and tree quivers make nullcone membership polynomial-time solvable, while other quivers have exponentially small gaps and weight margins.