Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
421383 | Discrete Applied Mathematics | 2008 | 8 Pages |
Abstract
In this note, we exhibit the 22 minimal dichotomy decompositions of the K5K5-distance. The proof of exhaustivity is simple and relatively short. A simple checking of the solutions gives an immediate validation of two conjectures concerning the dimensionality (known result for five points) and principal component analysis (unknown result).
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Bernard Fichet,