Blackbox Computation of a ∞ -algebras

@inproceedings{VejdemoJohansson2009BlackboxCO,
  title={Blackbox Computation of a ∞ -algebras},
  author={Mikael Vejdemo-Johansson},
  year={2009}
}
Kadeishvili’s proof of the minimality theorem (Kadeishvili, T.; On the homology theory of fiber spaces, Russian Math. Surveys 35 (3) 1980) 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. A-infinity, strong homotopy associativity, inductive computation 17A42… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 14 references

On the homology theory of fiber spaces

T. V. Kadeishvili
1980
View 13 Excerpts
Highly Influenced

Homotopy associativity of H-spaces

James Dillon Stasheff
I, II. Trans. Amer. Math. Soc • 1963
View 10 Excerpts
Highly Influenced

Homological Aspects in Representation Theory

Dag Madsen
PhD thesis, Norges Teknisk-Naturvitenskapelige Universitet, • 2002
View 3 Excerpts
Highly Influenced

A∞algebras for ring theorists

Di-Ming Lu, John H. Palmieri, Quan-Shui Wu, James J. Zhang
Algebra Colloq., • 2004
View 3 Excerpts

A-infinity algebras in representation theory

Bernhard Keller
In Representations of algebra • 2002
View 3 Excerpts

Similar Papers

Loading similar papers…