Positivity of Hadamard powers of a few band matrices

Abstract

Let PG([0,∞)) and PG'([0,∞)) be the sets of positive semidefinite and positive definite matrices of order n, respectively, with nonnegative entries, where some positions of zero entries are restricted by a simple graph G with n vertices. It is proved that for a connected simple graph G of order n≥ 3, the set of powers preserving positive semidefiniteness on PG([0,∞)) is precisely the same as the set of powers preserving positive definiteness on PG'([0,∞)). In particular, this provides an explicit combinatorial description of the critical exponent for positive definiteness, for all chordal graphs. Using chain sequences, it is proved that the Hadamard powers preserving the positive (semi) definiteness of every tridiagonal matrix with nonnegative entries are precisely r≥ 1. The infinite divisibility of tridiagonal matrices is studied. The same results are proved for a special family of pentadiagonal matrices.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…