arXiv subjects
Publications and source records attributed to Pietro Paparella.
An elementary proof of the two-sidedness of the matrix-inverse is given using only linear independence and the reduced row-echelon form of a matrix. In addition, it is shown that a matrix is invertible if and only if it is row-equivalent to the identity matrix without appealing to elementary matrices. This proof underscores the importance of a basis and provides a proof of the invertible matrix theorem.
The nonnegative inverse eigenvalue problem (NIEP) asks which lists of $n$ complex numbers (counting multiplicity) occur as the eigenvalues of some $n$-by-$n$ entry-wise nonnegative matrix. The NIEP has a long history and is a known hard (perhaps the hardest in matrix analysis?) and sought after problem. Thus, there are many subproblems and relevant results in a variety of directions. We survey most work on the problem and its several variants, with an emphasis on recent results, and include 130 references. The survey is divided into: a) the single eigenvalue problems; b) necessary conditions; c) low dimensional results; d) sufficient conditions; e) appending 0's to achieve realizability; f) the graph NIEP's; g) Perron similarities; and h) the relevance of Jordan structure.
The question of the exact region in the complex plane of the possible single eigenvalues of all $n$-by-$n$ stochastic matrices was raised by Kolmogorov in 1937 and settled by Karpelevič in 1951 after a partial result by Dmitriev and Dynkin in 1946. The Karpelevič result is unwieldy, but a simplification was given by Đoković in 1990 and Ito in 1997. The Karpelevič region is determined by a set of boundary arcs each connecting consecutive roots of unity of order less than $n$. It is shown here that each of these arcs is realized by a single, somewhat simple, parametrized stochastic matrix. Other observations are made about the nature of the arcs and several further questions are raised. The doubly stochastic analog of the Karpelevič region remains open, but a conjecture about it is amplified.
In further pursuit of the diagonalizable \emph{real nonnegative inverse eigenvalue problem} (RNIEP), we study the relationship between the \emph{row cone} $\mathcal{C}_r(S)$ and the \emph{spectracone} $\mathcal{C}(S)$ of a Perron similarity $S$. In the process, a new kind of matrix, \emph{row Hadamard conic} (RHC), is defined and related to the D-RNIEP. Characterizations are given when $\mathcal{C}_r(S) = \mathcal{C}(S)$, and explicit examples are given for all possible set-theoretic relationships between the two cones. The symmetric NIEP is the special case of the D-RNIEP in which the Perron similarity $S$ is also orthogonal.
In this note, we simplify the statements of theorems attributed to Cauchy and Ostrovsky and give proofs of each theorem via combinatorial and nonnegative matrix theory. We also show that each simple sufficient condition in each statement is also necessary in its respective case. In addition, we introduce the notion of a spectrally Perron polynomial and pose a problem that appeals to a wide mathematical audience.
It is known that the critical exponent (CE) for conventional, continuous powers of $n$-by-$n$ doubly nonnegative (DN) matrices is $n-2$. Here, we consider the larger class of diagonalizable, entry-wise nonnegative $n$-by-$n$ matrices with nonnegative eigenvalues (GDN). We show that, again, a CE exists and are able to bound it with a low-coefficient quadratic. However, the CE is larger than in the DN case; in particular, 2 for $n=3$. There seems to be a connection with the index of primitivity, and a number of other observations are made and questions raised. It is shown that there is no CE for continuous Hadamard powers of GDN matrices, despite it also being $n-2$ for DN matrices.
In this work, we find an explicit expression for the volume of the trace nonnegative polytope via a generalization of the Irwin-Hall distribution. This volume is an upper bound for the volume of all projected, normalized realizable spectra. We provide ancillary results on realizable trace-zero spectra and pose several problems suitable for further inquiry.
A permutative matrix is a square matrix such that every row is a permutation of the first row. A constructive version of a result attributed to Suleimanova is given via permutative matrices. In addition, we strengthen a well-known result by showing that all realizable spectra containing at most four elements can be realized by a permutative matrix or by a direct sum of permutative matrices. We conclude by posing a problem.
Call an $n$-by-$n$ invertible matrix $S$ a \emph{Perron similarity} if there is a real non-scalar diagonal matrix $D$ such that $S D S^{-1}$ is entrywise nonnegative. We give two characterizations of Perron similarities and study the polyhedra $\mathcal{C}(S) := \{ x \in \mathbb{R}^n: S D_x S^{-1} \geq 0,~D_x := \text{diag}(x) \}$ and $\mathcal{P})(S) := \{x \in \mathcal{C}(S) : x_1 = 1 \}$, which we call the \emph{Perron spectracone} and \emph{Perron spectratope}, respectively. The set of all normalized real spectra of diagonalizable nonnegative matrices may be covered by Perron spectratopes, so that enumerating them is of interest. The Perron spectracone and spectratope of Hadamard matrices are of particular interest and tend to have large volume. For the canonical Hadamard matrix (as well as other matrices), the Perron spectratope coincides with the convex hull of its rows. In addition, we provide a constructive version of a result due to Fiedler (\cite[Theorem 2.4]{f1974}) for Hadamard orders, and a constructive version of \cite[Theorem 5.1]{bh1991} for Sule\uımanova spectra.
Using matrix function theory, Perron-Frobenius theory, combinatorial matrix theory, and elementary number theory, we characterize, classify, and describe in terms of the Jordan canonical form the matrix pth-roots of imprimitive irreducible nonnegative matrices. Preliminary results concerning the matrix roots of reducible matrices are provided as well.
In this note, we characterize matrix functions that preserve the strong Perron-Frobenius property using the real Jordan canonical form of a real matrix.
Arising from the classification of the matrix-roots of a nonnegative imprimitive irreducible matrix, we present results concerning the Jordan chains of an $h$-cyclic matrix. We also present ancillary results applicable to nonnegative imprimitive irreducible matrices and demonstrate these results via examples.
Eventually positive matrices are real matrices whose powers become and remain strictly positive. As such, eventually positive matrices are a fortiori matrix roots of positive matrices, which motivates us to study the matrix roots of primitive matrices. Using classical matrix function theory and Perron-Frobenius theory, we characterize, classify, and describe in terms of the real Jordan canonical form the $p$th-roots of eventually positive matrices.
Binary Integer Programming (BIP) problems are of interest due in part to the difficulty they pose and because of their various applications, including those in graph theory, combinatorial optimization and network optimization. In this note, we explicitly state the Lovasz-Schrijver Semidefinite Programming (SDP) relaxation (in primal-standard form) for a BIP problem, a relaxation that yields a tighter upper-bound than the canonical Linear Programming relaxation.
Complete residue systems play an integral role in abstract algebra and number theory, and a description is typically found in any number theory textbook. This note provides a concise overview of complete residue systems, including a robust definition, several well-known results, a proof to the converse of a well-known theorem, ancillary results pertaining to an application arising from the study of the roots of nonnegative matrices, and extends our knowledge of complete residue systems in relation to complete sets of roots of unity.