Proceedings of the American Mathematical Society· 2026Q1
On the decidability of the integrability of finite groups
- 0citations
- Q1SCImago
- 2026year
Short summary
The integrability of any finite group can now be determined algorithmically.
AI-generated from the title and abstract; the full text is not read.
Key points
- The integrability of a finite group is proven to be a decidable problem.
- Integrability is defined by the existence of a group H where G is isomorphic to H's commutator subgroup.
- This result provides a definitive algorithmic approach to assessing group integrability.
AI-generated from the title and abstract; the full text is not read.
Abstract
An integral of a group $G$ is a group $H$ whose commutator subgroup is isomorphic to $G$. In this paper, we prove that the integrability of a finite group is a decidable problem.
The authors' abstract, as published at the source. Proceedings of the American Mathematical Society, 2026 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Mathematical Physics
Mathematical PhysicsMathematics