In physics or literature they have the Nobel Prize, and in mathematics there is the "Fields Medal". This highest scientific award for mathematicians was presented today at the opening ceremony of the "International Congress of Mathematicians" to Richard E. Borcherds, Maxim Kontsevich, William Timothy Gowers and Curtis T. McMullen. The International Mathematical Union also awarded the "Nevanlinna Prize" for outstanding work in the field of theoretical computer science to the mathematician Peter Shor.
The Fields Medal is the highest scientific award for mathematicians. The awards are presented every four years at the International Congress of Mathematicians (ICM) together with a prize of 15 000 Canadian dollars (approx. DM 17 500). Four medals are presented at each ceremony to mathematicians who are not more than forty years old. The age limit is intended to guarantee that not only past work is rewarded. The Fields Medal is also intended to encourage the winners to make further contributions.
"Fields Medal" is in fact only the unofficial name for the "International medal for outstanding discoveries in mathematics". John C. Fields (1863 - 1932), a Canadian mathematician, was the organiser of the International Congress of Mathematicians in 1924 in Toronto. Fields was able to attract so many sponsors that money was left over at the end of the congress, and this was used to fund the medals. The first Fields Medal was awarded in 1936 at the world congress in Oslo. Due to the great expansion in mathematical research, four medals have been presented at each congress since 1966. The awards are often referred to as the "Nobel Prize for Mathematics", since the Swedish Academy of Sciences itself can only honour mathematicians indirectly through the natural sciences or social sciences. There is no Nobel Prize for mathematics.
The Fields Medal is made of gold, and shows the head of Archimedes (287 - 212 BC) together with a quotation attributed to him: "Transire suum pectus mundoque potiri" (Rise above oneself and grasp the world"). The reverse side bears the inscription: "Congregati ex toto orbe mathematici ob scripta insignia tribuere." (The mathematicians assembled here from all over the world pay tribute for outstanding work).
The only German to have received the Fields Medal to date is Gerd Faltings, professor at the Max-Planck Institute of Mathematics in Bonn. He was honoured in 1986 for his proof of the Mordell Conjecture and his work in algebraic geometry.
The Nevanlinna Prize has been awarded since 1983 for outstanding work in the fields of theoretical computer science. The prize is also in the form of a gold medal and a cash award of 15 000 Canadian dollars (DM 17 500). It is donated by the University of Helsinki in memory of the Finnish mathematician Rolf Nevanlinna, who was president of the International Mathematical Union 1959 - 1962 and organiser of the World Congress in Stockholm in 1962. One side of the medal shows the bust of Nevanlinna, and the other bears the seal of Helsinki University and a rectangle of noughts and ones. The word "Helsinki" in coded form.
In order to select the winners of the Fields Medals and the Nevanlinna Prize, the Executive Committee of the International Mathematical Union appoints two bodies, the "Fields Medal Committee" (in this form since 1962) consisting of eight mathematicians, and the "Nevanlinna Prize Committee" with three mathematicians.
The Moonshine conjecture provides an interrelationship between the so-called "monster-groups" and elliptical functions. These functions are used in the construction of wire-frame structures in two-dimensions, and can be helpful, for example, in chemistry for the description of molecular structures. Monster groups, in contrast, only seemed to be of importance in pure mathematicians. Groups are mathematical objects which can be used to describe the symmetry of structures. Expressed technically, they are a set of objects for which certain arithmetic rules apply (for example all whole numbers and their sums form a group). An important theorem of algebra says that all groups, however large and complicated they may seem, all consist of the same components - in the same way as the material world is made up of atomic particles. The "monster group" is the largest "sporadic, finite, simple" group - and one of the most bizarre objects in algebra. It has more elements than there are elementary particles in the universe (approx. 8 x 10^53). Hence the name "monster". In his proof, Borcherds uses many ideas of string theory - a surprisingly fruitful way a making theoretical physics useful for mathematical theory. Although still the subject of dispute among physicists, strings offer a way of explaining many of the puzzles surrounding the origins of the universe. They were proposed in the search for a single consistent theory which brings together various partial theories of cosmology. Strings have a length but no other dimension and may be open strings or closed loops.
Richard Ewen Borcherds (born 29 November 1959) has been
"Royal Society Research Professor" at the Department
of Pure Mathematics and Mathematical Statistics at Cambridge University
since 1996. Borcherds began his academic career at Trinity College,
Cambridge before going as assistant professor to the University
of California in Berkeley. He has been made a Fellow of the Royal
Society, and has also held a professorship at Berkeley since 1993.
microcosm (forces between elementary particles). Another result
of Kontsevich relates to knot theory. Knots mean exactly the same
thing for mathematicians as for everyone else, except that the
two ends of the rope are always jointed together. A key question
in knot theory is, which of the various knots are equivalent?
Or in other words, which knots can be twisted and turned to produce
another knot without the use of scissors? This question was raised
at the beginning of the 20th century, but it is still unanswered.
It is not even clear which knots can be undone, that is converted
to a simple loop. Mathematicians are looking for ways of classifying
all knots. They would be assigned a number or function, with equivalent
knots having the same number. Knots which are not equivalent must
have different numbers. However, such a characterisation of knots
has not yet been achieved. Kontsevich has found the best "knot
invariant" so far. Although knot theory is part of pure mathematics,
there seem to be scientific applications. Knot structures occur
in cosmology, statistical mechanics and genetics.
Maxim Kontsevich (born 25 August 1964) is professor at
the Institute des Hautes Etudes Scientific (I.H.E.S) in France
and visiting professor at the Rutgers University in New Brunswick
(USA). After studying at the Moscow University and beginning research
at the "Institute for Problems of Information Processing",
he gained a doctorate at the University of Bonn, Germany in 1992.
He then received invitations to Harvard, Princeton, Berkeley and
Bonn.
William Timothy Gowers (born 20 November 1963) is lecturer
at the Department of Pure Mathematics and Mathematical Statistics
at Cambridge University and Fellow of Trinity College. From October
1998 he will be Rouse Professor of Mathematics. After studying
through to doctorate level at Cambridge, Gowers went to University
College London in 1991, staying until the end of 1995. In 1996
he received the Prize of the European Mathematical Society.
Curtis T. McMullen (born 21 May 1958) is visiting professor
at Harvard University. He studied in Williamstown, Cambridge University
and Paris before gaining a doctorate in 1985 at Harvard. He lectured
at various universities before becoming professor at the University
of California in Berkeley. Since 1998 he has taught at Harvard.
The Fields Medal is his tenth major award. In 1998 he has been
elected to the American Academy of Arts and Sciences.
computer would be just as fast as multiplication. "RSA"
and other procedures would no longer be safe. Experts have been
making reassuring noises, since a lot of work remains to be done
before such computers can even be constructed, but cryptographers
are already working on the next generation of encryption techniques.
Peter Shor (born 14 August 1959) is mathematician at the
AT&T Labs in Florham Park, New Jersey (USA). His research
interests include quantum computing, algorithmic geometry, and
combinatorial analysis. After studying at California Institute
of Technology (Caltech) he gained a doctorate at Massachusetts
Institute of Technology (MIT). Before going to AT&T in 1986,
he was postdoc for a year at the Mathematical Research Center
in Berkeley, California (USA).
Maxim Kontsevich
Maxim Kontsevich has established a reputation in pure mathematics
and theoretical physics, with influential ideas and deep insights.
He has been influenced by the work of Richard Feynmann and Edward
Witten. Kontsevich is an expert in the so-called "string
theory" and quantum field theory. He made his name with contributions
to four problems of geometry. He was able to prove a conjecture
of Witten and demonstrate the mathematical equivalence of two
models of so-called quantum gravitation. The quantum theory of
gravity is an intermediate step towards a complete unified theory.
It harmonises physical theories of the macrocosm (mass attraction)
and the
William Timothy Gowers
William Timothy Gowers has provided important contributions to
functional analysis, making extensive use of methods from combination
theory. These two fields apparently have little to do with each
other, and a significant achievement of Gowers has been to combine
these fruitfully. Functional analysis and combination analysis
have in common that many of their problems are relatively easy
to formulate, but extremely difficult to solve. Gowers has been
able to utilise complicated mathematical constructions to prove
some of the conjectures of the Polish mathematician Stefan Banach
(1892-1945), including the problem of "unconditional bases".
Banach was an eccentric, preferring to spend his time in the café
rather than in his office in the University of Lvov. In the twenties
and thirties he filled a notebook with problems of functional
analysis while sitting in the "Scottish Café",
so that this later became known as the Scottish Book. Gower has
made significant contribution above all to the theory of Banach
spaces. Banach spaces are sets whose members are not numbers but
complicated mathematical objects such as functions or operators.
However, in a Banach space it is possible to manipulate these
objects like numbers. This finds applications, for example, in
quantum physics. A key question for mathematicians and physicists
concerns the inner structure of these spaces, and what symmetry
they show. Gowers has been able to construct a Banach space which
has almost no symmetry. This construction has since served as
a suitable counter-example for many conjectures in functional
analysis, including the hyperplane problem and the Schröder-Bernstein
problem for Banach spaces. Gowers' contribution also opened the
way to the solution of one of the most famous problems in functional
analysis, the so-called "homogeneous space problem".
A year ago, Gowers attracted attention in the field of combination
analysis when he delivered a new proof for a theorem of the mathematician
Emre Szemeredi which is shorter and more elegant than the original
line of argument. Such a feat requires extremely deep mathematical
understanding.
Curtis T. McMullen
Curtis T. McMullen is being awarded a medal primarily in recognition
of his work in the fields of geometry and "complex dynamics",
a branch of the theory of dynamic systems, better known perhaps
as chaos theory. McMullen has made contributions in numerous fields
of mathematics and fringe areas. He already provided one important
result in his doctoral thesis. The question was how to calculate
all the solutions of an arbitrary equation. For simple equations
it is possible to obtain the solutions by simple rearrangement.
For most equations, however it is necessary to use approximation.
One well-known form is the "Newton method" - already
known in a rudimentary form in ancient times. For second-degree
polynomials this provides very good results without exception.
A key question therefore was whether a comparable method - which
happened not to have been discovered - also existed for equations
of higher degrees. Curtis T. McCullen's conclusion was that there
is definitely no such universal algorithm for equations above
degree three; only a partially applicable method is possible.
For degree-three equations he developed a "new" Newtonian
method and could thus completely solve the question of approximation
solutions. A further result of McMullen relates to the Mandelbrot
set. This set describes dynamic systems which can be used to model
complicated natural phenomena such as weather or fluid flow. The
point of interest is where a system drifts apart and which points
move towards centres of equilibrium. The border between these
two extremes is the so-called Julia set, named after the French
mathematician Gaston Julia, who laid the foundations for the theory
of dynamic systems early in the twentieth century. The Mandelbrot
set shows the parameters for which the Julia set is connected,
i.e. is mathematically attractive. This description is very crude,
but a better characterisation of the boundary set was not available.
Curtis T. McMullen made a major advance, however, when he showed
that it is possible to decide in part on the basis of the Mandelbrot
set which associated dynamic system is "hyperbolic"
and can therefore be described in more detail. For these systems
a well-developed theory is available. McMullen's results were
suspected already in the sixties, but nobody had previously been
able to prove this exact characterisation of the Julia set.
The Nevanlinna Prize is awarded to:
Peter Shor
Peter Shor has carried out pioneering work in combination analysis
and the theory of quantum computing. He received worldwide recognition
in 1994 when he presented a computational method for "factorising
large numbers" which, theoretically, could be used to break
many of the coding systems currently employed. The drawback is
that Shor's algorithm works on so-called quantum computers, of
which only prototypes currently exist. Quantum computers do not
operate like conventional ones, but make use of the quantum states
of atoms, which offers a computing capacity far in excess of current
parallel supercomputers. Shor's result unleashed a boom in research
amongst physicists and computer scientists. Experts predict that
quantum computers could already become a reality within the next
decade, but this rapid development is also a cause of concern
for some observers. Shor has been able to prove mathematically
that the new computers would mean that current standard encrypting
methods such as "RSA", which are used for electronic
cash and on-line signatures would no longer be secure. "RSA"
was developed in 1977 by the mathematicians Ronald Rivest, Adi
Shamir and Leonard Adelmann (hence the acronym). It makes use
of the fact that factorising a number is a so-called one-way function.
This means that while it is very easy to make a large number from
smaller ones, it is takes much longer to find all the factors
of a large number. This time factor is the basis for the security
offered by many encryption methods. Using Shor's algorithms, factorising
large numbers on a quantum
For enquiries concerning media work please contact: Vasco Alexander
Schmidt, Tel + 030 851 84 93, or Janny Glaesmer Press and Public
Relations office, TU Berlin Tel: +49 30 314-24026 or - 23922,
E-Mail: pressestelle@tu-berlin.de.