English

Completing the rank identity for Hadamard powers of Euclidean distance matrices

Rings and Algebras 2026-05-31 v1 Combinatorics

Abstract

Horvat et al. (J. Math. Chem., 2014) showed that the rank of the nn-th Hadamard power D(n)D^{(n)} of a Euclidean distance matrix satisfies rankD(n)Rdn\operatorname{rank}D^{(n)} \le R_d^n, and proved that the inequality is strict whenever an annihilating polynomial exists. The converse - that the absence of annihilating polynomials forces rankD(n)=Rdn\operatorname{rank}D^{(n)} = R_d^n - was left as an open problem. We resolve it by exhibiting a kernel factorisation D(n)=ΦVMΦVTD^{(n)} = \Phi_V\, M\, \Phi_V^T, where ΦV\Phi_V is the evaluation matrix on the polynomial space VV and MM is a universal matrix independent of the point configuration. A trinomial expansion of the kernel reveals that MM has a block-diagonal structure whose blocks are sums of Gram matrices with positive coefficients; this yields the non-singularity of~MM and completes the rank identity.

Keywords

Cite

@article{arxiv.2607.09671,
  title  = {Completing the rank identity for Hadamard powers of Euclidean distance matrices},
  author = {Boris Horvat and Alen Orbanić and Iztok Kavkler},
  journal= {arXiv preprint arXiv:2607.09671},
  year   = {2026}
}

Comments

First draft