Polar degrees and closest points in codimension two
Abstract
Suppose that XA⊂ Pn-1 is a toric variety of codimension two defined by an (n-2)× n integer matrix A, and let B be a Gale dual of A. In this paper we compute the Euclidean distance degree and polar degrees of XA (along with other associated invariants) combinatorially working from the matrix B. 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 A in the codimension two case.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.