All Questions
Tagged with combinatorial-designs set-theory
3
questions
3
votes
1
answer
147
views
Cycling through a general combinatorial design on $\omega$
This is a generalisation of an older question inspired by a football tournament (which does not have an answer yet).
Let $\frak P$ be a partition of $\omega$ into blocks, that is, pairwise disjoint ...
- 44.5k
3
votes
1
answer
267
views
Lower bounding the maximum size of sets in a set family with union promise
The following problem has come up while working on the relationship between certificate and randomized decision tree complexities of boolean functions. However, I think it is of interest by itself and ...
1
vote
0
answers
48
views
Optimal choice of points to maximize majorities in a $t-(v,k,\lambda)$ design
Let us consider a design $\mathcal{D} = (V,\mathcal{B})$ with points in $V$ and blocks in $\mathcal{B}$. I am interested in the special case of a $t-(v,k,\lambda)$ design for $k=3$, i.e., all blocks ...
- 143