## Abstract

A pooling space is a ranked poset P such that the subposet w^{+} induced by the elements above w is atomic for each element w of P. Pooling spaces were introduced in [T. Huang, C. Weng, Pooling spaces and non-adaptive pooling designs, Discrete Math. 282 (2004) 163-169] for the purpose of giving a uniform way to construct pooling designs, which have applications to the screening of DNA sequences. Many examples of pooling spaces were given in that paper. In this paper, we clarify a few things about the definition of pooling spaces. Then we find that a geometric lattice, a well-studied structure in literature, is also a pooling space. This provides us many classes of pooling designs, some old and some new. We study the pooling designs constructed from affine geometries. We find that some of them meet the optimal bounds related to a conjecture of Erdös, Frankl and Füredi.

Original language | English |
---|---|

Pages (from-to) | 6330-6338 |

Number of pages | 9 |

Journal | Discrete Mathematics |

Volume | 308 |

Issue number | 24 |

DOIs | |

State | Published - 28 Dec 2008 |

## Keywords

- Affine geometries
- Atomic
- Geometric lattices
- Pooling designs
- Pooling spaces
- Ranked posets