Papers
Topics
Authors
Recent
Search
2000 character limit reached

Tautological families of cyclic covers of projective spaces

Published 11 Nov 2021 in math.AG | (2111.06043v2)

Abstract: In this article, we study the existence of tautological families on a Zariski open set of the coarse moduli space parametrizing certain Galois covers over projective spaces. More specifically, let ($1$) $\mathscr{H}{n.r.d}$ (resp. $M{n,r,d}$) be the stack (resp. coarse moduli) parametrizing smooth simple cyclic covers of degree $r$ over the projective space $\mathbb{P}n$ branched along a divisor of degree $rd \geq 4$, and ($2$) $\mathscr{H}{1,3,d_1,d_2}$ (resp. $M{1,3,d_1,d_2}$) be the stack (resp. coarse moduli) of smooth cyclic triple covers over $\mathbb{P}1$ with $2d_1-d_2 \geq 4$ and $2d_2-d_1 \geq 4$. In the former case, we show that such a family exists if and only if $\textrm{gcd}(rd, n+1) \mid d$ while in the latter case, we show that it always exists. We further show that even when such a family exists, often it cannot be extended to the open locus of objects without extra automorphisms. The existence of tautological families on a Zariski open set of its coarse moduli can be interpreted in terms of rationality of the stack if the coarse moduli space is rational. Combining our results with known results on the rationality of the coarse moduli of points on $\mathbb{P}1$ and the coarse moduli of plane curves, we determine the rationality of $\mathscr{H}{1,r,d}$ (resp. $\mathscr{H}{2,r,d}$) for $rd \geq 4$ (resp. $rd\geq 49$). On the other hand $\mathscr{H}{1,3,d{1},d_{2}}$ is unirational, and we show that its coarse moduli $M_{1,3,d_1,d_2}$ is unirational and fibred over a rational base by homogeneous varieties which are rational if $\textrm{char}(\mathbb{k}) = 0$. Our study is motivated by the work of Gorchinskiy and Viviani on the moduli of hyperelliptic curves.

Summary

Paper to Video (Beta)

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.