Papers
Topics
Authors
Recent
AI Research Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 83 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 25 tok/s Pro
GPT-5 High 30 tok/s Pro
GPT-4o 92 tok/s Pro
Kimi K2 174 tok/s Pro
GPT OSS 120B 462 tok/s Pro
Claude Sonnet 4 39 tok/s Pro
2000 character limit reached

Logarithmic TC via the Infinite Root Stack and the Beilinson Fiber Square (2408.15627v1)

Published 28 Aug 2024 in math.AG and math.KT

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

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

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube