Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 84 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 21 tok/s Pro
GPT-5 High 28 tok/s Pro
GPT-4o 96 tok/s Pro
GPT OSS 120B 462 tok/s Pro
Kimi K2 189 tok/s Pro
2000 character limit reached

Generic matrix polynomials with fixed rank and fixed degree (1612.04085v1)

Published 13 Dec 2016 in math.NA

Abstract: The set ${\cal P}{m\times n}{r,d}$ of $m \times n$ complex matrix polynomials of grade $d$ and (normal) rank at most $r$ in a complex $(d+1)mn$ dimensional space is studied. For $r = 1, \dots , \min {m, n}-1$, we show that ${\cal P}{m\times n}{r,d}$ is the union of the closures of the $rd+1$ sets of matrix polynomials with rank $r$, degree exactly $d$, and explicitly described complete eigenstructures. In addition, for the full-rank rectangular polynomials, i.e. $r= \min {m, n}$ and $m \neq n$, we show that ${\cal P}{m\times n}_{r,d}$ coincides with the closure of a single set of the polynomials with rank $r$, degree exactly $d$, and the described complete eigenstructure. These complete eigenstructures correspond to generic $m \times n$ matrix polynomials of grade $d$ and rank at most~$r$.

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.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

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

Follow-up Questions

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