The Analytical Solution of the Additive Constant Problem

1983/06/01 by Francis Cailliez · 6 citations
Computer Science · Mathematics · #Matrix Theory and Algorithms #Tensor decomposition and applications #Advanced Optimization Algorithms Research

paper · doi:10.1007/bf02294026

Abstract

If d is a measure of dissimilarity on a finite set with n elements, the smallest positive constant c * such that d + c has an euclidean representation for all c ≥ c * is shown to be the largest eigen-value of a matrix of size 2 n .

Cited by

• Cetacean evolution through the lens of ecospace modeling and disparity analyse
• Multidimensional Scaling, Sammon Mapping, and Isomap: Tutorial and Survey
• Identification and Query of Activated Gene Pathways in Disease Progression
• ngsAMOVA: A Probabilistic Framework for Analysis of Molecular Variance, d XY and Neighbor-Joining Trees with Low Depth Sequencing Data
• Qualitative Visualization of Distance Information
• Learning Manifolds from Non-stationary Streaming Data

Related

• The first eigenvector of a distance matrix is nearly constant
• A general formula in Additive Number Theory
• Bounds on A_α-eigenvalues using graph invariants
• Bounding the support of a measure from its marginal moments
• Graphs and Hermitian matrices: exact interlacing