[Paper Review] On the characteristic of integral point sets in $\mathbb{E}^m$

Sascha Kurz|ArXiv.org|Nov 29, 2005

Mathematics and Applications8 references3 citations

TL;DR

This paper generalizes the concept of the characteristic of an integral triangle to higher-dimensional integral simplices using the Cayley-Menger determinant to define a squarefree invariant related to simplex volume. It proves that all non-degenerate m-dimensional simplices in an integral point set share the same characteristic, enabling an efficient algorithm for constructing integral point sets in ℝ^m and establishing new exact minimum diameters for such sets up to dimension 5 and 23 points.

ABSTRACT

We generalise the definition of the characteristic of an integral triangle to integral simplices and prove that each simplex in an integral point set has the same characteristic. This theorem is used for an efficient construction algorithm for integral point sets. Using this algorithm we are able to provide new exact values for the minimum diameter of integral point sets.

Motivation & Objective

• To extend the concept of the characteristic (squarefree part of volume-related determinant) from integral triangles to higher-dimensional integral simplices in ℝ^m.
• To prove that all non-degenerate m-dimensional simplices in a given integral point set share the same characteristic, enabling structural constraints for efficient enumeration.
• To develop a constructive algorithm leveraging this invariance to generate integral point sets in ℝ^m with minimal diameter.
• To compute new exact values for the minimum diameter d(m,n) of m-dimensional integral point sets with n points, particularly for m ≤ 5 and n ≤ 23.

Proposed method

• Define the characteristic of an m-dimensional integral simplex as the squarefree part of the volume squared, derived from the Cayley-Menger determinant.
• Use a coordinate transformation to express vertices of an integral simplex in a canonical form involving rational multiples of square roots of squarefree integers.
• Prove that the characteristic is invariant across all m-simplices in a given integral point set via geometric and algebraic arguments on distance matrices.
• Implement a generation algorithm that exploits the characteristic invariance to reduce search space by filtering point sets early.
• Use semi-canonical and canonical representations to avoid redundant isometric configurations during enumeration.
• Leverage the Cayley-Menger determinant to test for coplanarity and spherical position, ensuring semi-general and general position constraints.

Experimental results

Research questions

• RQ1 Does the characteristic of an integral triangle generalize meaningfully to higher-dimensional simplices in ℝ^m, and if so, how is it defined?
• RQ2 Is the characteristic invariant across all non-degenerate m-dimensional simplices within a single integral point set in ℝ^m?
• RQ3 Can the invariance of the characteristic be exploited to design a more efficient algorithm for constructing integral point sets in higher dimensions?
• RQ4 What are the exact values of the minimum diameter d(m,n) for m-dimensional integral point sets with n points, particularly for previously unknown cases?
• RQ5 How does imposing general position (no m+2 points on an m-sphere) affect the minimum diameter compared to semi-general position?

Key findings

• The characteristic of an m-dimensional integral simplex is defined as the squarefree part of the volume squared, derived from the Cayley-Menger determinant.
• All non-degenerate m-dimensional simplices in a single integral point set in ℝ^m share the same characteristic, a key structural invariant.
• The algorithm using characteristic invariance reduces the number of calls to the combine function by orders of magnitude compared to naive enumeration.
• New exact values for the minimum diameter d(3,n) are computed for n = 4 to 23, with previously unknown values highlighted as 16, 17, 56, 65, 77, 86, 99, 112, 133, 154, 195, 212, 228.
• For m=4 and m=5, new minimum diameters are found: d(4,n) = 1,4,7,14 for n=5 to 8 in general position, and d(5,n) = 1,4,5,8 for n=6 to 9.
• The algorithm successfully computes the minimum diameter for 23-point sets in 3D with diameter 228, demonstrating scalability.