2000 character limit reached
Logarithmically Regular Morphisms
Published 5 Jul 2019 in math.AG | (1907.02754v2)
Abstract: We consider the stack $\mathcal{L}og_X$ parametrizing log schemes over a log scheme $X$, and weak and strong properties of log morphisms via $\mathcal{L}og_X$, as defined by Olsson. We give a concrete combinatorial presentation of $\mathcal{L}og_X$, and prove a simple criterion of when weak and strong properties of log morphisms coincide. We then apply this result to the study of logarithmic regularity, derive its main properties, and give a chart criterion analogous to Kato's chart criterion of logarithmic smoothness.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.