Cayley-Menger Varieties in Distance Geometry

• Cayley-Menger varieties are determinantal algebraic sets defined by the vanishing of symmetric minors, representing collections of pairwise squared distances in diverse metric spaces.
• They encode necessary and sufficient criteria for embeddability and rigidity in Euclidean, ℓ_p, and generalized settings, linking classical distance geometry to modern algebraic methods.
• Applications extend to molecular conformation, sensor network localization, and tropical geometry, where computational techniques uncover circuit dependencies and combinatorial rigidity.

The Cayley-Menger variety is a fundamental algebraic construct capturing all possible collections of pairwise squared distances among $n$ points in a metric space, most prominently in Euclidean spaces or their generalizations to arbitrary metric signatures and normed settings such as $\ell_p$-spaces. These varieties are determinantal algebraic sets defined by the vanishing of specific symmetric minors, encoding geometric constraints of embeddability, rigidity, and identifiability. Their study connects classical distance geometry, rigidity theory, tropical geometry, algebraic combinatorics, and geometric functional analysis.

1. Classical Definition and Algebraic Structure

For an $n$-tuple of labeled points $p_1,\dots,p_n$ in $\mathbb{R}^d$ (or any affine space with metric $m$), the Cayley-Menger matrix CM is a symmetric $(n+1)\times(n+1)$ matrix: $$CM(p_1,\dots,p_n) = \begin{pmatrix} 0 & 1 & 1 & \cdots & 1 \ 1 & 0 & d_{12} & \cdots & d_{1n} \ 1 & d_{12} & 0 & \ddots & \vdots \ \vdots & \vdots & \ddots & \ddots & d_{n-1,n} \ 1 & d_{1n} & \cdots & d_{n-1,n} & 0 \end{pmatrix}$$ where $d_{ij}$ is typically the squared metric distance (e.g., Euclidean $d_{ij} = \|p_i-p_j\|^2$) (Hajja et al., 2017, Casimiro et al., 2023). The vanishing of the Cayley-Menger determinant and all its $(d+2)\times(d+2)$ minors for $n > d + 1$ provides necessary and sufficient algebraic conditions for the distance data to come from a $d$-dimensional configuration.

Algebraically, the set of all such realizable distance vectors forms the Cayley-Menger variety $\text{CM}_{n,d} \subset \mathbb{C}^{{n \choose 2}}$ (Bernstein et al., 2018). This determinantal variety is irreducible of dimension $dn - \binom{d+1}{2}$, reflecting the parametrization by $d$ coordinates per point, modulo the $d(d+1)/2$-dimensional Euclidean motion group.

2. Generalizations: Metric Signatures and $\ell_p$-Norms

The classical setup generalizes to affine spaces with arbitrary metric signatures and to $\ell_p$-spaces with even $p \geq 2$. In arbitrary signature, the Cayley-Menger matrix is defined using the bilinear form induced by the metric, with entries $$d_{ij} = 2\cdot \delta^m_{p_i}(p_j) = g_m(\vec{p_i p_j}, \vec{p_i p_j})$$; the determinant is proportional to the squared volume of the corresponding simplex (Casimiro et al., 2023).

For $\ell_p$-spaces, the $p$-Cayley-Menger variety $\text{CM}^p_n$ is the Zariski closure of the map

$$f_p : (x_1,\dots,x_n) \mapsto ((x_i-x_j)^p)_{1 \leq i < j \leq n}$$

with dimension $n-1$ (since translations act freely) (Sugiyama et al., 2024). Similar determinantal conditions capture the embeddability and rigidity properties in these non-quadratic normed settings.

3. Irreducibility, Circuit Polynomials, and Algebraic Matroids

The defining equations for Cayley-Menger varieties are homogeneous, symmetric polynomials, notably irreducible except for low-dimensional special cases (Heron-Bretschneider polynomials for triangles) (Hajja et al., 2017). The ideal generated by all relevant minors (e.g., all $5 \times 5$ minors for planar configurations) forms the Cayley-Menger ideal, which underlies an algebraic matroid structure over the coordinate ring (Malić et al., 2021).

Minimal algebraic dependencies correspond to circuits in this matroid, whose defining polynomials (circuit polynomials) characterize symbolic rigidity and distance ambiguities in frameworks. Efficient computation of these polynomials leverages extended combinatorial resultant trees and factorization strategies to handle high-degree instances in applications such as molecular inference and sensor localization.

4. Tropical Geometry and Combinatorial Rigidity

The tropicalization of the Cayley-Menger variety provides a polyhedral model for the space of possible distance vectors, crucial in rigidity theory. For $d=2$, $\text{trop}(\text{CM}_{n,2})$ coincides with the Minkowski sum of two spaces of ultrametrics on $n$ leaves, with the polyhedral fan decomposed into cones indexed by pairs of rooted trees (Bernstein et al., 2018).

This tropical perspective yields new combinatorial proofs and characterizations, such as the tropical proof of Laman's theorem: a graph is minimally rigid in the plane if and only if suitable tropical secant projections have maximal dimension, corresponding bijectively to classic edge-count conditions and Henneberg constructions.

5. Secant Varieties, Defectivity, and Global Rigidity

Rigidity, both infinitesimal and global, is controlled by secant varieties and identifiability properties of Cayley-Menger varieties. The $d$-secant variety $S_d(V)$ of $V$ captures all possible sums of $d$ realizable realizations, with defectivity indicating redundancy in rigidity (Sugiyama et al., 2024).

The concept of $d$-tangential weak non-defectivity (due to Bocci, Chiantini, Ottaviani, Vannieuwenhoven) gives sufficient conditions for $d$-identifiability, guaranteeing uniqueness of secant decompositions. For even $p$, Sugiyama-Tanigawa prove that global rigidity in $\ell_p^2$ is equivalent to $2$-identifiability, absence of $2$-tangential weak defectivity, the existence of coordinate-wise stresses of maximal rank, and redundantly $2$-tree-connected graphs (Sugiyama et al., 2024).

6. Applications, Algorithmic Aspects, and Characterizations

Cayley-Menger varieties find applications in distance geometry (molecular conformation, sensor network localization), algebraic combinatorics (graph rigidity), computational geometry, and the study of hypersphere arrangements (via twisted cohomology and hypergeometric integrals with NBC bases) (Aomoto et al., 2017).

Efficient computation of circuit polynomials and symbolic elimination in the rigidity matroid are essential for practical applications (Malić et al., 2021). Purely combinatorial characterizations (2-connectedness, redundant tree-connectivity) correspond to identifiability of orthogonal projections of $p$-Cayley-Menger varieties, enabling algorithmic testing in rigidity and embeddability problems.

7. Functorial and Geometric Interpretations

Casimiro–Rodrigo introduce a functorial symmetric bilinear form (“Cayley-Menger product”), unifying the geometric interpretation of Cayley-Menger determinants and minors as Gram determinants in spaces of quadratic functions with arbitrary metric signature (Casimiro et al., 2023). The structure and dimension of Cayley-Menger varieties correspond to isotropy loci of this form, generalizing to affine bundles and pseudo-Riemannian settings via functorial isometries.

---

Key references: (Hajja et al., 2017, Casimiro et al., 2023, Bernstein et al., 2018, Malić et al., 2021, Aomoto et al., 2017, Sugiyama et al., 2024).