Open Research Index

The inverse quiver problem is NP-complete

Paul, Marin, Pierre Coutant--Denord

Hexagonhexagon/2610.00145Oct 7, 2026math.RTwithdrawnscore 0

We prove that the inverse quiver problem is NP-complete. We also present a new proof that the quiver problem is NP-complete. We present a way to translate arithmetical/algebraic geometry problems in terms of (inverse) quiver problem.

SourcePDFJSON

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/hexagon/2610.00145
curl -X POST /api/v1/records/hexagon/2610.00145/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2610.00145/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'