Ben Green (mathematician)

From Wikipedia, the free encyclopedia

Ben Joseph Green (born February 27, 1977, Bristol, United Kingdom) is a British mathematician, specializing in combinatorics and number theory. He studied at Trinity College, Cambridge University, earning his doctorate under Tim Gowers in 2003 before being appointed a Junior Research Fellow. He subsequently became a Professor of Mathematics at Bristol University and also a Research Fellow of the Clay Mathematics Institute. As of September 2006, he will return to Cambridge as the first Herchel Smith Professor of Pure Mathematics. He received the Clay Research Award in 2004 and the Salem Prize in 2005 for his contributions to combinatorial number theory related to progressions of primes.

Ben Green has published several important results in both combinatorics and number theory. These include improving the estimate by Jean Bourgain of the size of arithmetic progressions in sumsets, as well as a proof of the Cameron-Erdős conjecture on sum-free sets of natural numbers.

His work in demonstrating that every set of primes of positive relative upper density contains an arithmetic progression of length three then led to his breakthrough 2004 work with Terence Tao that showed that for all n there exist infinitely many arithmetic progressions of length n in the prime numbers.

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.