Blackbox computation of A_-algebras.
From MaRDI portal
Abstract: Kadeishvili's proof of the minimality theorem induces an algorithm for the inductive computation of an -algebra structure on the homology of a dg-algebra. In this paper, we prove that for one class of dg-algebras, the resulting computation will generate a complete -algebra structure after a finite amount of computational work.
Recommendations
Cited in
(8)- Algorithms in A_-algebras
- Effective computation of degree bounded minimal models of GCDAs
- On the Merkulov construction of \(A_\infty\)-(co)algebras
- Open questions related to A_-structures in a computational framework
- On the Computation of A ∞ -Maps
- A case study of \(A_{\infty}\)-structure
- A computational approach of \(A_{\infty }\)-(co)algebras
- An \(\mathrm A_\infty\)-structure on the cohomology ring of the symmetric group \(\mathrm S_p\) with coefficients in \(\mathbb F_p\)
This page was built for publication: Blackbox computation of \(A_\infty\)-algebras.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3576351)