2018
DOI: 10.1515/gmj-2018-0057
|View full text |Cite
|
Sign up to set email alerts
|

Algorithms in A -algebras

Abstract: Building on Kadeishvili's original theorem inducing A∞-algebra structures on the homology of dg-algebras, several directions of algorithmic research in A∞-algebras have been pursued. In this paper we will survey work done on calculating explicit A∞-algebra structures from homotopy retractions; in group cohomology; and in persistent homology.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 26 publications
0
1
0
Order By: Relevance
“…They created a new formal language to do so, and counted 266, 682 tie-knots that seem tie-able. Vejdemo-Johansson [6] hosts an online tie knot generation toy which allows the user to randomly pick one these neck ties. In addition, Vejdemo-Johansson believes that their count of neck ties is a lower bound.…”
Section: Introductionmentioning
confidence: 99%
“…They created a new formal language to do so, and counted 266, 682 tie-knots that seem tie-able. Vejdemo-Johansson [6] hosts an online tie knot generation toy which allows the user to randomly pick one these neck ties. In addition, Vejdemo-Johansson believes that their count of neck ties is a lower bound.…”
Section: Introductionmentioning
confidence: 99%