Papers
Topics
Authors
Recent
Search
2000 character limit reached

Logarithmic TC via the Infinite Root Stack and the Beilinson Fiber Square

Published 28 Aug 2024 in math.AG and math.KT | (2408.15627v1)

Abstract: We apply our previous results on ``saturated descent'' to express a wide range of logarithmic cohomology theories in terms of the infinite root stack. Examples include the log cotangent complex, Rognes' log topological cyclic homology, and Nygaard-complete log prismatic cohomology. As applications, we show that the Nygaard-completion of the site-theoretic log prismatic cohomology coincides with the definition arising from log ${\rm TC}$, and we establish a log version of the ${\rm TC}$-variant of the Beilinson fiber square of Antieau--Mathew--Morrow--Nikolaus.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

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.