[HTML][HTML] The 22 minimal dichotomy decompositions of the K5-distance
B Fichet - Discrete applied mathematics, 2008 - Elsevier
B Fichet
Discrete applied mathematics, 2008•ElsevierIn this note, we exhibit the 22 minimal dichotomy decompositions of the K5-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).
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).
In this note, we exhibit the 22 minimal dichotomy decompositions of the K5-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).
Elsevier
Showing the best result for this search. See all results