Timeline for Low rate c-uniform pairwise intersecting set systems
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 21, 2011 at 0:48 | history | edited | Gerhard Paseman | CC BY-SA 3.0 |
corrected product assertion; deleted 6 characters in body; added 16 characters in body
|
| May 20, 2011 at 23:24 | comment | added | Gerhard Paseman | You're right, that needs fixing. (I was thinking of more general ISS which did not have uniform sizes, but had sets no smaller than c in size. However, even for these, it is similarly clear that the rank function is bounded below by $1/c$.) I'll edit it when I get to a real keyboard. Gerhard "Smart Phones Don't Feel Smart" Paseman, 2011.05.20 | |
| May 20, 2011 at 21:38 | comment | added | TMM | "Note also that if there is a c-uniform set system with f(c) < (1- epsilon)/c, the epsilon can be magnified by taking a cartesian power. This is a reason (but not a proof) for me to suspect that the lower bound across all c-uniform set systems for f(c) is 1/c." -- Are you saying that you suspect that $f(c) \geq 1/c$ for all $c$? Because that is trivial, as I showed in the main text (take $U \in \mathcal{S}\ldots$). | |
| May 20, 2011 at 19:59 | history | answered | Gerhard Paseman | CC BY-SA 3.0 |