Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 63 tok/s
Gemini 2.5 Pro 44 tok/s Pro
GPT-5 Medium 31 tok/s Pro
GPT-5 High 32 tok/s Pro
GPT-4o 86 tok/s Pro
Kimi K2 194 tok/s Pro
GPT OSS 120B 445 tok/s Pro
Claude Sonnet 4.5 35 tok/s Pro
2000 character limit reached

Non-$μ$-ordinary smooth cyclic covers of $\mathbb{P}^1$ (2406.09632v1)

Published 13 Jun 2024 in math.AG and math.NT

Abstract: Given a family of cyclic covers of $\mathbb{P}1$ and a prime $p$ of good reduction, by [12] the generic Newton polygon (resp. Ekedahl--Oort type) in the family ($\mu$-ordinary) is known. In this paper, we investigate the existence of non-$\mu$-ordinary smooth curves in the family. In particular, under some auxiliary conditions, we show that when $p$ is sufficiently large the complement of the $\mu$-ordinary locus is always non empty, and for $1$-dimensional families with condition on signature type, we obtain a lower bound for the number of non-$\mu$-ordinary smooth curves. In specific examples, for small $m$, the above general statement can be improved, and we establish the non emptiness of all codimension 1 non-$\mu$-ordinary Newton/Ekedahl--Oort strata ({\em almost} $\mu$-ordinary). Our method relies on further study of the extended Hasse-Witt matrix initiated in [12].

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube