Luke Pebody

Luke Pebody

Luke Thomas Pebody (born 1977) is a mathematician who solved the necklace problem. Educated at Rugby School, 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 of all time.

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) [http://www.gettysburg.edu/~dweinrei/research/homfly.pdf PDF download]

Pebody left the field of mathematics for financial services.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Self number — A self number, Colombian number or Devlali number is an integer which, in a given base, cannot be generated by any other integer added to the sum of that other integer s digits. For example, 21 is not a self number, since it can be generated by… …   Wikipedia

  • Liste de personnes par nombre d'Erdős — Voici une liste non exhaustive de personnes ayant un nombre d Erdős de 0, 1 ou 2. Sommaire 1 #0 2 #1 3 #2 4 Référence …   Wikipédia en Français

  • List of combinatorics topics — This is a list of combinatorics topics.A few decades ago it might have been said that combinatorics is little more than a way to classify poorly understood problems, and some standard remedies. Great progress has been made since 1960.This page is …   Wikipedia

  • Multimagic square — In mathematics, a P multimagic square (also known as a satanic square) is a magic square that remains magic even if all its numbers are replaced by their kth power for 1 ≤ k ≤ P. Thus, a magic square is bimagic if it is 2 multimagic, and trimagic …   Wikipedia

  • List of Old Rugbeians — This is a List of Old Rugbeians, they being notable former students known as Old Rugbeians of the Church of England school, Rugby School in Rugby, Warwickshire, Warwickshire, England. Academic * L.A. Adamson, Headmaster of Wesley College,… …   Wikipedia

  • List of people by Erdős number — Paul Erdős was one of the most prolific writers of mathematical papers. He collaborated a great deal, having 511 joint authors, a number of whom also have many collaborators. The Erdős number measures the collaborative distance between an author… …   Wikipedia

  • Liste de personnes par nombre d'Erdos — Liste de personnes par nombre d Erdős Liste des personne avec un nombre d Erdős de 0, 1 ou 2. Sommaire 1 #0 2 #1 3 #2 4 Liens externes // …   Wikipédia en Français

  • Outline of combinatorics — See also: Index of combinatorics articles The following outline is presented as an overview of and topical guide to combinatorics: Combinatorics – branch of mathematics concerning the study of finite or countable discrete structures. Contents 1… …   Wikipedia

  • Necklace problem — The necklace problem is a problem in recreational mathematics, solved in the early 21st century. Contents 1 Formulation 2 Solution 3 References 4 See also …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”