Luke Pebody

Luke Thomas Pebody (born 1977) is a mathematician who solved the necklace problem. Educated at Rugby School, and competing three times in the International Mathematical Olympiad,[1] Luke Pebody was admitted to Cambridge University at the age of 14 to read mathematics. He went up when he was 16, making him one of the youngest undergraduates in modern times.

Having graduated with a Bachelor of Arts degree from Trinity College, Cambridge, he proceeded to a doctoral degree at the University of Memphis, where, working with respected graph theorist Béla Bollobás, he presented a possible solution of the reconstruction problem for abelian groups, including the necklace problem.

In 2001, he successfully applied for a junior research fellowship at Cambridge. Before returning to take up residence, he completed a year's research at the Institute for Advanced Study in Princeton, New Jersey

Pebody's contributions to his field included:

  • "Contraction-deletion invariants for graphs" (with Béla Bollobás and Oliver Riordan) (J. Combin. Theory Ser. B 80 (2000) 320-345)
  • "A state-space representation of the HOMFLY polynomial" (with Béla Bollobás and David Weinreich) (Contemporary Combinatorics, Bolyai Society Mathematical Studies 10, 2002) PDF download

Pebody left the field of mathematics for financial services. In 2009, he participated in the Google Code Jam under the alias linguo and was the only person to use the programming language Brainfuck in order to complete a set.[2] He attended the World Final and finished the competition ranked 74th.

References
  1. Luke Pebody's results at International Mathematical Olympiad
  2. "Code Jam Language Stats". Retrieved 2010-01-16.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.