2000 character limit reached
Turning non-smooth points into rational points
Published 22 Feb 2024 in math.AG and math.NT | (2402.14969v1)
Abstract: In a paper, the author and St\"ohr established a bound on the number of iterated Frobenius pullbacks needed to transform a non-smooth non-decomposed point on a regular geometrically integral curve into a rational point. In this note we improve this result, by establishing a new bound that is sharp in every characteristic $p > 0$.
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.