English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Bose proved the inequality $b\geq v+r-1$ for resolvable balanced incompleteblock designs (RBIBDs) and Kageyama improved it for RBIBDs which are not affineresolvable. In this note we prove a new lower bound on the number of blocks $b$that holds for all BIBDs. We further prove that for a significantly largenumber of BIBDs our bound is tighter than the bounds given by the inequalitiesof Bose and Kageyama.

New lower bounds for the number of blocks in balanced incomplete block designs