2000 character limit reached
A proof of a conjecture by Monin and Rana on equations defining $\bar{M}_{0,n}$
Published 14 Sep 2022 in math.AG | (2209.06688v1)
Abstract: Monin and Rana conjectured a set of equations defining the image of the moduli space $\bar{M}_{0,n}$ under an embedding into $\mathbb{P}1\times \cdots\times \mathbb{P}{n-3}$ due to Keel and Tevelev and verified the conjecture for $n\leq 8$ using Macaulay2. We prove this conjecture for all $n$.
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.