{
  "id": "2304.10017",
  "version": "v1",
  "published": "2023-04-20T00:08:43.000Z",
  "updated": "2023-04-20T00:08:43.000Z",
  "title": "Minimizing edge-length polyhedrons",
  "authors": [
    "Ásgeir Valfells"
  ],
  "categories": [
    "math.MG"
  ],
  "abstract": "A 1957 conjecture by Zdzislaw Melzak, that the unit volume polyhedron with least edge length was a triangular right prism, with edge length $2^{2/3}3^{11/6}$. We present a variety of necessary local criteria for any minimizer. In the case that we are restricted to convex polyhedrons we demonstrate that all vertices must be of degree three, the number of triangular faces is at most 14, and we describe the behavior of quadrilateral faces should they become arbitrarily small.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2023-04-20T00:08:43.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "minimizing edge-length polyhedrons",
      "edge length",
      "unit volume polyhedron",
      "triangular right prism",
      "necessary local criteria"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}