Timeline for Fair cutting of the plane with lines
Current License: CC BY-SA 4.0
23 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 30, 2023 at 15:21 | history | edited | Wlod AA | CC BY-SA 4.0 |
straight
|
| Apr 6, 2021 at 1:43 | vote | accept | Wlodek Kuperberg | ||
| Apr 4, 2021 at 23:55 | answer | added | Will Sawin | timeline score: 7 | |
| Mar 31, 2021 at 22:12 | answer | added | Yaakov Baruch | timeline score: 8 | |
| Mar 25, 2021 at 2:38 | comment | added | Wlodek Kuperberg | @YaakovBaruch: Thank you for mentioning Manuel Rivera's question. Indeed, it is very much related to mine, and the answer you gave there is very useful here, too! | |
| Mar 24, 2021 at 20:01 | answer | added | Pierre PC | timeline score: 3 | |
| Mar 23, 2021 at 23:25 | history | edited | Wlodek Kuperberg | CC BY-SA 4.0 |
added 46 characters in body
|
| Mar 23, 2021 at 23:15 | history | edited | Wlodek Kuperberg | CC BY-SA 4.0 |
added 46 characters in body
|
| Mar 23, 2021 at 21:26 | answer | added | Pierre PC | timeline score: 5 | |
| Mar 23, 2021 at 19:18 | comment | added | Wlodek Kuperberg | @YaakovBaruch If the union of the lines is dense, then the third bullet is satisfied (each cell has area zero), but the first bullet is not satisfied. | |
| Mar 23, 2021 at 16:39 | comment | added | Yaakov Baruch | Related question: mathoverflow.net/q/66508/2480 | |
| Mar 23, 2021 at 16:24 | comment | added | Yaakov Baruch | Doesn't the third bullet imply the first? | |
| Mar 23, 2021 at 3:39 | comment | added | Noam D. Elkies | One might be able to prove a negative answer to Question 1 by showing that every convex polygon $P$ of $n \geq 5$ or more sides has at least one side $s_i$ ($i \bmod n$) such that $s_i$ and the lines containing $s_{i\pm 1}$ form a triangle of area less than the area of $P$. | |
| Mar 23, 2021 at 2:35 | history | edited | Wlodek Kuperberg | CC BY-SA 4.0 |
added 13 characters in body
|
| Mar 22, 2021 at 14:27 | answer | added | Will Brian | timeline score: 13 | |
| Mar 20, 2021 at 23:41 | history | edited | Wlodek Kuperberg | CC BY-SA 4.0 |
deleted 41 characters in body
|
| Mar 20, 2021 at 20:27 | history | edited | Wlodek Kuperberg | CC BY-SA 4.0 |
deleted 7 characters in body
|
| Mar 20, 2021 at 17:57 | history | edited | gmvh |
edited tags
|
|
| Mar 20, 2021 at 14:42 | comment | added | Wlodek Kuperberg | @MattF. Yes, I'm glad you've noticed. | |
| Mar 20, 2021 at 14:39 | comment | added | user44143 | The numbering scheme seems to be that the cutting labeled $(n)$ has a maximum of $n$ lines meeting at one point. | |
| Mar 20, 2021 at 14:09 | history | edited | Wlodek Kuperberg | CC BY-SA 4.0 |
deleted 1 character in body
|
| Mar 20, 2021 at 4:25 | history | edited | RobPratt |
edited tags
|
|
| Mar 19, 2021 at 23:55 | history | asked | Wlodek Kuperberg | CC BY-SA 4.0 |