Polar degrees and closest points in codimension two
Algebraic Geometry
2019-08-16 v2
Abstract
Suppose that is a toric variety of codimension two defined by an integer matrix , and let be a Gale dual of . In this paper we compute the Euclidean distance degree and polar degrees of (along with other associated invariants) combinatorially working from the matrix . Our approach allows for the consideration of examples that would be impractical using algebraic or geometric methods. It also yields considerably simpler computational formulas for these invariants, allowing much larger examples to be computed much more quickly than the analogous combinatorial methods using the matrix in the codimension two case.
Cite
@article{arxiv.1711.02381,
title = {Polar degrees and closest points in codimension two},
author = {Martin Helmer and Bernt Ivar Utstøl Nødland},
journal= {arXiv preprint arXiv:1711.02381},
year = {2019}
}
Comments
25 pages, 1 figure