Full metadata record
DC FieldValueLanguage
dc.contributor.authorHuang, Hau-wenen_US
dc.contributor.authorHuang, Yu-peien_US
dc.contributor.authorWeng, Chih-wenen_US
dc.date.accessioned2014-12-08T15:10:30Z-
dc.date.available2014-12-08T15:10:30Z-
dc.date.issued2008-12-28en_US
dc.identifier.issn0012-365Xen_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.disc.2007.11.073en_US
dc.identifier.urihttp://hdl.handle.net/11536/8014-
dc.description.abstractA 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 IT. 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 Erdos, Frankl and Furedi. (c) 2007 Elsevier B.V. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectPooling spacesen_US
dc.subjectPooling designsen_US
dc.subjectRanked posetsen_US
dc.subjectAtomicen_US
dc.subjectGeometric latticesen_US
dc.subjectAffine geometriesen_US
dc.titleMore on pooling spacesen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.disc.2007.11.073en_US
dc.identifier.journalDISCRETE MATHEMATICSen_US
dc.citation.volume308en_US
dc.citation.issue24en_US
dc.citation.spage6330en_US
dc.citation.epage6338en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000261259100042-
dc.citation.woscount5-
Appears in Collections:Articles


Files in This Item:

  1. 000261259100042.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.