Blackbox computation of A
∞-algebras
Keyword(s):
Abstract Kadeishvili's proof of theminimality theorem [T. Kadeishvili, On the homology theory of fiber spaces, Russ. Math. Surv. 35:3 (1980), 231–238] induces an algorithm for the inductive computation of an A ∞-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 A ∞-algebra structure after a finite amount of computational work.
2012 ◽
Vol 149
(3)
◽
pp. 430-480
◽
Keyword(s):
2018 ◽
Vol 17
(05)
◽
pp. 1850090
◽
Keyword(s):
Keyword(s):
2021 ◽
Vol 7
(2)
◽