2000 character limit reached
Kronecker products of Perron similarities
Published 27 Oct 2021 in math.SP and math.RA | (2110.14111v1)
Abstract: An invertible matrix is called a Perron similarity if one of its columns and the corresponding row of its inverse are both nonnegative or both nonpositive. Such matrices are of relevance and import in the study of the nonnegative inverse eigenvalue problem. In this work, Kronecker products of Perron similarities are examined and used to to construct ideal Perron similarities all of whose rows are extremal.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.