On the algorithmic undecidability of the embeddability problem for algebraic varieties over a field of characteristic zero

DOI10.1134/S0001434619070332MaRDI QIDQ2282864zbMATH OpenOpenAlexFDO

Authors A. A. Chilikov, A. Ya 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

zbMATH Keywords

algebraic geometryembeddability of varietiesundecidability

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Embeddings in algebraic geometry (14E25) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Cited in

(4)

• 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
• Alekseĭ Yakovlevich Kanel'-Belov

This page was built for publication: On the algorithmic undecidability of the embeddability problem for algebraic varieties over a field of characteristic zero

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