Concept

John Pardon

John Vincent Pardon (born June 1989) is an American mathematician who works on geometry and topology. He is primarily known for having solved Gromov's problem on distortion of knots, for which he was awarded the 2012 Morgan Prize. He is currently a permanent member of the Simons Center for Geometry and Physics and a full professor of mathematics at Princeton University. Pardon's father, William Pardon, is a mathematics professor at Duke University, and when Pardon was a high school student at the Durham Academy he also took classes at Duke. He was a three-time gold medalist at the International Olympiad in Informatics, in 2005, 2006, and 2007. In 2007, Pardon placed second in the Intel Science Talent Search competition, with a generalization to rectifiable curves of the carpenter's rule problem for polygons. In this project, he showed that every rectifiable Jordan curve in the plane can be continuously deformed into a convex curve without changing its length and without ever allowing any two points of the curve to get closer to each other. He published this research in the Transactions of the American Mathematical Society in 2009. Pardon then went to Princeton University, where after his sophomore year he primarily took graduate-level mathematics classes. At Princeton, Pardon solved a problem in knot theory posed by Mikhail Gromov in 1983 about whether every knot can be embedded into three-dimensional space with bounded stretch factor. Pardon showed that, on the contrary, the stretch factor of certain torus knots could be arbitrarily large. His proof was published in the Annals of Mathematics in 2011, and earned him the Morgan Prize of 2012. Pardon also took part in a Chinese-language immersion program at Princeton, and was part of Princeton's team at an international debate competition in Singapore, broadcast on Chinese television. As a cello player he was a two-time winner of the Princeton Sinfonia concerto competition. He graduated in 2011, as Princeton's valedictorian.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.