Related papers: Total nonnegativity of GCD matrices and kernels

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…

This paper is an endeavor to discuss some properties of zero-divisor graphs of the ring $\mathbb{Z}_n$, the ring of integers modulo $n$. The zero divisor graph of a commutative ring $R$, is an undirected graph whose vertices are the nonzero…

Let $G$ be a linear algebraic group over a field $k$, and let $V$ be a $G$-module. Recall that the nullcone of $(G,V)$ is the set of points $v$ in $V$ with the property that $f(v)=0$ for every positive degree homogeneous invariant $f$ in…

Let ${\bf a}=(a_1, a_2, \ldots, a_n)$ and ${\bf e}=(e_1, e_2, \ldots, e_n)$ be real sequences. Denote by $M_{{\bf e}\rightarrow {\bf a}}$ the $(n+1)\times(n+1)$ matrix whose $(m,k)$ entry ($m, k \in \{0,\ldots, n\}$) is the coefficient of…

A sequence of vertices in a graph $G$ with no isolated vertices is called a total dominating sequence if every vertex in the sequence totally dominates at least one vertex that was not totally dominated by preceding vertices in the…

A total dominating set of a graph $G=(V,E)$ is a subset $D \subseteq V$ such that every vertex in $V$ is adjacent to some vertex in $D$. Finding a total dominating set of minimum size is NP-hard on planar graphs and W[2]-complete on general…

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…

Using the relationship between totally nonnegative matrices and directed acyclic weighted planar networks, we show that $2\times 2$ minors of minor matrices of totally nonnegative matrices are also nonnegative. We give a combinatorial…

A square matrix $A$ is completely positive if $A=BB^T$, where $B$ is a (not necessarily square) nonnegative matrix. In general, a completely positive matrix may have many, even infinitely many, such CP factorizations. But in some cases a…

We conjecture new elementary formulas for computing the greatest common divisor (GCD) of two integers, alongside an elementary formula for extracting the prime factors of semiprimes. These formulas are of fixed-length and require only the…

We show that the set of totally positive unipotent lower-triangular Toeplitz matrices in $GL_n$ form a real semi-algebraic cell of dimension $n-1$. Furthermore we prove a natural cell decomposition for its closure. The proof uses properties…

Sylvester's criterion characterizes positive definite (PD) and positive semidefinite (PSD) matrices without the need of eigendecomposition. It states that a symmetric matrix is PD if and only if all of its leading principal minors are…

An important code of length $n^2$ is obtained by taking centralizer of a square matrix over a finite field $\mathbb{F}_q$. Twisted centralizer codes, twisted by an element $a \in \mathbb{F}_q$, are also similar type of codes but different…

Given $\mathbf{n}=(n_{1},\ldots,n_{r})\in\mathbb{N}^r$, let $\Gamma_{\mathbf{n}}$ be a group presentable as $$\left\langle \gamma_{1},\ldots,\gamma_{r}\:|\:\gamma_{1}^{n_{1}}=\gamma_{2}^{n_{2}}=\cdots=\gamma_{r}^{n_{r}}\right\rangle. $$ If…

An $n\times n$ matrix $X$ is called completely positive semidefinite (cpsd) if there exist $d\times d$ Hermitian positive semidefinite matrices $\{P_i\}_{i=1}^n$ (for some $d\ge 1$) such that $X_{ij}= {\rm Tr}(P_iP_j),$ for all $i,j \in \{…

There is a cell decomposition of the nonnegative Grassmannian. For each cell, totally positive bases(TP-bases) is defined as the minimal set of Pl\"ucker variables such that all other nonzero Pl\"ucker variables in the cell can be expressed…

Let $v_1$,..., $v_n$ be $n$ vectors in an inner product space. Can we find a natural number $d$ and positive (semidefinite) complex matrices $A_1$,..., $A_n$ of size $d \times d$ such that ${\rm Tr}(A_kA_l)= <v_k, v_l>$ for all $k,l=1,...,…

We exhibit a lower-triangular matrix of polynomials $T(a,c,d,e,f,g)$ in six indeterminates that appears empirically to be coefficientwise totally positive, and which includes as a special case the Eulerian triangle. We prove the…

We prove the nonsingularity of a class of integer matrices V(n,d), namely power-product matrix, for positive integers n and d. Some technical proofs are mainly based on linear algebra and enumerative combinatorics, particularly the…

We survey some results on linear-time algorithms for systolic arrays. In particular, we show how the greatest common divisor (GCD) of two polynomials of degree n over a finite field can be computed in time O(n) on a linear systolic array of…