Combinatorial Designs: constructions, algorithms and new results
Interactive Parallel Computation in Support of Research in Algebra, Geometry and Number Theory
January 30,2007 02:00 PM to 02:30 PM
Speakers:
Kotsireas, Ilias
|
 |
Abstract: |
We plan to describe recent progress in the search for combinatorial designs of high order. This progress has been achieved via some algorithmic concepts, such as the periodic autocorrelation function, the discrete Fourier transform and the power spectral density criterion, in conjunction with heuristic observations on plausible patterns for the locations of zero elements. The discovery of such patterns is done using meta-programming and automatic code generation (and perhaps very soon data mining algorithms) and reveals the remarkable phenomenon of crystalization, which does not yet possess a satisfactory explanation. The resulting algorithms are amenable to parallelism and we have implemented them on supercomputers, typically as implicit parallel algorithms. |
|
|
