Full metadata record
DC FieldValueLanguage
dc.contributor.authorZhang, Rucongen_US
dc.contributor.authorGe, Gennianen_US
dc.contributor.authorLing, Alan C. H.en_US
dc.contributor.authorFu, Hung-Linen_US
dc.contributor.authorMutoh, Yukiyasuen_US
dc.date.accessioned2014-12-08T15:10:16Z-
dc.date.available2014-12-08T15:10:16Z-
dc.date.issued2009en_US
dc.identifier.issn0895-4801en_US
dc.identifier.urihttp://hdl.handle.net/11536/7845-
dc.identifier.urihttp://dx.doi.org/10.1137/080737423en_US
dc.description.abstractFor a v-set V, let A be a collection of r x c arrays with elements in V. A pair (V, A) is called an r x c grid-block design if every two distinct elements i and j in V occur exactly once in the same row or in the same column of an array in A. This design originated from the use of DNA library screening. In this paper, we show the existence of r x 4 grid-block designs with r = 3, 4. We settle completely for the case of r = 4 and almost completely for the case of r = 3, leaving 15 orders undetermined.en_US
dc.language.isoen_USen_US
dc.subjectgrid-block designen_US
dc.subjectcomplete graphen_US
dc.subjectdecompositionen_US
dc.subjectCartesian producten_US
dc.titleTHE EXISTENCE OF r x 4 GRID-BLOCK DESIGNS WITH r=3, 4en_US
dc.typeArticleen_US
dc.identifier.doi10.1137/080737423en_US
dc.identifier.journalSIAM JOURNAL ON DISCRETE MATHEMATICSen_US
dc.citation.volume23en_US
dc.citation.issue2en_US
dc.citation.spage1045en_US
dc.citation.epage1062en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000267744700032-
dc.citation.woscount2-
Appears in Collections:Articles


Files in This Item:

  1. 000267744700032.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.