Timeline for Number of solutions of a linear equation in a small subset.
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 21, 2010 at 6:16 | comment | added | user3208 | In my question k is large. In fact, the case most interesting to me is when k = p. So the expectation of number of solutions is independent of t, I guess. Error term will be dependent on t of course. Qi | |
| Jun 21, 2010 at 4:29 | comment | added | Wadim Zudilin | But then I can't follow the claim about the expectation to be independent of $t$: take $A$ to be $\lbrace 0,1,\dots,s-1\rbrace$, so that only $t<ks$ can be expressed in the required form... By the way for this form of $A$ one can easily count the number of solutions. | |
| Jun 21, 2010 at 4:23 | comment | added | Ryan Williams | "$s$ is polylogarithmic in $p$" generally means $s = \Theta(\log^c p)$ for a fixed constant $c > 0$. | |
| Jun 21, 2010 at 4:19 | comment | added | Wadim Zudilin | I am a little be confused by your terminology: what does "$s$ polylogarithmic in $p$" mean? | |
| Jun 21, 2010 at 3:53 | history | asked | user3208 | CC BY-SA 2.5 |