Papers
Topics
Authors
Recent
2000 character limit reached

Koszul-Tate resolutions and decorated trees (2406.03955v1)

Published 6 Jun 2024 in math.AC, math-ph, math.AT, math.MP, and math.QA

Abstract: Given a commutative algebra $\mathcal O$, a proper ideal $\mathcal I$, and a resolution of $\mathcal O/ \mathcal I$ by projective $\mathcal O $-modules, we construct an explicit Koszul-Tate resolution. We call it the arborescent Koszul-Tate resolution since it is indexed by decorated trees. When the $ \mathcal O$-module resolution has finite length, only finitely many operations are needed in our constructions -- this is to be compared with the classical Tate algorithm, which requires infinitely many such computations if $ \mathcal I$ is not a complete intersection. As a by-product of our construction, the initial projective $\mathcal O $-module resolution becomes equipped with an explicit $A_\infty$-algebra.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Paper to Video (Beta)

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.