Slashdot Mirror


Fields Medals awarded

prostoalex writes "Every four years the Fields Medals are awarded to top mathematicians for outstanding research. This year's winners, as this San Francisco Chronicle article reports are Vladimir Voevodsky from Institute for Advanced Study and Laurent Lafforgue from Institut des Hautes Etudes Scientifiques. 'True to form, Lafforgue and Voevodsky's mathematical research has no known practical applications', notes SF Chronicle."

13 of 132 comments (clear)

  1. Madhu Sudan's homepage by jukal · · Score: 5, Informative

    the "error-correcting-guy" has his homepage here, his papers are here. Really interesting stuff. But what can you expect from a guy whose hairstyle has similarities to Einstein's :)

  2. here's a link with ACTUAL INFORMATION by khuber · · Score: 5, Informative
    That SFC article is crap.

    fields 2002

    -Kevin

  3. Re:This guy is really gifted by Anonymous Coward · · Score: 1, Informative

    You have to be under 40 to get this particular award.

  4. No practical use by PhilHibbs · · Score: 3, Informative
    'True to form, Lafforgue and Voevodsky's mathematical research has no known practical applications',
    That's what George Boole said about his own invention, Boolean Algebra. Pure mathematical research will usually pay off eventually.
  5. No practical applications? by jfedor · · Score: 5, Informative

    Yeah, that's what G. H. Hardy said about number theory back in 1940 (in A Mathematician's Apology). :)

    -jfedor

  6. Arrrgh by platypus · · Score: 5, Informative

    As a (former) mathematician, I sometimes wish people wouldn't try to explain mathematical things in laymans terms:

    "His study is related to topology, the mathematical science of shapes. Among other things, topologists study how one shape can be changed into another shape -- say, a doughnut into a coffee cup -- without removing the one feature they have in common -- the hole in the doughnut and the hole in the cup's handle"

    First, this sounds soo cheesy, and second, this is _not_ what topology is about (the "how" doesn't normally matter, the question is "if").
    I can see people imagining mathematicians sitting in the offices with a big pile of knead and trying to form proper coffee cup handles out of doughnuts.

    1. Re:Arrrgh by Anonymous Coward · · Score: 1, Informative

      Actually I believe the Poincaré conjecture has been proven now. There was a post on slashdot about 6 months ago regarding it. At least some guy had a possible solution to it anyway. I believe they said the timeline to determining if it was a full and complete proof was about 2 years before the clay institutue would cough up the prize.

      Hey finanly another person like me ( applied mathematician ). I genenerally understand basically nothing that these people talk about: Group theory, Topology, Rings & Knots, Galiol whatevers, etc... thoguh being a canadian I am quite familiar with donuts ;)

  7. Langlands Program by euroderph · · Score: 2, Informative

    Lafforgue's work is about the Langlands program, but it's extremely difficult to find info about it on the Web. Can anyone provide pointers?

    1. Re:Langlands Program by sympleko · · Score: 4, Informative

      Here is an expository article from the Journal of the AMS about the Langlands program. Results of Lafforgue are used to prove some very nice theorems.

      Here is a link to an article by Lafforgue in Inventiones Mathematicae, one of the world's most prestigious mathematics Journals. Malheursement, cet article est en français.

      Here is the Mathematical Reviews citation for the Lafforgue paper. You can browse the articles cited by him.

      Also, if anyone is interested, here is a paper by Voevodsky about some of his work in motivic cohomology.

  8. Better than a nobel... by themaddone · · Score: 3, Informative

    What makes the Fields medal special, in case you don't know is that:

    a) There is no Nobel Prize for mathematics.

    b) The Fields Medal is only awarded once every four years, vs. every year for the Nobel.

    It's truly an achievement.

  9. CRCs detect errors, don't correct them by ^BR · · Score: 2, Informative


    And that do no good if you can't retransmit the information, eitheir because impractical (e.g. space probe really far away) or because you're reading from some damaged media (e.g. scratched CD). That's where error correcting code are used.
    You usually design you code to withstand some kind of error rate (e.g. 1% of the bits are reversed) and the right code can ensure by encoding data with some redundancy that your data comes intact.


    Old one used where things inspired by the work of guis like Hamming, Berlekamp, Massey, Reed and Solomon (used in satelite transmissions and CD reading). Sundan's work should be an improvement over that and will be used everywhere.

  10. Re:Well by Anonymous Coward · · Score: 2, Informative

    Madhu Sudan leaves an impressive trail of prestigious prizes in CS theory: ACM doctoral dissertation award in 1993, Godel Prize for Computer Science in 2001 and now the Nevanlinna Prize.

    The central theme of his work seems to concern finding approximate solutions to hard problems.

    A 1998 ACM journal paper by with Sudan as co-author showed that this can be done with high probability of success by inspecting only logarithmic number of random bits of the solution.
    The way they did this was by characterizing NP in a new way that integrates interacting computing agents with randomized computation.
    Then from this result on randomized proof-verification, they showed that a broad class of NP-hard problems called MAX-SNP problems are really hard! Meaning that solving these problems approximately is as hard as solving them fully.

    His paper on Reed-Solomon codes for error correction discovered an efficient algorithm for approximately recovering from too many errors in the received codeword. "Efficient" meaning that its running time is polynomially bounded and "too many" meaning the errors are more than the error-correcting capability of the code. For example maximum 2 errors can be corrected, then how do you efficiently recover from 5 errors?

  11. No such thing as "no practicle application" by BobRooney · · Score: 2, Informative

    'True to form, Lafforgue and Voevodsky's mathematical research has no known practical applications' A little over 100 years ago the study of artificial language, number theory, algorithms, etc. were little more than intillectual curiosities. Only in the past 50 years have we seen all these "theoretical" areas of study be thrust into the forefront of science and engineering. It seems a bit pretnentious and short-sighted to ignore discoveries or minimize their importance simply because we haven't learned enough as a society to figure out what those discoveries truly imply. Just mho