2000 character limit reached
Characterization of $k$-spectrally monomorphic Hermitian matrices
Published 12 Jul 2019 in math.CO | (1907.05817v2)
Abstract: This paper solves the following problem about Hermitian matrices related to the theory of $2$-structures:\emph{ }Let $n$ be a positive integer and $k$ be an integer with $k\in {3,\ldots,n-3}$. Characterize the Hermitian matrices $A$ such that the characteristic polynomials of the $k\times k$ submatrices of $A$ are all equal. Such matrices are called $k$-spectrally monomorphic. A crucial step to obtain this characterization is proving that if a matrix $A$ is $k$-spectrally monomorphic then it is $l$-spectrally monomorphic for $l$ in ${1,\ldots,min{k, n-k}}$.
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.