THE EXISTENCE OF r x 4 GRID-BLOCK DESIGNS WITH r=3, 4

doi:10.1137/080737423

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Zhang, Rucong	en_US
dc.contributor.author	Ge, Gennian	en_US
dc.contributor.author	Ling, Alan C. H.	en_US
dc.contributor.author	Fu, Hung-Lin	en_US
dc.contributor.author	Mutoh, Yukiyasu	en_US
dc.date.accessioned	2014-12-08T15:10:16Z	-
dc.date.available	2014-12-08T15:10:16Z	-
dc.date.issued	2009	en_US
dc.identifier.issn	0895-4801	en_US
dc.identifier.uri	http://hdl.handle.net/11536/7845	-
dc.identifier.uri	http://dx.doi.org/10.1137/080737423	en_US
dc.description.abstract	For 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.iso	en_US	en_US
dc.subject	grid-block design	en_US
dc.subject	complete graph	en_US
dc.subject	decomposition	en_US
dc.subject	Cartesian product	en_US
dc.title	THE EXISTENCE OF r x 4 GRID-BLOCK DESIGNS WITH r=3, 4	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1137/080737423	en_US
dc.identifier.journal	SIAM JOURNAL ON DISCRETE MATHEMATICS	en_US
dc.citation.volume	23	en_US
dc.citation.issue	2	en_US
dc.citation.spage	1045	en_US
dc.citation.epage	1062	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000267744700032	-
dc.citation.woscount	2	-
顯示於類別：	期刊論文

文件中的檔案：

000267744700032.pdf

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。