Counterexamples on spectra of sign patterns

DOI10.1090/PROC/14041MaRDI QIDQ4577145zbMATH OpenOpenAlexWikidataFDO

Authors Ya. N. Shitov

Publication date 17 July 2018

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1612.05818

zbMATH Keywords

eigenvaluessign patternmatrix theory

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Sign pattern matrices (15B35)

Abstract: An $nimesn$ sign pattern $S$, which is a matrix with entries $0,+,-$, is called spectrally arbitrary if any monic real polynomial of degree $n$ can be realized as a characteristic polynomial of a matrix obtained by replacing the non-zero elements of $S$ by numbers of the corresponding signs. A sign pattern $S$ is said to be a superpattern of those matrices that can be obtained from $S$ by replacing some of the non-zero entries by zeros. We develop a new technique that allows us to prove spectral arbitrariness of sign patterns for which the previously known "Nilpotent Jacobian" method does not work. Our approach leads us to solutions of numerous open problems known in the literature. In particular, we provide an example of a sign pattern $S$ and its superpattern $S^{\prime }$ such that $S$ is spectrally arbitrary but $S^{\prime }$ is not, disproving a conjecture proposed in 2000 by Drew, Johnson, Olesky, and van den Driessche.

Recommendations

• A note on spectrally arbitrary sign patterns
• A class of minimally spectrally arbitrary sign patterns
• scientific article; zbMATH DE number 6130221
• A solution to a problem on the spectra of sign pattern matrices
• A new class of minimally spectrally arbitrary sign patterns
• A new class of minimally spectrally arbitrary sign patterns
• On the Spectra of Striped Sign Patterns
• Some spectrally and inertially arbitrary sign patterns
• Potentially nilpotent and spectrally arbitrary even cycle sign patterns
• Spectral properties of sign patterns

Cites work

• A proof of the \(T_n\) conjecture: Centralizers, Jacobians and spectrally arbitrary sign patterns
• Allow problems concerning spectral properties of patterns
• Allow problems concerning spectral properties of sign pattern matrices: a survey
• Complex spectrally arbitrary zero-nonzero patterns
• Generating potentially nilpotent full sign patterns
• Minimal Spectrally Arbitrary Sign Patterns
• Nilpotent matrices and spectrally arbitrary sign patterns
• On determining minimal spectrally arbitrary patterns
• On the Spectra of Striped Sign Patterns
• Potentially nilpotent patterns and the nilpotent-Jacobian method
• Refined inertially and spectrally arbitrary zero-nonzero patterns
• Spectrally and inertially arbitrary sign patterns
• Spectrally arbitrary pattern extensions
• Spectrally arbitrary patterns
• Spectrally arbitrary patterns: Reducibility and the \(2n\) conjecture for \(n = 5\)
• Spectrally arbitrary star sign patterns
• Spectrally arbitrary zero–nonzero patterns of order 4
• The nilpotent-centralizer method for spectrally arbitrary patterns

Cited in

(3)

• Spectral properties of sign patterns
• Sign pattern matrices
• A few examples and counterexamples in spectral graph theory

This page was built for publication: Counterexamples on spectra of sign patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4577145)