arXiv (All)
open access
Group Action and Spin Representation Lead to a Holant* Complexity Dichotomy on Domain Size 3
We prove a complexity dichotomy theorem for $\mathrm{Holant}^*$ problems over complex-valued symmetric constraint functions $\mathcal{F}$ on domain size $3$. We give a decidable tractability criterion and prove that if $\mathcal{F}$ satisfies the criterion, then $\mathrm{Holant}^*(\mathcal{F})$ is s
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Graph Homomorphisms and Universal Algebra#1109003
- Entrywise Logarithmic Matrix Algebra and Dichotomy of Planar Graph Homomorphisms (Part I)#1155763
- Associativity and Commutativity in Equality Saturation#1156470
- Reachability Problems : 20th International Conference, RP 2026, Turku, Finland, October 21–23, 2026, Proceedings / edited by Vesa Halava, Jarkko Kari#1324018
- Lagrange Multipliers and Neutrosophic Nonlinear Programming Problems Constrained by Equality Constraints#718445
Record · ID 1200401
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive