Blackbox computation of $A_\infty$-algebras

Mathematics – Rings and Algebras

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

11 pages, accepted to the Georgian Journal of Mathematics: Kadeishvili Festschrift issue, tweaked bibliography

Scientific paper

Kadeishvili'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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Blackbox computation of $A_\infty$-algebras does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Blackbox computation of $A_\infty$-algebras, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Blackbox computation of $A_\infty$-algebras will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-676623

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.