Pooling spaces associated with finite geometry

Tayuan Huang*, Kaishun Wang, Chih-wen Weng

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

11 Scopus citations


Motivated by the works of Ngo and Du [H. Ngo, D. Du, A survey on combinatorial group testing algorithms with applications to DNA library screening, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 55 (2000) 171-182], the notion of pooling spaces was introduced [T. Huang, C. Weng, Pooling spaces and non-adaptive pooling designs, Discrete Mathematics 282 (2004) 163-169] for a systematic way of constructing pooling designs; note that geometric lattices are among pooling spaces. This paper attempts to draw possible connections from finite geometry and distance regular graphs to pooling spaces: including the projective spaces, the affine spaces, the attenuated spaces, and a few families of geometric lattices associated with the orbits of subspaces under finite classical groups, and associated with d-bounded distance-regular graphs.

Original languageEnglish
Pages (from-to)1483-1491
Number of pages9
JournalEuropean Journal of Combinatorics
Issue number6
StatePublished - Aug 2008


Dive into the research topics of 'Pooling spaces associated with finite geometry'. Together they form a unique fingerprint.

Cite this