The critical exponent: a novel graph invariant
Preprint
Abstract
A surprising result of FitzGerald and Horn (1977) shows that $A^{\circ \alpha} := (a_{ij}^\alpha)$ is positive semidefinite (p.s.d.) for every entrywise nonnegative $n \times n$ p.s.d. matrix $A = (a_{ij})$ if and only if $\alpha$ is a positive integer or $\alpha \geq n-2$. Given a graph $G$, we consider the refined problem of characterizing the set $\mathcal{H}_G$ of entrywise powers preserving positivity for matrices with a zero pattern encoded by $G$. Using algebraic and combinatorial methods, we study how the geometry of $G$ influences the set $\mathcal{H}_G$. Our treatment provides new and exciting connections between combinatorics and analysis, and leads us to introduce and compute a new graph invariant called the critical exponent.
Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Matrix positivity preservers in fixed dimension. IAdvances in Mathematics, 2016
- Critical exponents of graphsJournal of Combinatorial Theory, Series A, 2016
- Complete characterization of Hadamard powers preserving Loewner positivity, monotonicity, and convexityJournal of Mathematical Analysis and Applications, 2015
- Retaining positive definiteness in thresholded matricesLinear Algebra and its Applications, 2012
- Monotonicity for entrywise functions of matricesLinear Algebra and its Applications, 2009
- The minimum rank of symmetric matrices described by a graph: A surveyLinear Algebra and its Applications, 2007
- Positivity Preserving Hadamard Matrix FunctionsPositivity, 2007
- Schur products and matrix completionsJournal of Functional Analysis, 1989
- Positive definite completions of partial Hermitian matricesLinear Algebra and its Applications, 1984
- On fractional Hadamard powers of positive definite matricesJournal of Mathematical Analysis and Applications, 1977