Restrictive polynomial correspondences on P1 x P1 are characterized as sums of separable polynomial terms; the irreducible (rho=2) case rewrites as R(z)=S(w) for rational maps R and S, with a binary operation to generate new examples from old ones.
Matrix analysis
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GM 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A classification of restrictive polynomial correspondences
Restrictive polynomial correspondences on P1 x P1 are characterized as sums of separable polynomial terms; the irreducible (rho=2) case rewrites as R(z)=S(w) for rational maps R and S, with a binary operation to generate new examples from old ones.