Blackbox computation of A_∞-algebras

2008/07/24 by Mikael Vejdemo‐Johansson, Vejdemo-Johansson, Mikael
Mathematics · #17-04 #17A42 #Advanced Operator Algebra Research #Algebraic Topology (math.AT) #Algebraic structures and combinatorial models #FOS: Mathematics #Homotopy and Cohomology in Algebraic Topology #Rings and Algebras (math.RA)

paper · pdf · doi:10.48550/arxiv.0807.3869

openalex publication_date 2008/07/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Kadeishvili's proof of the minimality theorem 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.

Related

• Formality of A_∞-Algebras
• Trivial extension DG-algebras, unitally positive A_∞-algebras, and applications
• The Biderivative and A_∞-bialgebras
• Formality of DG algebras (after Kaledin)
• A^N_∞-algebras