Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Unfoldings and Nets of Regular Polytopes (2111.01359v1)

Published 2 Nov 2021 in cs.CG and math.CO

Abstract: Over a decade ago, it was shown that every edge unfolding of the Platonic solids was without self-overlap, yielding a valid net. We consider this property for regular polytopes in arbitrary dimensions, notably the simplex, cube, and orthoplex. It was recently proven that all unfoldings of the $n$-cube yield nets. We show this is also true for the $n$-simplex and the $4$-orthoplex but demonstrate its surprising failure for any orthoplex of higher dimension.

Citations (1)

Summary

We haven't generated a summary for this paper yet.