The Cayley-Menger determinant is irreducible for n≥ 3
Abstract
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 polynomials associated to related geometric constructions.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.