Timeline for On convex planar regions that can be cut into only a specified number of mutually congruent and connected pieces
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 14, 2022 at 12:12 | vote | accept | Nandakumar R | ||
| Jan 14, 2022 at 12:12 | |||||
| Jan 12, 2022 at 10:57 | comment | added | Nandakumar R | Guess this rearrangement with one piece going the other way - but with all pieces being congruent - could work for any N, including all composites. IOW, this polygon appears to be partitionable only into N congruent pieces. And it seems to have no problem with mirrors. thnx! | |
| Jan 12, 2022 at 10:07 | comment | added | Ilya Bogdanov | @SaúlRodríguezMartín That’s what I meant by ‘as in your example’ —- meaning the OP’s example, with a polyline of $p$ segments. You know, a pizza is not perfectly round;) | |
| Jan 12, 2022 at 10:05 | comment | added | Saúl RM | This could be divided into $kN$ pieces for any $k$. But if you change the slices by strange slices like the ones from my answer it seems to work without orientation changes | |
| Jan 12, 2022 at 9:57 | history | answered | Ilya Bogdanov | CC BY-SA 4.0 |