The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
We develop a geometric method for studying the spectral arbitrariness of a given sign pattern matrix. The method also provides a computational way of computing matrix realizations for a given characteristic polynomial. We also provide a partial answer to -conjecture. We determine that the -conjecture holds for the class of spectrally arbitrary patterns that have a column or row with at least nonzero entries.
Download Results (CSV)