Related papers: Zero-dilation Index of a Finite Matrix

We introduce the concept of multiplication matrices for ideals of projective dimension zero. We discuss various applications and in particular, we give a new algorithm to compute the variety of an ideal of projective dimension zero.

The adjacency-diametrical matrix (AD matrix) of a connected graph $G$ with diameter $d$, denoted by $AD(G)$, is the matrix indexed by the vertices of $G$ in which the $(i,j)$-entry of $AD(G)$ is $1$ if $d_G(v_i,v_j)=1$, is $d$ if…

A permutation array(or code) of length $n$ and distance $d$, denoted by $(n,d)$ PA, is a set of permutations $C$ from some fixed set of $n$ elements such that the Hamming distance between distinct members $\mathbf{x},\mathbf{y}\in C$ is at…

Cayley-Dickson algebras are an infinite sequence of non-associative algebras starting with the reals, complexes, quaternions, and octonions. We study the zero-divisors in the higher Cayley-Dickson algebras. In particular, we show that the…

The spread of a matrix is defined as the maximum of distances between any two eigenvalues of that matrix. In this paper we investigate spread maximization as a function on compact convex subset of the set of real symmetric matrices. We…

A Euclidean distance matrix $D(\alpha)$ is defined by $D_{ij}=(\alpha_i-\alpha_j)^2$, where $\alpha=(\alpha_1,\ldots,\alpha_n)$ is a real vector. We prove that $D(\alpha)$ cannot be written as a sum of $\left[2\sqrt{n}-2\right]$ nonnegative…

We introduce a novel parametrization of the correlation matrix. The reparametrization facilitates modeling of correlation and covariance matrices by an unrestricted vector, where positive definiteness is an innate property. This…

The largest eigenvalue of a matrix is always larger or equal than its largest diagonal entry. We show that for a large class of random Laplacian matrices, this bound is essentially tight: the largest eigenvalue is, up to lower order terms,…

An Erd\"os matrix $E$ is a bistochastic matrix whose sum of squares of entries (Frobenius norm squared) equals its maxtrace (maximum of all the $\sigma$-traces for permutations $\sigma$'s). We characterize all Erd\"os $E$ by the patterns of…

The index of a signed graph is the largest eigenvalue of its adjacency matrix. For positive integers $n$ and $m\le n^2/4$, we determine the maximal index of complete signed graphs with $n$ vertices and $m$ negative edges. This settles (the…

Let G be a graph with adjacency matrix A(G) and degree diagonal matrix D(G). In 2017, Nikiforov [1] defined the matrix Aalpha(G), as a convex combination of A(G) and D(G), the following way, Aalpha(G) = alpha A(G) + (1 - alpha)D(G), where…

For an arbitrary matrix dilation, any integer n and any integer/semi-integer c, we describe all masks that are symmetric with respect to the point c and have sum rule of order n. For each such mask, we give explicit formulas for wavelet…

Let $\gamma$ be a generator of a cyclic group $G$ of order $n$. The least index of a self-mapping $f$ of $G$ is the index of the largest subgroup $U$ of $G$ such that $f(x)x^{-r}$ is constant on each coset of $U$ for some positive…

We introduce matrix algebra of subsets in metric spaces and we apply it to improve results of Yamauchi and Davila regarding Asymptotic Property C. Here is a representative result: Suppose $X$ is an $\infty$-pseudo-metric space and $n\ge 0$…

Let $A$ be an irreducible (entrywise) nonnegative $n\times n$ matrix with eigenvalues $$\rho, b+ic,b-ic, \lambda_4,\cdots,\lambda_n,$$ where $\rho$ is the Perron eigenvalue. It is shown that for any $t \in [0, \infty)$ there is a…

The study of inner and cyclic functions in $\ell^p_A$ spaces requires a better understanding of the zeros of the so-called optimal polynomial approximants. We determine that a point of the complex plane is the zero of an optimal polynomial…

The problem of rectangle tiling binary arrays is defined as follows. Given an $n \times n$ array $A$ of zeros and ones and a natural number $p$, our task is to partition $A$ into at most $p$ rectangular tiles, so that the maximal weight of…

We consider the following two closed sets in $C^n$. One is the diagonal D given by $ (z, z, z,...z_)$. The other is $A = \{(z_1,z_2,z_3,...z_n):.$ $.e^{z_1} + e^{z_2} +e^{z_3} +...+ e^{z_n}=0\}$. Clearly $D \cap A$ is empty. One can ask…

We show that the maximal number of equal entries in a totally positive (resp. totally nonsingular) $n\textrm{-by-}n$ matrix is $\Theta(n^{4/3})$ (resp. $\Theta(n^{3/2}$)). Relationships with point-line incidences in the plane, Bruhat order…

We construct fast, structure-preserving iterations for computing the sign decomposition of a unitary matrix $A$ with no eigenvalues equal to $\pm i$. This decomposition factorizes $A$ as the product of an involutory matrix $S =…