Mostrar el registro sencillo del ítem
Capítulo de Libro
On the Computation of Ainfinity-Maps
dc.creator | Berciano Alcaraz, Ainhoa | |
dc.creator | Jiménez Rodríguez, María José | |
dc.creator | Real Jurado, Pedro | |
dc.date.accessioned | 2015-11-11T12:26:49Z | |
dc.date.available | 2015-11-11T12:26:49Z | |
dc.date.issued | 2007 | |
dc.identifier.uri | http://hdl.handle.net/11441/30608 | |
dc.description.abstract | Starting from a chain contraction (a special chain homotopy equivalence) connecting a differential graded algebra A with a differential graded module M, the so-called homological perturbation technique “tensor trick” [8] provides a family of maps, {mi}i≥1, describing an A∞- algebra structure on M derived from the one of algebra on A. In this paper, taking advantage of some annihilation properties of the component morphisms of the chain contraction, we obtain a simplified version of the existing formulas of the mentioned A∞-maps, reducing the computational cost of computing mn from O(n!2) to O(n!). | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.relation.ispartof | Computer algebra in scientific computing (CASC 2007), Lecture Notes in Computer Science, Vol. 4770, p. 45-57 | es |
dc.rights | Atribución-NoComercial-CompartirIgual 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | * |
dc.subject | A∞-algebra | es |
dc.subject | contraction | es |
dc.subject | Basic Perturbation Lemma | es |
dc.subject | transference | es |
dc.subject | computation | es |
dc.title | On the Computation of Ainfinity-Maps | es |
dc.type | info:eu-repo/semantics/bookPart | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Matemática Aplicada | es |
dc.identifier.idus | https://idus.us.es/xmlui/handle/11441/30608 |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
On the computation.pdf | 436.6Kb | [PDF] | Ver/ | |