昨天跑去翁志文老師的 Seminar 報告了這篇 Families of finite sets in which no set is cover by the union of p-1 others，有得到一些 comment。
- 可以去閱讀關於 Difference set 的文章。
- 我們在乎的是 p 不是質數的情況。
- 把相同的部份抽離出來，這樣會把架構看得更清楚。
- 這個架構是 p 個元素，n 個子集，任選 d 個子集都不會包住其他沒選的子集。當固定 d 時, p 可以是接近
標籤文章彙整：COMBINATORIAL DESIGN
Families of finite sets in which no set is cover by the union of p-1 others
標題是參考自 Families of finite sets in which no set is covered by the union of r others 。
我做的事情如下：
Let
be a prime number,
. Given a set
of
elements, there exists
distinct subsets of
, we have
.
至於這東西(原文內容)是不是 well-known 我就不得而知了。 8)
