4 added 7 characters in body

Suppose you are given a single unit square, and you are permitted to cut it into $k$ (connected) pieces (where $k=1$ means just the square). Your task is to construct the largest volume convex body in $\mathbb{R}^3$ by pasting the $k$ pieces together as its complete surface; so its surface area is $\le 1$. Denote its volume by $V_\max(k)$. (This is a more general version of my earlier question, Covering a Cube with a Square.)

The best one could hope for is to create a sphere with unit surface area, when the radius satisfies $4 \pi r^2 =1$ and so $r=\frac{1}{2\sqrt{\pi}} \approx 0.28$, and the volume is $V_\max(\infty)= V_\max = \frac{4}{3} \pi r^3 = \frac{1}{6 \pi} sqrt{\pi}} \approx 0.094$.

In response to a question of Joe Malkevitch, with students I computed the optimum for $k=1$, with no cuts and no overlap, and found a maximum volume of $V_\max(1)\approx 0.056$, which is about 60% of the sphere volume. [p.418 in Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Demaine, O'Rourke, Cambridge, 2007.]:

The seeming randomness of this shape discouraged my further pursuit.

The case $k=2$ resembles the famous tea-bag problem, but here I am restricting attention to convex bodies.

As $k \to \infty$, one should be able to approach $V_\max$ by, for example, cutting the square into many nearly equilateral triangles and constructing a geodesic dome.

I am wondering if anyone has heard of this problem in any guise before? And in any case, can anyone see any clear hypothesis, for any particular $k$? Presumably one could establish that $V_\max(k+1) > V_\max(k)$, but beyond that, I do not see how to make inroads. Is there an obvious candidate for $k=2$?

Update. Here is my interpretation of Gerhard's suggestion for $k=2$:

3 added 233 characters in body

Suppose you are given a single unit square, and you are permitted to cut it into $k$ (connected) pieces (where $k=1$ means just the square). Your task is to construct the largest volume convex body in $\mathbb{R}^3$ by pasting the $k$ pieces together as its complete surface; so its surface area is $\le 1$. Denote its volume by $V_\max(k)$. (This is a more general version of my earlier question, Covering a Cube with a Square.)

The best one could hope for is to create a sphere with unit surface area, when the radius satisfies $4 \pi r^2 =1$ and so $r=\frac{1}{2\sqrt{\pi}} \approx 0.28$, and the volume is $V_\max(\infty)= V_\max = \frac{4}{3} \pi r^3 = \frac{1}{6 \pi} \approx 0.094$.

In response to a question of Joe Malkevitch, with students I computed the optimum for $k=1$, with no cuts and no overlap, and found a maximum volume of $V_\max(1)\approx 0.056$, which is about 60% of the sphere volume. [p.418 in Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Demaine, O'Rourke, Cambridge, 2007.]:

The seeming randomness of this shape discouraged my further pursuit.

The case $k=2$ resembles the famous tea-bag problem, but here I am restricting attention to convex bodies.

As $k \to \infty$, one should be able to approach $V_\max$ by, for example, cutting the square into many nearly equilateral triangles and constructing a geodesic dome.

I am wondering if anyone has heard of this problem in any guise before? And in any case, can anyone see any clear hypothesis, for any particular $k$? Presumably one could establish that $V_\max(k+1) > V_\max(k)$, but beyond that, I do not see how to make inroads. Is there an obvious candidate for $k=2$?

Update. Here is my interpretation of Gerhard's suggestion for $k=2$:

2 added 80 characters in body

Suppose you are given a single unit square, and you are permitted to cut it into $k$ (connected) pieces (where $k=1$ means no cuts)just the square). Your task is to construct the largest volume convex body in $\mathbb{R}^3$ by pasting the $k$ pieces together as its complete surface; so its surface area is $\le 1$. Denote its volume by $V_\max(k)$. (This is a more general version of my earlier question, Covering a Cube with a Square.)

The best one could hope for is to create a sphere with unit surface area, when the radius satisfies $4 \pi r^2 =1$ and so $r=\frac{1}{2\sqrt{\pi}} \approx 0.28$, and the volume is $V_\max(\infty)= V_\max = \frac{4}{3} \pi r^3 = \frac{1}{6 \pi} \approx 0.094$.

In response to a question of Joe Malkevitch, with students I computed the optimum for $k=1$, with no cuts and no overlap, and found a maximum volume of $V_\max(1)\approx 0.056$, which is about 60% of the sphere volume. [p.418 in Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Demaine, O'Rourke, Cambridge, 2007.]:

The seeming randomness of this shape discouraged my further pursuit.

The case $k=2$ resembles the famous tea-bag problem, but here I am restricting attention to convex bodies.

As $k \to \infty$, one should be able to approach $V_\max$ by, for example, cutting the square into many nearly equilateral triangles and constructing a geodesic dome.

I am wondering if anyone has heard of this problem in any guise before? And in any case, can anyone see any clear hypothesis, for any particular $k$? Presumably one could establish that $V_\max(k+1) > V_\max(k)$, but beyond that, I do not see how to make inroads. Is there an obvious candidate for $k=2$?

1
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "http://mathoverflow.net/revisions/96102/list", "fetch_time": 1368915060000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2013-20/segments/1368696382917/warc/CC-MAIN-20130516092622-00047-ip-10-60-113-184.ec2.internal.warc.gz", "warc_record_offset": 164878905, "warc_record_length": 6201, "token_count": 1464, "char_count": 5272, "score": 3.671875, "int_score": 4, "crawl": "CC-MAIN-2013-20", "snapshot_type": "latest", "language": "en", "language_score": 0.8997035026550293, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00056-of-00064.parquet"}