SearcharxivSearch

arXiv · 2607.09670

Universal optimality of the double-centred matrix under unitarily invariant norms for dissimilarity data

Abstract

Let $D=(D_{ij})_{i,j=1}^{n}$ be a symmetric dissimilarity matrix and let $D^{(2)}=(D_{ij}^{2})_{i,j=1}^{n}$. We study the affine family of real symmetric matrices \[ A(\mathbf{g})=\tfrac{1}{2}\!\left(\mathbf{1}\mathbf{g}^{\top} +\mathbf{g}\mathbf{1}^{\top}-D^{(2)}\right), \qquad \mathbf{g}\in\mathbb{R}^{n}, \] parametrised by a free diagonal vector $\mathbf{g}\in\mathbb{R}^n$, whose off-diagonal entries satisfy \[ D_{ij}^{2}=a_{ii}+a_{jj}-2a_{ij}, \qquad i\neq j. \] We prove that the double-centred matrix \[ A(\mathbf{g}^F)=-\tfrac{1}{2}J D^{(2)} J, \qquad J=I-\tfrac{1}{n}\mathbf{1}\mathbf{1}^{\top}, \] is the unique minimiser of the Frobenius norm over this family, with minimiser $\mathbf{g}^F$ given explicitly by \[ g^{F}_{k} = \frac{1}{n}\sum_{i=1}^{n}D_{ik}^{2} - \frac{1}{2n^{2}}\sum_{i,j=1}^{n}D_{ij}^{2}, \qquad k=1,\dots,n, \] and that this same representative simultaneously minimises every unitarily invariant norm \[ \min_{\mathbf{g}\in\mathbb{R}^n}\left|\!\left|\!\left|A(\mathbf{g})\right|\!\right|\!\right|, \] including the spectral norm, the nuclear norm, and all Schatten $p$-norms and Ky Fan $k$-norms. Thus the double-centred matrix, central to classical multidimensional scaling, admits a purely variational characterisation that does not depend on the choice of norm and requires no Euclidean realisability assumption on $D$.

Explore related subjects

Keep this discovery

BibTeXRIS

M. Nuria de las Heras Santos, Antonio Falcó, Francisco Javier Muñoz Almaraz. 2026-05-30. Universal optimality of the double-centred matrix under unitarily invariant norms for dissimilarity data. https://arxiv.org/abs/2607.09670

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA