Decorated trees for Koszul-Tate resolutions and ghosts
Speaker: Thomas Strobl Abstract: Koszul-Tate resolutions are the key ingredient in the Batalin-Vilkovisky (BV) and the Batalin-Fradkin-Vilkovisky (BFV) formalisms. Such resolutions have been known explicitly only in a very limited number of cases. And while the Tate algorithm shows existence, it almost always leads to an infinite amount of computations to be performed. We provide …
Decorated trees for Koszul-Tate resolutions and ghosts Read More »