Nonexistence Results for Tight Block Designs

Peter Dukes, Jesse Short-Gershman

Recall that combinatorial $2s$-designs admit a classical lower bound $b\ge \left(\genfrac{}{}{0ex}{}{v}{s}\right)$ on their number of blocks, and that a design meeting this bound is called tight. A long-st…