Related papers: Counterexamples on spectra of sign patterns
An $n\times n$ zero pattern $S$, which is a matrix with entries $*$ and $0$, is called spectrally arbitrary with respect to a field $F$ if any monic polynomial $f$ of degree $n$ can be realized as the characteristic polynomial of a matrix…
A matrix pattern is often either a sign pattern with entries in {0,+,-} or, more simply, a nonzero pattern with entries in {0,*}. A matrix pattern A is spectrally arbitrary if for any choice of a real matrix spectrum, there is a real matrix…
A nonzero pattern is a matrix with entries in {0,*}. A pattern is potentially nilpotent if there is some nilpotent real matrix with nonzero entries in precisely the entries indicated by the pattern. We develop ways to construct some…
We develop a matrix bordering technique that can be applied to an irreducible spectrally arbitrary sign pattern to construct a higher order spectrally arbitrary sign pattern. This technique generalizes a recently developed triangle…
A square matrix $M$ with real entries is said to be algebraically positive (AP) if there exists a real polynomial $p$ such that all entries of the matrix $p(M)>0$. A square sign pattern matrix $S$ is said to allow algebraic positivity if…
Using standard techniques from combinatorics, model theory, and algebraic geometry, we prove generalized versions of several basic results in the theory of spectrally arbitrary matrix patterns. Also, we point out a counterexample to a…
The \textit{sepr-sequence} of an $n\times n$ real matrix $A$ is $(s_1,\ldots,s_n)$, where $s_k$ is the subset of those signs of $+,-,0$ that appear in the values of the $k\times k$ principal minors of $A$. The $12\times 12$ matrix…
A sign pattern is a matrix that has entries from the set $\{+,-,0\}$. An $n\times n$ sign pattern $\mathcal{P}$ is called consistent if every real matrix in its qualitative class has exactly $k$ real eigenvalues and $n-k$ nonreal…
In this paper we present a new family of minimal spectrally arbitrary patterns which allow for arbitrary spectrum by using the Nilpotent-Jacobian method. The novel approach here is that we use the Intermediate Value Theorem to avoid finding…
For a real matrix $M$, we denote by $sp(M)$ the spectrum of $M$ and by $\left \vert M\right \vert $ its absolute value, that is the matrix obtained from $M$ by replacing each entry of $M$ by its absolute value. Let $A$ be a nonnegative real…
A real square matrix is algebraically positive if there exists a real polynomial $f$ such that $f(A)$ is a positive matrix. In this paper, we give a sufficient condition for a sign pattern matrix to allow algebraic positivity, and give some…
The sign patterns of inverse doubly-nonnegative matrices are examined. A necessary and sufficient condition is developed for a sign matrix to correspond to an inverse doubly-nonnegative matrix. In addition, for a doubly-nonnegative matrix…
We provide the first example of a sign pattern $S$ for which there exist orthogonal matrices $Q_1$ and $Q_2$ with sign pattern $S$ such that $\det Q_1=1$ and $\det Q_2=-1$. The existence of such matrices is raised by C. Waters in {"Sign…
The Matrix Spencer Conjecture asks whether given $n$ symmetric matrices in $\mathbb{R}^{n \times n}$ with eigenvalues in $[-1,1]$ one can always find signs so that their signed sum has singular values bounded by $O(\sqrt{n})$. The standard…
We explore how the combinatorial arrangement of prescribed zeros in a matrix affects the possible eigenvalues that the matrix can obtain. We demonstrate that there are inertially arbitrary patterns having a digraph with no 2-cycle, unlike…
A sign pattern is a matrix whose entries belong to the set $\{+,-,0\}$. A sign pattern requires a unique inertia if every real matrix in its qualitative class has the same inertia. Symmetric tree sign patterns requiring a unique inertia has…
The spectral properties of signed directed graphs, which may be naturally obtained by assigning a sign to each edge of a directed graph, have received substantially less attention than those of their undirected and/or unsigned counterparts.…
In this paper we study the Rotor Model of Martins and Nienhuis. After introducing spectral parameters, a combined use of integrability, polynomiality of the ground state wave function and a mapping into the fully-packed O(1)-model allows us…
The number of $n \times n$ matrices whose entries are either -1, 0, or 1, whose row- and column- sums are all 1, and such that in every row and every column the non-zero entries alternate in sign, is proved to be $[1!4! >...…
An $n\times n$ matrix is said to have a self-interlacing spectrum if its eigenvalues $\lambda_k$, $k=1,\ldots,n$, are distributed as follows $$ \lambda_1>-\lambda_2>\lambda_3>\cdots>(-1)^{n-1}\lambda_n>0. $$ A method for constructing sign…