Change search
ReferencesLink to record
Permanent link

Direct link
Blackbox computation of A-infinityˆž-algebras
KTH, School of Computer Science and Communication (CSC), Computer Vision and Active Perception, CVAP.ORCID iD: 0000-0001-6322-7542
2010 (English)In: Georgian Mathematical Journal, ISSN 1072-947X, E-ISSN 1572-9176, Vol. 17, no 2, 391-404 p.Article in journal (Refereed) Published
Abstract [en]

Kadeishvili's proof of the minimality 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(infinity)-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(infinity)-algebra structure after a finite amount of computational work.

Place, publisher, year, edition, pages
Walter de Gruyter, 2010. Vol. 17, no 2, 391-404 p.
Keyword [en]
A-infinity, strong homotopy associativity, inductive computation
National Category
Computational Mathematics
URN: urn:nbn:se:kth:diva-150358DOI: 10.1515/GMJ.2010.005ISI: 000280455400011OAI: diva2:742595

QC 20140908

Available from: 2014-09-02 Created: 2014-09-02 Last updated: 2014-09-08Bibliographically approved

Open Access in DiVA

fulltext(193 kB)40 downloads
File information
File name FULLTEXT01.pdfFile size 193 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Vejdemo-Johansson, Mikael
By organisation
Computer Vision and Active Perception, CVAP
In the same journal
Georgian Mathematical Journal
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 40 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 23 hits
ReferencesLink to record
Permanent link

Direct link