Computational Methods in Design Theory
Enumeration theory, which aims to count the number of distinct (non-equivalent) elements in a given class of combinatorial objects, constitutes a significant area in combinatorial analysis. The object of constructive enumeration consists of creating a complete list of configurations with given properties , . There are several reasons which stimulate research in constructive enumeration. Classical methods are not applicable to many interesting classes of objects such as strongly regular graphs, combinatorial designs, error correcting codes, etc. At present, the only available way to count them is by using algorithmic techniques for fixed values of parameters. Lists of objects are important for generating and testing various hypotheses about invariants, characterization, etc. Moreover, examples of designs with given properties are needed in many areas of applied combinatorics such as coding and experiment planning theories, network reliability and cryptography. Algorithms for constructive enumeration frequently require searching in high dimensional spaces and employ sophisticated techniques to identify partial (final) solutions. Such methods may be of independent interest in artificial intelligence, computer vision, neural networks and combinatorial optimization.
KeywordsLocal Search Automorphism Group Regular Graph Discrete Math Design Theory
Unable to display preview. Download preview PDF.
- M.J. Colbourn, Algorithmic aspects of combinatorial designs: A survey, Ann. Discrete Math. 26 (1985), 67–136.Google Scholar
- F.N.Cole, L.D. Cummings, H.S. White, Complete classification of the triad systems on fifteen elements, Memoirs of the National Academy of Sciences U.S.A. 14, Second memoir (1919), 1–89.Google Scholar
- P.B. Gibbons, Computing techniques for the construction and analysis of block designs, PhD Thesis, University of Toronto (1976).Google Scholar
- A.V. Ivanov, Constructive enumeration of incidence systems, Ann. Discrete Math. 26 (1985), 227–246.Google Scholar
- S.S. Magliveras, D.W. Leavitt, Simple 6-(33,8,36) Designs from PGL2(32), Proceedings of the Durham Computational Group Theory Symposium (Academic Press, 1983 ), 337–352.Google Scholar