Timeline for Forcing a symmetric sequence in $[0,1]$
Current License: CC BY-SA 4.0
13 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Aug 18 at 2:41 | comment | added | David Roberts♦ | @PietroMajer in that case, it's fine. Someone had flagged a previous comment that made the point much less nicely and I wanted to replace that with an informative and cheerful version. | |
Aug 17 at 20:34 | vote | accept | Virgile Dine | ||
Aug 17 at 20:31 | answer | added | 1001 | timeline score: 1 | |
Aug 17 at 20:19 | comment | added | 1001 | Something to do with discrepancy | |
Aug 17 at 20:07 | comment | added | 1001 | Equivalently, does there exists a $c$ such that we can colour any finite set of points red and blue such that in every axis-aligned rectangle the number of red points and the number of blue points differs by at most $c$? | |
Aug 17 at 19:19 | history | edited | Virgile Dine | CC BY-SA 4.0 |
deleted 620 characters in body
|
Aug 17 at 18:47 | history | edited | Virgile Dine | CC BY-SA 4.0 |
added 15 characters in body
|
S Aug 17 at 18:46 | history | suggested | Jean Abou Samra | CC BY-SA 4.0 |
Remove irrelevant tags
|
Aug 17 at 14:24 | comment | added | Pietro Majer | @DavidRoberts I have the impression that "simple question at a pre-graduate level" just means it has a simple formulation by elementary notions, but not necessarily that it has a simple answer at pre-graduate level (like e.g. the FLThm). | |
Aug 17 at 12:42 | comment | added | David Roberts♦ | Hi! Unfortunately questions on undergraduate mathematics are not on-topic on MathOverflow, which has a deliberately narrow scope (roughly, PhD-level and above). Were you thinking of other StackExchange site for mathematics questions? Best of luck with your studies! | |
Aug 17 at 11:56 | review | Suggested edits | |||
S Aug 17 at 18:46 | |||||
S Aug 17 at 8:03 | review | First questions | |||
Aug 17 at 20:34 | |||||
S Aug 17 at 8:03 | history | asked | Virgile Dine | CC BY-SA 4.0 |