On the algorithmic undecidability of the embeddability problem for algebraic varieties over a field of characteristic zero
From MaRDI portal
Publication:2282864
DOI10.1134/S0001434619070332zbMath1442.14185OpenAlexW2970700129MaRDI QIDQ2282864
A. A. Chilikov, Alexei Kanel-Belov
Publication date: 20 December 2019
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0001434619070332
Decidability (number-theoretic aspects) (11U05) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Embeddings in algebraic geometry (14E25)
Related Items (3)
Pell surfaces ⋮ A combinatorial proof of simplified Kollár's theorem on Pell's equations ⋮ The isomorphism problem of projective schemes and related algorithmic problems
Cites Work
This page was built for publication: On the algorithmic undecidability of the embeddability problem for algebraic varieties over a field of characteristic zero
