Related papers: Tridiagonal matrices with nonnegative entries

A graph $G$ is asymmetric if its automorphism group of vertices is trivial. Asymmetric graphs were introduced by Erd\H{o}s and R\'{e}nyi in 1963 where they measured the degree of asymmetry of an asymmetric graph. They proved that any…

For matrices with all nonnegative entries, the Perron-Frobenius theorem guarantees the existence of an eigenvector with all nonnegative components. We show that the existence of such an eigenvector is also guaranteed for a very different…

Let $K$ denote a field and let $V$ denote a vector space over $K$ with finite positive dimension. We consider a pair of linear transformations $A:V \to V$ and $A^*:V \to V$ that satisfy the following conditions: (i) each of $A,A^*$ is…

Let d=(d_1,d_2,..., d_n) be a vector of non-negative integers. We study the number of symmetric 0-1 matrices whose row sum vector equals d. While previous work has focussed on the case of zero diagonal, we allow diagonal entries to equal 1.…

Finding the inverse of a matrix is an open problem especially when it comes to engineering problems due to their complexity and running time (cost) of matrix inversion algorithms. An optimum strategy to invert a matrix is, first, to reduce…

A hypergraph is simple if it has no loops and no repeated edges, and a hypergraph is linear if it is simple and each pair of edges intersects in at most one vertex. For $n\geq 3$, let $r= r(n)\geq 3$ be an integer and let $\boldsymbol{k} =…

In [Rank-Width and Well-Quasi-Ordering of Skew-Symmetric or Symmetric Matrices, arXiv:1007.3807v1] Oum proved that, for a fixed finite field $\mathbf{F}$, any infinite sequence $M_1,M_2,...$ of (skew) symmetric matrices over $\mathbf{F}$ of…

We prove that every nonderogatory matrix $A$ over a field of positive odd characteristic $p,$ that is sum of a $p$-potent matrix and a nilpotent matrix, has a decomposition $A=E+V,$ such that $E^p=E,$ and $V^3=0.$

A diagram $\mathcal{D} = (G, l)$ over a monoid $M$ is an oriented graph $G = (V, E)$ endowed with a labeling $l\colon E \to M$. A diagram is commutative if and only if for any two oriented paths with the same endpoints, the products in $M$…

The analysis of diagonalizable matrices in terms of their so-called isospectral reduction represents a versatile approach to the underlying eigenvalue problem. Starting from a symmetry of the isospectral reduction, we show in the present…

The Drazin index is a fundamental invariant in the analysis of singular matrices and their generalized inverses. While sharp results are available for block triangular matrices, the corresponding theory for anti-triangular block matrices is…

The spectra of signed matrices have played a fundamental role in social sciences, graph theory, and control theory. In this work, we investigate the computational problems of identifying symmetric signings of matrices with natural spectral…

The ensemble of antagonistic matrices is introduced and studied. In antagonistic matrices the entries $\mathcal A_{i,j}$ and $\mathcal A_{j,i}$ are real and have opposite signs, or are both zero, and the diagonal is zero. This…

Let $A_1, \ldots, A_r$ be Hermitian $n \times n$ matrices and $S = \sum A_i \otimes s_i$ the associated matrix semicircle, where $s_1, \ldots, s_r$ are free semicircular variables. We prove that the following are equivalent: (i) the matrix…

Let A be a nonassociative algebra such that the associator (A,A^2,A) vanishes. If A is freely generated by an element f, there are commuting derivations delta_n, n=1,2,..., such that delta_n(f) is a nonlinear homogeneous polynomial in f of…

Let $\K$ denote a field and let $V$ denote a vector space over $\K$ with finite positive dimension. We consider a pair of linear transformations $A:V \to V$ and $A^*:V \to V$ that satisfy the following conditions: (i) each of $A,A^*$ is…

The independent domination number $i(G)$ of a graph $G$ is the minimum cardinality of a maximal independent set of $G$, also called an $i(G)$-set. The $i$-graph of $G$ is the graph whose vertices correspond to the $i(G)$-sets, and where two…

Algebras generated by strictly positive matrices are described up to similarity, including the commutative, simple, and semisimple cases. We provide sufficient conditions for some block diagonal matrix algebras to be generated by a set of…

A hollow matrix described by a graph $G$ is a real symmetric matrix having all diagonal entries equal to zero and with the off-diagonal entries governed by the adjacencies in $G$. For a given graph $G$, the determination of all possible…

Let $M=[m_{ij}]$ be an $n\times m$ real matrix, $\rho$ be a nonzero real number, and $A$ be a symmetric real matrix. We denote by $D(M)$ the $n\times n$ diagonal matrix $diag(\sum_{j=1}^{m}m_{1j},\ldots,\sum_{j=1}^{m}m_{nj})$ and denote by…