Blackbox computation of $A_\infty$-algebras

Simple item page
dc.creatorVejdemo-Johansson, Mikael
dc.date2008-07-24
dc.date2009-05-27
dc.date.accessioned2026-07-07T13:18:02Z
dc.date.available2026-07-07T13:18:02Z
dc.descriptionKadeishvili's proof of the minimality theorem induces an algorithm for the inductive computation of an $A_\infty$-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_\infty$-algebra structure after a finite amount of computational work.
dc.description11 pages, accepted to the Georgian Journal of Mathematics: Kadeishvili Festschrift issue, tweaked bibliography
dc.identifierhttps://arxiv.org/abs/0807.3869
dc.identifierhttp://arxiv.org/abs/0807.3869
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/231304
dc.subjectRings and Algebras
dc.subjectAlgebraic Topology
dc.subject17A42, 17-04
dc.titleBlackbox computation of $A_\infty$-algebras
dc.typetext

Files

Collections

arXiv