Please use this identifier to cite or link to this item: https://ah.lib.nccu.edu.tw/handle/140.119/88743
DC FieldValueLanguage
dc.contributor.advisor陳永秋zh_TW
dc.contributor.advisorE. T. Tanen_US
dc.contributor.author鄭斯恩zh_TW
dc.contributor.authorCheng, Szu Enen_US
dc.creator鄭斯恩zh_TW
dc.creatorCheng, Szu Enen_US
dc.date1993en_US
dc.date.accessioned2016-04-29T08:32:35Z-
dc.date.available2016-04-29T08:32:35Z-
dc.date.issued2016-04-29T08:32:35Z-
dc.identifierB2002004241en_US
dc.identifier.urihttp://nccur.lib.nccu.edu.tw/handle/140.119/88743-
dc.description碩士zh_TW
dc.description國立政治大學zh_TW
dc.description應用數學系zh_TW
dc.description80155011zh_TW
dc.description.abstract在本篇論文中我們使用矩陣來建構可分組設計(GDD), 我們列出了兩種型zh_TW
dc.description.abstractIn this thesis we use matrices to construct group divisibleen_US
dc.description.tableofcontentsAbstract ii\r\n0 Introduction 1\r\n1 Preliminaries 4\r\n 1.1 BIBD and PBIBD................................................................................................5\r\n 1.1.1 BIBD............................................................................................................5\r\n 1.1.2 PBIBD..........................................................................................................7\r\n 1.2 GDO.....................................................................................................................8\r\n 1.3 Storngly regular graphs(SRG)............................................................................13\r\n 1.4 Hadamard matrix................................................................................................15\r\n2 Main Results 21\r\n 2.1 Type I : Construction of regular GDDs...............................................................21\r\n 2.2 Type II : Constructions of semi-regular and regular GDDs................................29\r\n3 Examples 37\r\n 3.1 Type I : Regular GDDs...........................................................................................37\r\n 3.2 Type II : Semi-regular and regular GDDs...............................................................40\r\n4 Discussion 44\r\nA Table of GDDs with r—λ1=1 46\r\nB Table of BIBDs with b=4(r-λ) 52zh_TW
dc.source.urihttp://thesis.lib.nccu.edu.tw/record/#B2002004241en_US
dc.subject可分組設計zh_TW
dc.subject強則圖zh_TW
dc.subject斜對稱Hadamard 矩陣zh_TW
dc.subjectgroup divisible designen_US
dc.subjectstrongly regular graphen_US
dc.subjectskew-symmetric Hadamard matrixen_US
dc.title一些可分組設計的矩陣建構zh_TW
dc.titleSome Matrix Constructions of Group Divisible Designsen_US
dc.typethesisen_US
dc.relation.reference[1] K. T. Arasu , D. Jungnickel and A. Pott. Symmetric divisible design with k – λ1=1. Discrete Math. , 97:25-38, 1991.\r\n[2] K. T. Arasu and A. Pott. Some constructions of group divisible designs with singer groups. Discrete Math. , 97:39-45, 1991.\r\n[3] K. T. Arasu, W. H. Haemers , D. Jungnickel and A. Pott. Matrix constructions for divisible designs. Linear Algebra appl. , 153:123-133, 1991.\r\n[4] T. Beth, D. Jungnickel and H. Lenz. Design Theory. Cambridge ,Univ., Cam-bridge, 1986.\r\n[5] R. C. Bose and W. S. Connor. Combinational properties of group divisible incomplete block design. Ann. Math. Stat. , 23:367-383, 1952.\r\n[6] A.E. Brouwer and J.H. Van Lint. Strongly regular graphs and partial geometries. In D. M. Jackson and S. A. Vanstone, editors, Enumeration and Design, pages 475-478. Academic, New York, 1988.\r\n[7] W. S. onnor. Some relations among the blocks of symmetric group divisible design. Ann. Math. Stat. , 23:602-609, 1952.\r\n[8] W. H. Haemers. Divisible design with r –λ1=1. J. Comb. Theo, Series A, 57:316-319, 1991.\r\n\r\n[9] M. Jr. Hall. Combinatorial Theory. A Wiley-Interscience publication., New York, 1986.\r\n[10] A. Hedayat and W. D. Wallis. Hadamard matrices and theeir applications. Ann. Stat. , 6:1184-1238, 1978.\r\n[11] S. Kageyama and T. Tanaka. Some families of group divisible designs. J. Stat. Plann. Interference, 5:231-241, 1981.\r\n[12] Z.W. Liu and H.J. Xiao. Construction of group divisible designs by nsing Hadamard matrices. In K. Matusita, editor, Statistical Theory and Data Analysis II, Page 475-478. Elsevier Science Publishers B.V., North-Holland 1988.\r\n[13] J. S. Parihar and R. Shrivastaa. Methods of constuction of group divisible designs. J. Stst. Plann. Inference, 18:399-404, 1988.\r\n[14] D. Raghavarao.Constructions and Combinatorial Problems in Design of Exper-iments. Wiley, New York, 1971.\r\n[15] S. S. Shrikhande. On a two parameter family of balanced incomplete block designs. Sankya, 24:33-40, 1962.\r\n[16] A. P. Street and D. J. Street. Combinatorics of Experimental Design. Oxford Univ., New York, 1987.\r\n[17] D. J. Street. Some constructions for PBIBDs. J. Stst. Plann. Inference, 10:119-129, 1984.zh_TW
item.grantfulltextopen-
item.fulltextWith Fulltext-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_46ec-
item.openairetypethesis-
Appears in Collections:學位論文
Files in This Item:
File SizeFormat
index.html115 BHTML2View/Open
Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.