Yu Tsunoda, "Bounds for almost constant-weight disjunct matrices," 42nd Australasian Conference on Combinatorial Mathematics and Combinatorial Computing, Sydney, Australia, December 2019.
Yu Tsunoda, "Bounds for almost constant-weight disjunct matrices," 42nd Australasian Conference on Combinatorial Mathematics and Combinatorial Computing, Sydney, Australia, December 2019.
A d-disjunct matrix is a binary matrix in which the support of the boolean sum of any d columns does not contain the support of any other column. In combinatorial group testing, a disjunct matrix represents a nonadaptive algorithm by regarding its rows and columns as tests and items, respectively. For group testing to be effective, it is of special interest to determine the number of rows in a smallest d-disjunct matrix for given d and a given number of columns. In this talk, we derive bounds on the number of rows in a smallest d-disjunct matrix in which the row weights and column weights are both nearly constant by a probabilistic argument.
Slides from Yu Tsunoda's 42ACCMCC talk
The 42nd Australasian Conference on Combinatorial Mathematics and Combinatorial Computing ACCMCC was held at the University of New South Wales in Sydney, Australia, from December 9 to 13, 2019 [Conference website]. The travel was supported by Graduate School of Science and Engineering, Chiba University.