Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Fillmore's theorem extended by Borobia

Published 16 Apr 2018 in math.SP | (1804.05738v1)

Abstract: Fillmore Theorem says that if A is an nxn complex non-scalar matrix and {\gamma}1,...,{\gamma}{n} are complex numbers with {\gamma}1+...+{\gamma}{n}=trA, then there exists a matrix B similar to A with diagonal entries {\gamma}1,...,{\gamma}{n}. Borobia simplifies this result and extends it to matrices with integer entries. Fillmore and Borobia do not consider the nonnegativity hypothesis. Here, we introduce a different and very simple way to compute the matrix B similar to A with diagonal {\gamma}1,...,{\gamma}{n}. Moreover, we consider the nonnegativity hypothesis and we show that for a list {\Lambda}={{\lambda}1,...,{\lambda}{n}} of complex numbers of Suleimanova or \v{S}migoc type, and a given list {\Gamma}={{\gamma}1,...,{\gamma}{n}} of nonnegative real numbers, the remarkably simple condition {\gamma}1+...+{\gamma}{n}={\lambda}1+...+{\lambda}{n} is necessary and sufficient for the existence of a nonnegative matrix with spectrum {\Lambda} and diagonal entries {\Gamma}. This surprising simple result improves a condition recently given by Ellard and \v{S}migoc in arXiv:.1702.02650v1.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

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

Continue Learning

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

Authors (2)

Collections

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