Year: 2024
Type: article
Abstract: Let X = {x 1 ,... ,x n } be a finite set endowed with a metric d . The matrix A = (d(x i ,x j )) nn is called a distance matrix. In this paper we discuss about the minimum rank that can be achieved by an n n distance matrix and prove that the rank of every 5 5 and 6 6 distance matrix is not less than 4.
Authors: Zahra Gachkooban, R. Alizadeh
Language: English
Topic: Matrix Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4391620171