Bounded birationality and isomorphism problems are computable

DOI10.1007/S13366-022-00679-3MaRDI QIDQ6295962zbMATH OpenFDO

Authors Tuyen Trung Truong

Publication date 3 January 2018

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S13366-022-00679-3

Mathematics Subject Classification ID

Birational geometry (14Exx)

Abstract: Let $X,Y$ be two irreducible subvarieties of the projective space $mathbb{P}^n$, and $dgeq1$ an integer number. The main result of this paper is an algorithm to construct {�f explicitly}, in terms of $d$ and the ideals defining $X$ and $Y$, a quasi-affine algebraic variety parametrising the set of all birational maps $f$ from $X$ onto $Y$ which can be extended to a self-rational map of $mathbb{P}^n$ of degree $leqd$. Based on this result, we propose an approach towards the rationality problem (see Section 3 below), solve it for some simple cases (varieties of general type or curves), and state a rough strategy for reducing it to some simpler cases via Iitaka's fibrations. We also prove similar results for the case $f$ is a dominant rational map, regular morphism, isomorphism or regular embedding. Similar results are valid for varieties over an arbitrary algebraically closed field, and also for maps on non-projective varieties.

Recommendations

• The isomorphism problem of projective schemes and related algorithmic problems
• scientific article; zbMATH DE number 853077
• Computing the Equations of a Variety
• A Gröbner basis criterion for isomorphisms of algebraic varieties
• scientific article; zbMATH DE number 2214061

Cited in

(2)

• Open loci of ideals with applications to Birational maps
• Towards parallel methods in birational geometry

This page was built for publication: Bounded birationality and isomorphism problems are computable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6295962)