Paul Schupp
| Paul Schupp | |
|---|---|
| Born |
March 12, 1937 Cleveland, Ohio |
| Nationality | United States |
| Alma mater | University of Michigan |
| Known for | Muller–Schupp theorem |
| Awards | Guggenheim Fellowship |
| Scientific career | |
| Fields | Mathematics |
| Institutions | University of Illinois |
| Doctoral advisor | Roger Lyndon |
Paul Eugene Schupp (born March 12, 1937) is a Professor Emeritus of Mathematics at the University of Illinois at Urbana Champaign. He is known for his contributions to geometric group theory, computational complexity and the theory of computability.[1]
He received his Ph.D. from the University of Michigan in 1966 under the direction of Roger Lyndon. He has supervised 14 PhD students during his time at University of Illinois.
Together with Roger Lyndon he is the coauthor of the book "Combinatorial Group Theory" which provided a comprehensive account of the subject of Combinatorial Group Theory, starting with the work of Dehn in the 1910s and to late 1970s and remains a modern standard for the subject of small cancellation theory. [1] Starting 1980's he worked on problems that explored the connections between Group theory and Computer Science and Complexity Theory. Together with David Muller he proved that a finitely generated group G has context-free word problem if and only if G is virtually free, which is now known as Muller–Schupp theorem. [2]
In 1977, Schupp received a Guggenheim Fellowship. In 2012, he was named an inaugural fellow of the American Mathematical Society. In 2017, the conference "Groups and Computation" was organized at Stevens Institute of Technology celebrating the mathematical contributions of Paul Schupp.
References
- 1 2 Kapovich, Ilya (2010). "On mathematical contributions of Paul E. Schupp". Illinois Journal of Mathematics. 54: 1–9. MR 2776982.
- ↑ David E. Muller, and Paul E. Schupp, Groups, the theory of ends, and context-free languages. Journal of Computer and System Sciences 26 (1983), no. 3, 295–310
