The existence of resolvable BIBD with \(\lambda=1\) (Q1594861)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The existence of resolvable BIBD with \(\lambda=1\)
scientific article

    Statements

    The existence of resolvable BIBD with \(\lambda=1\) (English)
    0 references
    29 January 2001
    0 references
    A resolvable pairwise balanced design with fixed block size \(k\) is denoted by \(\text{RB}(v,k,\lambda)\). A well-known result, proved by Ray-Chaudhuri and Wilson for \(\lambda= 1\) and by \textit{J. Lu} [Acta Math. Sin. 27, 458-468 (1984; Zbl 0567.05011)] for arbitrary \(\lambda\), states that, given any positive integers \(k\) and \(\lambda\), there is an integer \(v(k,\lambda)\) such that the obvious necessary conditions for the existence of an \(\text{RB}(v,k,\lambda)\) are sufficient for all \(v> v(k,\lambda)\). However, there were no really concrete bounds on \(v(k,\lambda)\), not even for \(\lambda= 1\). The author proves that, for \(k\geq 3\) and \(\lambda= 1\), one can pick \(v(k,1)= \exp\{\exp\{k^{12k^2}\}\}\).
    0 references
    PBD-closed
    0 references
    resolvable BIBD
    0 references
    pairwise balanced design
    0 references
    0 references
    0 references

    Identifiers