Completing the rank identity for Hadamard powers of Euclidean distance matrices
Abstract
Horvat et al. (J. Math. Chem., 2014) showed that the rank of the n-th Hadamard power D(n) of a Euclidean distance matrix satisfies rankD(n) Rdn, and proved that the inequality is strict whenever an annihilating polynomial exists. The converse - that the absence of annihilating polynomials forces rankD(n) = Rdn - was left as an open problem. We resolve it by exhibiting a kernel factorisation D(n) = ΦV\, M\, ΦVT, where ΦV is the evaluation matrix on the polynomial space V and M is a universal matrix independent of the point configuration. A trinomial expansion of the kernel reveals that M has a block-diagonal structure whose blocks are sums of Gram matrices with positive coefficients; this yields the non-singularity of~M and completes the rank identity.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.