Speaker
Darko Veljan
Description
We describe refinements of Euler's inequality that the circumradius is at least n times larger than the inradius of an n-simplex T, provide explicit refinements for n = 2,3,4 and a recursive procedure for higher dimensions. We describe probability application in astrophysics. The final remarks are on Grace-Danielsson-Drozdev theorem (2024) on the upper bound of the distance between the circumcenter and incenter of spheres of the simplex (Egan's conjecture) and corresponding conjectures.
