Timeline for a Littlewood–Offord-type problem concerning the "cubical lattice"
Current License: CC BY-SA 4.0
33 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 13, 2022 at 19:42 | vote | accept | BD107 | ||
| Nov 7, 2021 at 1:51 | vote | accept | BD107 | ||
| May 13, 2022 at 19:42 | |||||
| Nov 3, 2021 at 15:31 | answer | added | BD107 | timeline score: 0 | |
| S Aug 21, 2021 at 1:02 | history | bounty ended | CommunityBot | ||
| S Aug 21, 2021 at 1:02 | history | notice removed | CommunityBot | ||
| Aug 13, 2021 at 23:18 | history | edited | BD107 | CC BY-SA 4.0 |
deleted 38 characters in body
|
| Aug 13, 2021 at 20:48 | history | edited | BD107 | CC BY-SA 4.0 |
_undo_ renaming H --> A. this is to make it consistent with the existing answer
|
| Aug 13, 2021 at 1:48 | history | edited | BD107 | CC BY-SA 4.0 |
edited body
|
| Aug 13, 2021 at 1:42 | history | edited | BD107 | CC BY-SA 4.0 |
rename A --> H.
|
| Aug 13, 2021 at 1:36 | history | edited | BD107 | CC BY-SA 4.0 |
added 450 characters in body
|
| S Aug 12, 2021 at 23:59 | history | bounty started | BD107 | ||
| S Aug 12, 2021 at 23:59 | history | notice added | BD107 | Draw attention | |
| Aug 12, 2021 at 23:58 | history | edited | BD107 | CC BY-SA 4.0 |
add some detail; mention [MR78].
|
| Aug 12, 2021 at 23:50 | history | edited | BD107 | CC BY-SA 4.0 |
add some detail; mention [MR78].
|
| S Jun 7, 2021 at 21:24 | history | bounty ended | BD107 | ||
| S Jun 7, 2021 at 21:24 | history | notice removed | BD107 | ||
| Jun 2, 2021 at 17:17 | history | edited | BD107 | CC BY-SA 4.0 |
added an edit regarding Antoine Labelle's answer.
|
| Jun 2, 2021 at 2:46 | answer | added | Antoine Labelle | timeline score: 4 | |
| Jun 1, 2021 at 14:20 | comment | added | BD107 | @PeterTaylor thanks, tags added. | |
| Jun 1, 2021 at 14:20 | history | edited | BD107 |
added tags
|
|
| Jun 1, 2021 at 14:06 | comment | added | Peter Taylor | Another phrasing would be that we define the $j$th excluded affine hyperplane $E_j = \{ (x_0, x_1, \ldots, x_n) \mid x_{2j} + x_{2j+1} = 2 \}$ and then the question becomes: "If $A \cap \{0,1\}^n \cap (\cup E_j) = \emptyset$, how big can $A \cap \{0,1\}^n$ be?" There must surely be some geometry tag which is at least as good a fit for the question as nt.number-theory? | |
| May 31, 2021 at 14:08 | comment | added | BD107 | you are absolutely correct, clarified. thanks. | |
| May 31, 2021 at 14:08 | history | edited | BD107 | CC BY-SA 4.0 |
clarified function, as per Emil Jeřábek
|
| May 31, 2021 at 14:06 | comment | added | Emil Jeřábek | Can you clarify the definition of the function? The title suggests that the three dots should be filled as $(\overline{x_0}\lor\overline{x_1})\land(\overline{x_1}\lor\overline{x_2})\land(\overline{x_2}\lor\overline{x_3})\land(\overline{x_3}\lor\overline{x_4})\land\dots$ (which is also the most obvious reading), but then the numbers don’t work out. Based on the “dual formulation”, do you actually mean $(\overline{x_0}\lor\overline{x_1})\land(\overline{x_2}\lor\overline{x_3})\land(\overline{x_4}\lor\overline{x_5})\land(\overline{x_6}\lor\overline{x_7})\land\dots$? | |
| S May 31, 2021 at 13:48 | history | bounty started | BD107 | ||
| S May 31, 2021 at 13:48 | history | notice added | BD107 | Draw attention | |
| May 31, 2021 at 13:47 | history | edited | BD107 | CC BY-SA 4.0 |
restructured the problem to focus on fields, and be clearer.
|
| May 29, 2021 at 22:16 | comment | added | BD107 | it's an original problem; posed it myself, with some inspiration from a colleague as well. | |
| May 29, 2021 at 20:26 | comment | added | kodlu | Interesting. Do you have a reference from the literature or is the problem original? | |
| May 29, 2021 at 15:54 | history | edited | BD107 | CC BY-SA 4.0 |
another attempt to improve the title
|
| May 29, 2021 at 15:48 | history | edited | BD107 | CC BY-SA 4.0 |
change title to be more compact.
|
| May 29, 2021 at 3:13 | history | edited | BD107 | CC BY-SA 4.0 |
correct function notation
|
| May 29, 2021 at 2:51 | history | asked | BD107 | CC BY-SA 4.0 |