2000 character limit reached
On an extremal problem connected with simplices (1303.3454v2)
Published 14 Mar 2013 in math.MG and math.CO
Abstract: In this note we investigate the behavior of the volume that the convex hull of two congruent and intersecting simplices in Euclidean $n$-space can have. We prove some useful equalities and inequalities on this volume. For the regular simplex we determine the maximal possible volume for the case when the two simplices are related to each other via reflection at a hyperplane intersecting them.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.