Published online by Cambridge University Press: 04 November 2009
Abstract
New algorithms are presented for finding spreads and packings of sets with applications to combinatorial designs and finite geometries. An efficient deterministic method for spread enumeration is used to settle several existence problems for t-designs and partial geometries. Randomized algorithms based on tabu search are employed to construct new Steiner 5-designs and large sets of combinatorial designs. In particular, partitions are found of the 4-subsets of a 16-set into 91 disjoint affine planes of order 4.
To save this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Find out more about the Kindle Personal Document Service.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.