Let $[d]$ be a universe and $S_1, \dots, S_m$ be an $(\ell, a)$-design over $[d]$ which means that:
1. $\forall i \in [m], S_i \subseteq [d], |S_i|=\ell$.
2. $\forall i \neq j \in [m]$, $|S_i \cap S_j| \le a$.
For example, it is known that such designs exist for $a = \log m$, $\ell = C\log m$ and $d = O(C^2\log m)$. I am interested (in general) in such kind of settings of parameters: where you can generate a large number ($m$ in total) of small sets (each of size $O(\log m)$) over a small universe ($O(\log m)$ items in total), and with a small pairwise intersection ($\log m$).
My question concerns with the behavior of intersections. Specifically, fix any $S_t$ in the system to consider. Consider the sets before it, $S_1,\dots,S_{t-1}$. Start with $S_1$ and find the maximal $i$ such that $|\left(\bigcup_{j=1}^i S_j\right) \cap S_t| \le a$. Let $S_1,\dots,S_i$ be the first chunk you find. Then you repeat this process starting at $S_{i+1}$ (find the second chunk). Let the total number of chunks you identify this way be $k$ (so $k$ is in general a function of $t$ and the set system).
Now, do we know anything about upper bounding $k$? (over all choices of $t$, say). The intuition is that, at least on average, it should not be the case that $k$ can always reach ${\ell \choose a}$. Do we know anything about constructing an $(\ell, a)$-design (with the above settings of parameters in general) so that one can bound $k$ in the worst-case?
{"ft_lang_label":"__label__en","ft_lang_prob":0.82610476,"math_prob":0.99988735,"size":1482,"snap":"2020-34-2020-40","text_gpt3_token_len":452,"char_repetition_ratio":0.09133965,"word_repetition_ratio":0.0,"special_character_ratio":0.32321188,"punctuation_ratio":0.11949685,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99999714,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-08-15T21:28:44Z\",\"WARC-Record-ID\":\"<urn:uuid:43858e20-c823-4a5b-b29e-5fd0eaa61405>\",\"Content-Length\":\"136079\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2b6c7a0b-73d9-460e-9296-bf7377f8a540>\",\"WARC-Concurrent-To\":\"<urn:uuid:368d0bd8-2e37-409a-b419-b165524c3cf5>\",\"WARC-IP-Address\":\"151.101.129.69\",\"WARC-Target-URI\":\"https://cstheory.stackexchange.com/questions/32079/a-question-about-combinatorial-design-in-nisan-wigderson-generator\",\"WARC-Payload-Digest\":\"sha1:GM67JLNXZPZYRWELQPYVPCVPVZEOKMMC\",\"WARC-Block-Digest\":\"sha1:ACZETRD7T2RHKWRJZIT5P4373WOOIFLK\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-34/CC-MAIN-2020-34_segments_1596439741154.98_warc_CC-MAIN-20200815184756-20200815214756-00499.warc.gz\"}"}