| Title: | Mathematics at DEC |
| Moderator: | RUSURE::EDP |
| Created: | Mon Feb 03 1986 |
| Last Modified: | Fri Jun 06 1997 |
| Last Successful Update: | Fri Jun 06 1997 |
| Number of topics: | 2083 |
| Total number of notes: | 14613 |
From: MVPS::DECWRL::"[email protected]"
"Ken Baclawski 19-Apr-89 2102 D"
The College of Computer Science
of
Northeastern University
presents
Professor Clement Lam
Computer Science Department
Concordia University
Montreal, Quebec
Canada
who will speak on
Computational Aspects of the Search
for a Finite Projective Plane
of Order 10
107 Cullinane Hall
Thursday, April 27, 1989 at 3:00 PM
Refreshments will be served after the talk
The possible existence of a finite projective plane of order 10 is one of the
most famous problem in combinatorial mathematics. This problem was recently
settled after thousands of hours of computing on a CRAY-1. This talk will
present some of the computational methods used in the search. It will be
roughly organized as follows:
1. Introduction - What is a finite projective plane?
2. Backtracking - The basic principle behind the search.
3. Estimation - Controlling the computing resources required.
4. Bit Vectors - Doing backtracking on a vector computer.
5. Symmetry - Reduction of the required computing time.
6. Correctness - Can we trust a computer based "proof"?
| T.R | Title | User | Personal Name | Date | Lines |
|---|---|---|---|---|---|
| 1063.1 | hmmm | HERON::BUCHANAN | Andrew @vbo DTN 828-5805 | Mon Apr 24 1989 06:30 | 5 |
I'm very interested in this. If an electronic version of this talk exists, I'd be a keen reader. Cheers, Andrew. | |||||