South of England Computational and Algorithmic Number Theory Seminars
Lecture Theatre 2, School of Mathematics, University Walk, Bristol
Saturday 6 December 1997
Only the front door (that is on University Walk) will be open (the
back door will be closed and alarmed as in Oxford). Parking is
possible in University Walk but note it is one way with the Maths
building near the end, approach via Woodland Road (there are maps on
the University web
site). It is about 25 minute walk from Temple Meads Station (NOT
Parkway) or bus to Queen's Road. For lunch there are pubs and a
sandwich bar fairly close on St. Michael's Hill.
11.00-11.50 N. P. Smart (Hewlett-Packard)
"The Discrete Logarithm Problem"
12.00-12.50 J. E. Cremona (Exeter)
"Higher Descent on Elliptic Curves"
14.00-15.00 R. Schoof (Universita Tor Vergata, Rome)
"Computing class groups in towers of cyclotomic fields"
Abstract: We explain an algorithm to compute certain limits of class
groups in cyclotomic towers. It is based on computations with
cyclotomic units. As an application we verify Greenberg's
``$\lambda=0$''-conjecture in several cases.
15.15-16.05 J. F. McKee
"Pisot Numbers from Trees"
Back to the SECANTS programme page
Back to the SECANTS home page
Page maintained by Steven Galbraith