论文信息 - The Cayley-Menger determinant is irreducible for n ≥ 3

The Cayley-Menger determinant is irreducible for n ≥ 3

We prove that the Cayley-Menger determinant of an n-dimensional simplex is an absolutely irreducible polynomial for n ≥ 3. We also study the irreducibility of the polynomials associated to the related geometric constructions.

C. D'Andrea | M. Sombra | C. D’Andrea | M. Sombra

[1] M. Klapper,et al. Use of Caley-Menger determinants in the calculation of molecular structures , 1980 .

[2] Bernard Mourrain,et al. Computer Algebra Methods for Studying and Computing Molecular Conformations , 1999, Algorithmica.

[3] Marcel Berger. Une caractérisation purement métrique des variétés Riemanniennes à courbure constante , 1981 .

[4] Idzhad Kh. Sabitov,et al. The Volume as a Metric Invariant of Polyhedra , 1998, Discret. Comput. Geom..

[5] R. Connelly,et al. The Bellows conjecture. , 1997 .

[6] Leonard M. Blumenthal,et al. Theory and applications of distance geometry , 1954 .

[7] J. Oxford,et al. Oxford , 1968, Leaving The Arena.

[8] Narsingh Deo,et al. Generating Edge-disjoint Sets of Quadruples in Parallel for the Molecular Conformation Problem , 2000 .