Distances from the vertices of a regular simplex

DOI10.1007/S00025-017-0689-1zbMATH Open1379.51005arXiv1609.06552OpenAlexW2963208642MaRDI QIDQ2407006FDOQ2407006

Authors: Mowaffaq Hajja, M. Hayajneh, Bach Nguyen, Shadi Shaqaqha 

Publication date: 4 October 2017

Published in: Results in Mathematics (Search for Journal in Brave)

Abstract: If $S$ is a given regular $d$-simplex of edge length $a$ in the $d$-dimensional Euclidean space $mathcalE$, then the distances $t_1$, $cdots$, $t_{d+1}$ of an arbitrary point in $mathcalE$ to the vertices of $S$ are related by the elegant relation ${\displaystyle }$(d+1)left( a^4+t_1^4+cdots+t_{d+1}^4 ight)=left( a^2+t_1^2+cdots+t_{d+1}^2 ight)^2.${\displaystyle }$ The purpose of this paper is to prove that this is essentially the only relation that exists among $t_1,cdots,t_{d+1}.$ The proof uses tools from analysis, algebra, and geometry.

Full work available at URL: https://arxiv.org/abs/1609.06552

Recommendations

• Irreducibility of the Cayley-Menger determinant and of a class of related polynomials
• Regular polytopic distances
• Large simplices determined by finite point sets
• The product of the distances of a point inside a regular polytope to its vertices
• On extremums of sums of powered distances to a finite set of points

zbMATH Keywords

integral domainKrull dimensionregular simplextranscendence degreeCayley-Menger determinantgermprincipal idealalgebraic dependencereal analytic functionheight of an idealSoddy circlesPompeiu's theorem

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Polyhedra and polytopes; regular figures, division of spaces (51M20) Length, area and volume in real or complex geometry (51M25) Elementary problems in Euclidean geometries (51M04)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Loxodromic sequences of tangent spheres
• Title not available (Why is that?)
• On a Theorem in Geometry
• Topics in Elementary Geometry
• Simultaneous Triangle Inequalities
• Irreducibility of the Cayley-Menger determinant and of a class of related polynomials
• Pre-kites: simplices having a regular facet

Cited In (8)

• Is it possible to determine a point lying in a simplex if we know the distances from the vertices?
• The distance to a polyhedron
• Irreducibility of the Cayley-Menger determinant and of a class of related polynomials
• Pre-kites: simplices having a regular facet
• The product of the distances of a point inside a regular polytope to its vertices
• Regular polytopic distances
• Linear characteristics of the simplices
• Pseudo-symmetric point sets and regular simplices

This page was built for publication: Distances from the vertices of a regular simplex

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2407006)