226313 materialEducativo

Luke Pebody

tipo de documento Wikipedia article Person

I like 0
Visits 29
Comments 0
Save to
Actions
- Send link

About this resource...

Person

Wikipedia articleDbpedia source

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, 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 JerseyPebody'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 downloadPebody left the field of mathematics for financial services.In 2009, he participated in the Google Code Jam under the alias linguo[citation needed] and was the only person to use the programming language Brainfuck in order to complete a set. He attended the World Final and finished the competition ranked 74th.

Birth date 1977-01-01

Birth year 1977

English Wikipedia http://en.wikipedia.org/wiki/Luke_Pebody

Spanish wikipedia http://es.wikipedia.org/wiki/Luke_Pebody

Wiki page external link http://www.gettysburg.edu/~dweinrei/research/homfly.pdf