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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
