CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
The Cayley-Menger determinant is irreducible for
n
≥
3
n\geq 3
n
≥
3
Authors
Carlos D'Andrea
Martin Sombra
Publication date
17 June 2004
Publisher
View
on
arXiv
Abstract
We prove that the Cayley-Menger determinant of an
n
n
n
-dimensional simplex is an absolutely irreducible polynomial for
n
≥
3.
n\geq3.
n
≥
3.
We also study the irreducibility of polynomials associated to related geometric constructions.Comment: 7 pages, 4 figure
Similar works
Full text
Available Versions
Oskar Bordeaux
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:oskar-bordeaux.fr:20.500.1...
Last time updated on 15/05/2024
Oskar Bordeaux
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:oskar-bordeaux.fr:20.500.1...
Last time updated on 18/11/2021