Matrix polynomials, generalized Jacobians, and graphical zonotopes
Abstract
A matrix polynomial is a polynomial in a complex variable λ with coefficients in n × n complex matrices. The spectral curve of a matrix polynomial P(λ) is the curve \ (λ, μ) ∈ C2 det(P(λ) - μ · Id) = 0\. The set of matrix polynomials with a given spectral curve C is known to be closely related to the Jacobian of C, provided that C is smooth. We extend this result to the case when C is an arbitrary nodal, possibly reducible, curve. In the latter case the set of matrix polynomials with spectral curve C turns out to be naturally stratified into smooth pieces, each one being an open subset in a certain generalized Jacobian. We give a description of this stratification in terms of purely combinatorial data and describe the adjacency of strata. We also make a conjecture on the relation between completely reducible matrix polynomials and the canonical compactified Jacobian defined by V.Alexeev.
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.