English

Counterexamples on spectra of sign patterns

Combinatorics 2016-12-20 v1

Abstract

An n×nn\times n sign pattern SS, which is a matrix with entries 0,+,0,+,-, is called spectrally arbitrary if any monic real polynomial of degree nn can be realized as a characteristic polynomial of a matrix obtained by replacing the non-zero elements of SS by numbers of the corresponding signs. A sign pattern SS is said to be a superpattern of those matrices that can be obtained from SS 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 SS and its superpattern SS' such that SS is spectrally arbitrary but SS' is not, disproving a conjecture proposed in 2000 by Drew, Johnson, Olesky, and van den Driessche.

Keywords

Cite

@article{arxiv.1612.05818,
  title  = {Counterexamples on spectra of sign patterns},
  author = {Yaroslav Shitov},
  journal= {arXiv preprint arXiv:1612.05818},
  year   = {2016}
}

Comments

5 pages

R2 v1 2026-06-22T17:27:05.206Z