Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 92 tok/s
Gemini 2.5 Pro 53 tok/s Pro
GPT-5 Medium 36 tok/s
GPT-5 High 36 tok/s Pro
GPT-4o 113 tok/s
GPT OSS 120B 472 tok/s Pro
Kimi K2 214 tok/s Pro
2000 character limit reached

Matrix polynomials, generalized Jacobians, and graphical zonotopes (1506.05179v1)

Published 17 Jun 2015 in math.AG and nlin.SI

Abstract: A matrix polynomial is a polynomial in a complex variable $\lambda$ with coefficients in $n \times n$ complex matrices. The spectral curve of a matrix polynomial $P(\lambda)$ is the curve ${ (\lambda, \mu) \in \mathbb{C}2 \mid \mathrm{det}(P(\lambda) - \mu \cdot \mathrm{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.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube