Timeline for A variant of an Eventown problem for modulo a prime number
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 29, 2022 at 17:01 | answer | added | JIOOOOOOOOOOCb | timeline score: 5 | |
| Mar 15, 2014 at 2:18 | comment | added | Andrés E. Caicedo | @Lucia Yes, that's what I meant. The bounds seem to vary significantly depending on the $L$ under consideration. The Frankl-Wilson result and its extensions are very general, but the versions I know of focus on the size of $L$ rather than its specific elements. | |
| Mar 15, 2014 at 2:08 | comment | added | Lucia | @AndresCaicedo: I'm not sure I understand your comment. The problem at hand is a special case of the Frankl-Wilson theorem where intersections lying in any set $L$ are considered. So the Frankl-Wilson theorem gives the upper bound I stated (which is not too bad). Of course this upper bound is best possible in general, but not necessarily in this case (and I don't know what the correct result here should be). | |
| Mar 14, 2014 at 23:49 | comment | added | Andrés E. Caicedo | @Lucia Yes, and there are recent extensions by Grolmusz, but I have not seen these specific variants addressed. (I am not too familiar with the literature on the subject, though, so I may have missed obvious papers.) | |
| Mar 14, 2014 at 23:11 | comment | added | Lucia | There are results in this direction known as the nonuniform Ray Chaudhuri--Wilson theorem (proved by Frankl and Wilson extending work of Ray Chaudhuri and Wilson). This produces an upper bound of $\sum_{s\le n/p} \binom{n}{s}$, which is a step in the direction you want... . | |
| Mar 14, 2014 at 22:58 | comment | added | Andrés E. Caicedo | I've been looking for references as well. Similarly, do you know of any references for the mod n version of Oddtown? | |
| Mar 14, 2014 at 22:49 | history | asked | Spai | CC BY-SA 3.0 |