## Abstract Let ℳ︁(__n__ , __d__ ) be a coprime moduli space of stable vector bundles of rank __n__ ≥ 2 and degree __d__ over a complex irreducible smooth projective curve __X__ of genus __g__ ≥ 2 and ℳ︁~__ξ__~ ⊂ ℳ︁(__n__ , __d__ ) a fixed determinant moduli space. Assuming that the degree __d__ i
A note on the unirationality of a moduli space of double covers
✍ Scribed by NN Iyer Jaya; Stefan Müller–Stach
- Publisher
- John Wiley and Sons
- Year
- 2011
- Tongue
- English
- Weight
- 106 KB
- Volume
- 284
- Category
- Article
- ISSN
- 0025-584X
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
In this note we look at the moduli space \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}${\mathcal R}_{3,2}$\end{document} of double covers of genus three curves, branched along 4 distinct points. This space was studied by Bardelli, Ciliberto and Verra in 1. It admits a dominating morphism \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}${\mathcal R}_{3,2} \rightarrow {\mathcal A}_4$\end{document} to Siegel space. We show that there is a birational model of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}${\mathcal R}_{3,2}$\end{document} as a group quotient of a product of two Grassmannian varieties. This gives a proof of the unirationality of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}${\mathcal R}_{3,2}$\end{document} and hence a new proof for the unirationality of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}${\mathcal A}_4$\end{document}.
📜 SIMILAR VOLUMES
## Abstract Let __SCC__~3~(__G__) be the length of a shortest 3‐cycle cover of a bridgeless cubic graph __G__. It is proved in this note that if __G__ contains no circuit of length 5 (an improvement of Jackson's (__JCTB 1994__) result: if __G__ has girth at least 7) and if all 5‐circuits of __G_
## Abstract We give a 4‐chromatic planar graph, which admits a vertex partition into three parts such that the union of every two of them induces a forest. This solves a problem posed by Böhme. Also, by constructing an infinite sequence of graphs, we show that the cover degeneracy can be arbitraril
## Abstract For any plane graph __G__ the number of edges in a minimum edge covering of the faces of __G__ is at most the vertex independence number of __G__ and the numbre of vertices in a minimum vertex covering of the faces of __G__ is at most the edge independence number of __G__. © 1995 John W