Reduction of p-cyclic covers of the projective line
โ Scribed by Claus Lehr
- Publisher
- Springer
- Year
- 2001
- Tongue
- English
- Weight
- 183 KB
- Volume
- 106
- Category
- Article
- ISSN
- 0025-2611
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This paper studies the stable reduction of p-cyclic covers X โ P 1 K of the projective line over p-adic fields. So far, an algorithm to effectively determine the stable reduction of such covers is only known under additional hypothesis on the branch locus of the cover. Here, rather than restricting
A directed graph G with a source s and a sink r is called a p-graph if every edge of G belongs to an elementary (s,r)-path of G. If C is a cycle of the p-graph G then a cyclic cover of C is a set of (s,r)-paths of G that contains all the edges of C. A cyclic cover Q is minimal if for