2000 character limit reached
Covering rational surfaces with rational parametrization images
Published 18 Jan 2021 in math.AG and cs.SC | (2101.07011v1)
Abstract: Let $S$ be a rational projective surface given by means of a projective rational parametrization whose base locus satisfies a mild assumption. In this paper we present an algorithm that provides three rational maps $f,g,h:\mathbb{A}2 --\to S\subset \mathbb{P}n$ such that the union of the three images covers $S$. As a consequence, we present a second algorithm that generates two rational maps $f,\tilde{g}:\mathbb{A}2 --\to S$, such that the union of their images covers the affine surface $S\cap \mathbb{A}n$. In the affine case, the number of rational maps involved in the cover is in general optimal.
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.