Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Generalized t-designs, which form a common generalization of objects such as t-designs, resolvable designs and orthogonal arrays, re dened by Cameron [P.J. Cameron, A generalisation of t-designs, Discrete Math. 309 (2009), 4835{4842]. ,  dene a related class of combinatorial designs which simultaneously generalize packing designs and packing arrays.  describe the sometimes surprising connections which these generalized designs have with various known classes of combinatorial designs, including Holl designs, partial Latin squares and several classes of triple systems, and also concepts such as resolvability and block colouring of ordinary designs and packings, and orthogonal resolutions and colourings. Moreover,  derive bounds on the size of a generalized packing design and construct optimal generalized packings in certain cases. In particular,  provide methods for constructing maximum generalized packings with t = 2 and block size k = 3 or 4.
['Robert F. Bailey', 'Andrea C. Burgess']
I am writing a research paper on a idea Generalized packing designs
[{"from": "human", "value": "I am writing a research paper on a idea Generalized packing designs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Generalized t-designs, which form a common generalization of objects such as t-designs, resolvable designs and orthogonal arrays, re dened by Cameron [P.J. Cameron, A generalisation of t-designs, Discrete Math. 309 (2009), 4835{4842]. ,  dene a related class of combinatorial designs which simultaneously generalize packing designs and packing arrays.  describe the sometimes surprising connections which these generalized designs have with various known classes of combinatorial designs, including Holl designs, partial Latin squares and several classes of triple systems, and also concepts such as resolvability and block colouring of ordinary designs and packings, and orthogonal resolutions and colourings. Moreover,  derive bounds on the size of a generalized packing design and construct optimal generalized packings in certain cases. In particular,  provide methods for constructing maximum generalized packings with t = 2 and block size k = 3 or 4."}]