Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and 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 167 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 33 tok/s Pro
GPT-5 High 40 tok/s Pro
GPT-4o 92 tok/s Pro
Kimi K2 193 tok/s Pro
GPT OSS 120B 425 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

On prescribed characteristic polynomials (2403.15138v1)

Published 22 Mar 2024 in math.RA

Abstract: Let $\mathbb{F}$ be a field. We show that given any $n$th degree monic polynomial $q(x)\in \mathbb{F}[x]$ and any matrix $A\in\mathbb{M}_n(\mathbb{F})$ whose trace coincides with the trace of $q(x)$ and consisting in its main diagonal of $k$ 0-blocks of order one, with $k<n-k$, and an invertible non-derogatory block of order $n-k$, we can construct a square-zero matrix $N$ such that the characteristic polynomial of $A+N$ is exactly $q(x)$. We also show that the restriction $k<n-k$ is necessary in the sense that, when the equality $k=n-k$ holds, not every characteristic polynomial having the same trace as $A$ can be obtained by adding a square-zero matrix. Finally, we apply our main result to decompose matrices into the sum of a square-zero matrix and some other matrix which is either diagonalizable, invertible, potent or torsion.

Citations (1)

Summary

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

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

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

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

Collections

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