Computations and ML for surjective rational maps

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Karzhemanov, Ilya
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866912639349686272
author Karzhemanov, Ilya
author_facet Karzhemanov, Ilya
contents The present note studies \emph{surjective rational endomorphisms} $f: \mathbb{P}^2 \dashrightarrow \mathbb{P}^2$ with \emph{cubic} terms and the indeterminacy locus $I_f \ne \emptyset$. We develop an experimental approach, based on some Python programming and Machine Learning, towards the classification of such maps; a couple of new explicit $f$ is constructed in this way. We also prove (via pure projective geometry) that a general non-regular cubic endomorphism $f$ of $\mathbb{P}^2$ is surjective if and only if the set $I_f$ has cardinality at least $3$.
format Preprint
id arxiv_https___arxiv_org_abs_2510_08093
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Computations and ML for surjective rational maps
Karzhemanov, Ilya
Algebraic Geometry
Machine Learning
The present note studies \emph{surjective rational endomorphisms} $f: \mathbb{P}^2 \dashrightarrow \mathbb{P}^2$ with \emph{cubic} terms and the indeterminacy locus $I_f \ne \emptyset$. We develop an experimental approach, based on some Python programming and Machine Learning, towards the classification of such maps; a couple of new explicit $f$ is constructed in this way. We also prove (via pure projective geometry) that a general non-regular cubic endomorphism $f$ of $\mathbb{P}^2$ is surjective if and only if the set $I_f$ has cardinality at least $3$.
title Computations and ML for surjective rational maps
topic Algebraic Geometry
Machine Learning
url https://arxiv.org/abs/2510.08093