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

In this expository paper, we mainly study orthogonal arrays (OAs) of strengthtwo having a row that is repeated $m$ times. It turns out that thePlackett-Burman bound (\cite{PB}) can be strengthened by a factor of $m$ fororthogonal arrays of strength two that contain a row that is repeated $m$times. This is a consequence of a more general result due to Mukerjee, Qian andWu \cite{Muk} that applies to orthogonal arrays of arbitrary strength $t$.  We examine several proofs of the Plackett-Burman bound and discuss which ofthese proofs can be strengthened to yield the aforementioned bound for OAs ofstrength two with repeated rows. We also briefly discuss related bounds for$t$-designs, and OAs of strength $t$, when $t > 2$.

Bounds for orthogonal arrays with repeated rows