Related papers: On orthogonal matrices with zero diagonal

In this paper we characterize the nonnegative irreducible tridiagonal matrices and their permutations, using certain entries in their primitive idempotents. Our main result is summarized as follows. Let $d$ denote a nonnegative integer. Let…

Let $ex(n, P)$ be the maximum possible number of ones in any 0-1 matrix of dimensions $n \times n$ that avoids $P$. Matrix $P$ is called minimally non-linear if $ex(n, P) = \omega(n)$ but $ex(n, P') = O(n)$ for every strict subpattern $P'$…

The adjacency matrices of graphs form a special subset of the set of all integer symmetric matrices. The description of which graphs have all their eigenvalues in the interval [-2,2] (i.e., those having spectral radius at most 2) has been…

We introduce a notion of compatibility for multiplicity matrices. This gives rise to a necessary condition for the join of two (possibly disconnected) graphs $G$ and $H$ to be the pattern of an orthogonal symmetric matrix, or equivalently,…

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…

An n \times n matrix A has a normal defect of k if there exists an (n+k) \times (n+k) normal matrix A_{ext} with A as a leading principal submatrix and k minimal. In this paper we compute the normal defect of a special class of 4 \times 4…

Let $d\geq 3$ be a fixed integer and $A$ be the adjacency matrix of a random $d$-regular directed or undirected graph on $n$ vertices. We show there exist constants $\mathfrak d>0$, \begin{align*} {\mathbb P}(\text{$A$ is singular in…

A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…

A matchstick graph is a graph drawn with straight edges in the plane such that the edges have unit length, and non-adjacent edges do not intersect. We call a matchstick graph $(m;n)$-regular if every vertex has only degree $m$ or $n$. In…

Orthogonal designs and weighing matrices have many applications in areas such as coding theory, cryptography, wireless networking and communication. In this paper, we first show that if positive integer $k$ cannot be written as the sum of…

In this paper we have discussed different possible orthogonalities in matrices, namely orthogonal, quasi-orthogonal, semi-orthogonal and non-orthogonal matrices including completely positive matrices, while giving some of their…

Consider a family of infinite tri--diagonal matrices of the form $L+ zB,$ where the matrix $L$ is diagonal with entries $L_{kk}= k^2,$ and the matrix $B$ is off--diagonal, with nonzero entries $B_{k,{k+1}}=B_{{k+1},k}= k^\alpha, 0 \leq…

For given k distinct complex conjugate pairs, l distinct real numbers, and a given graph G on 2k+l vertices with a matching of size at least k, we will show that there is a real matrix whose eigenvalues are the given numbers and its graph…

We consider orthogonal polynomials with respect to a linear differential operator $$\mathcal{L}^{(M)}=\sum_{k=0}^{M}\rho_{k}(z)\frac{d^k}{dz^k}, $$ where $\{\rho_k\}_{k=0}^{M}$ are complex polynomials such that $deg[\rho_k]\leq k, 0\leq k…

Let $h(n)$ be the minimum integer such that every complete $n$-vertex simple topological graph contains an edge that crosses at most $h(n)$ other edges. In 2009, Kyn\v{c}l and Valtr showed that $h(n) = O(n^2/\log^{1/4} n)$, and in the other…

In this work, we define an orthogonal graph on the set of equivalence classes of $(2\nu + \delta)-$tuples over $\mathbb{Z}_{2^n}$ where $n$ and $\nu$ are positive integers and $\delta = 0, 1$ or $2$. We classify our graph if it is strongly…

In this article we have derived the minimum order of an odd regular graph such that the graph has no matching. We have observed that how it is different from the case of even regular graphs. We have checked the consistency of the derived…

Given an integer n greater of equal to 3, we investigate the minimal dimension of a subalgebra of M_n(K) with a trivial centralizer. It is shown that this dimension is 5 when n is even and 4 when it is odd. In the latter case, we also…

Graph is considered neutral if its assortativity coefficient $r$ is equal to zero. In this paper, we address an outstanding conjecture, i.e., whether is there a neutral graph on $n$ vertices? First, we show that for $n\geq7$, there is at…

A real symmetric n times n matrix is called copositive if the corresponding quadratic form is non-negative on the closed first orthant. If the matrix fails to be copositive there exists some non-negative certificate for which the quadratic…