RUS  ENG
Full version
JOURNALS // Zapiski Nauchnykh Seminarov POMI // Archive

Zap. Nauchn. Sem. POMI, 2004 Volume 307, Pages 189–235 (Mi znsl845)

This article is cited in 8 papers

Polynomial-time computation of the degree of a dominant morphism in characteristic zero. I

A. L. Chistov

St. Petersburg Institute for Informatics and Automation of RAS

Abstract: Consider a projective algebraic variety $W$ that is an irreducible component of the set of all common zeros of a family of homogeneous polynomials of degrees less than $d$ in $n+1$ variables over a field of zero characteristic. We show how to compute the degree of a dominant rational morphism from $W$ to $W'$ with $\dim W=\dim W'$. The morphism is given by homogeneous polynomials of degree $d'$. This algorithm is deterministic and polynomial in $(dd')^n$ and the size of input.

UDC: 518.5+513.6

Received: 25.12.2003


 English version:
Journal of Mathematical Sciences (New York), 2005, 131:2, 5547–5568

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024