Paul Schupp

Last updated
Paul Schupp
PaulSchupp2017.jpg
Paul Schupp in June 2017
Born(1937-03-12)March 12, 1937
Died(2022-01-24)January 24, 2022 [1]
Nationality American
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, died January 24, 2022) was 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. [2]

He received his Ph.D. from the University of Michigan in 1966 under the direction of Roger Lyndon.

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. [2] 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. [3]

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. [4]

Related Research Articles

Combinatorics is an area of mathematics primarily concerned with counting, both as a means and as an end to obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many applications ranging from logic to statistical physics and from evolutionary biology to computer science.

<span class="mw-page-title-main">Richard M. Karp</span> American mathematician

Richard Manning Karp is an American computer scientist and computational theorist at the University of California, Berkeley. He is most notable for his research in the theory of algorithms, for which he received a Turing Award in 1985, The Benjamin Franklin Medal in Computer and Cognitive Science in 2004, and the Kyoto Prize in 2008.

<span class="mw-page-title-main">Kenneth Appel</span> American mathematician (1932–2013)

Kenneth Ira Appel was an American mathematician who in 1976, with colleague Wolfgang Haken at the University of Illinois at Urbana–Champaign, solved one of the most famous problems in mathematics, the four-color theorem. They proved that any two-dimensional map, with certain limitations, can be filled in with four colors without any adjacent "countries" sharing the same color.

<span class="mw-page-title-main">Theoretical computer science</span> Subfield of computer science and mathematics

Theoretical computer science is a subfield of computer science and mathematics that focuses on the abstract and mathematical foundations of computation.

<span class="mw-page-title-main">Geometric group theory</span> Area in mathematics devoted to the study of finitely generated groups

Geometric group theory is an area in mathematics devoted to the study of finitely generated groups via exploring the connections between algebraic properties of such groups and topological and geometric properties of spaces on which these groups can act non-trivially.

<span class="mw-page-title-main">Timothy M. Chan</span> Canadian computer scientist

Timothy Moon-Yew Chan is a Founder Professor in the Department of Computer Science at the University of Illinois at Urbana–Champaign. He was formerly Professor and University Research Chair in the David R. Cheriton School of Computer Science, University of Waterloo, Canada.

<span class="mw-page-title-main">Christos Papadimitriou</span> Greek-American computer scientist (b. 1949)

Christos Charilaos Papadimitriou is a Greek-American theoretical computer scientist and the Donovan Family Professor of Computer Science at Columbia University.

<span class="mw-page-title-main">Kurt Mehlhorn</span> German computer scientist (born 1949)

Kurt Mehlhorn is a German theoretical computer scientist. He has been a vice president of the Max Planck Society and is director of the Max Planck Institute for Computer Science.

<span class="mw-page-title-main">John R. Stallings</span> American mathematician

John Robert Stallings Jr. was a mathematician known for his seminal contributions to geometric group theory and 3-manifold topology. Stallings was a Professor Emeritus in the Department of Mathematics at the University of California at Berkeley where he had been a faculty member since 1967. He published over 50 papers, predominantly in the areas of geometric group theory and the topology of 3-manifolds. Stallings' most important contributions include a proof, in a 1960 paper, of the Poincaré Conjecture in dimensions greater than six and a proof, in a 1971 paper, of the Stallings theorem about ends of groups.

<span class="mw-page-title-main">János Pach</span> Hungarian mathematician

János Pach is a mathematician and computer scientist working in the fields of combinatorics and discrete and computational geometry.

Marc Snir is an Israeli-American computer scientist. He holds a Michael Faiman and Saburo Muroga Professorship in the Department of Computer Science at the University of Illinois at Urbana-Champaign. He currently pursues research in parallel computing. He was the principal investigator (PI) for the software of the petascale Blue Waters system and co-director of the Intel and Microsoft-funded Universal Parallel Computing Research Center (UPCRC).

Piotr Indyk is Thomas D. and Virginia W. Cabot Professor in the Theory of Computation Group at the Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology.

George Barry Purdy was a mathematician and computer scientist who specialized in cryptography, combinatorial geometry, and number theory. Purdy received his Ph.D. from the University of Illinois at Urbana–Champaign in 1972, officially under the supervision of Paul T. Bateman, but his de facto adviser was Paul Erdős. He was on the faculty in the mathematics department at Texas A&M University for 11 years, and was appointed the Geier Professor of computer science at the University of Cincinnati in 1986.

<span class="mw-page-title-main">Roger Lyndon</span> American mathematician

Roger Conant Lyndon was an American mathematician, for many years a professor at the University of Michigan. He is known for Lyndon words, the Curtis–Hedlund–Lyndon theorem, Craig–Lyndon interpolation and the Lyndon–Hochschild–Serre spectral sequence.

<span class="mw-page-title-main">Rod Downey</span> Australian mathematician

Rodney Graham Downey is a New Zealand and Australian mathematician and computer scientist, an emeritus professor in the School of Mathematics and Statistics at Victoria University of Wellington in New Zealand. He is known for his work in mathematical logic and computational complexity theory, and in particular for founding the field of parameterised complexity together with Michael Fellows.

<span class="mw-page-title-main">Tandy Warnow</span> American computer scientist

Tandy Warnow is an American computer scientist and Grainger Distinguished Chair in Engineering at the University of Illinois at Urbana–Champaign. She is known for her work on the reconstruction of evolutionary trees, both in biology and in historical linguistics, and also for multiple sequence alignment methods.

David Eugene Muller was an American mathematician and computer scientist. He was a professor of mathematics and computer science at the University of Illinois (1953–92), after which he became an emeritus professor, and was an adjunct professor of mathematics at the New Mexico State University (1995–2008). Muller received his BS in 1947 and his PhD in 1951 in physics from Caltech; an honorary PhD was conferred by the University of Paris in 1989. He was the inventor of the Muller C-element, a device used to implement asynchronous circuitry in electronic computers. He also co-invented the Reed–Muller codes. He discovered the codes, and Irving S. Reed proposed the majority logic decoding for the first time. Furthermore, he invented Muller automata, an automaton model for infinite words. In geometric group theory Muller is known for the Muller–Schupp theorem, joint with Paul Schupp, characterizing finitely generated virtually free groups as finitely generated groups with context-free word problem.

In mathematics, the Muller–Schupp theorem states that a finitely generated group G has context-free word problem if and only if G is virtually free. The theorem was proved by David Muller and Paul Schupp in 1983.

Sariel Har-Peled is an Israeli–American computer scientist known for his research in computational geometry. He is a Donald Biggar Willett Professor in Engineering at the University of Illinois at Urbana–Champaign.

<span class="mw-page-title-main">Ilya Kapovich</span> Russian-American mathematician

Ilya Kapovich is a Russian-American mathematician and a Professor of Mathematics at the Hunter College of the City University of New York. He is known for his contributions to geometric group theory, geometric topology, and complexity theory.

References

  1. In Memoriam: Paul Schupp, Department of Mathematics, University of Illinois at Urbana-Champaign, January 25, 2022
  2. 1 2 Kapovich, Ilya (2010). "On mathematical contributions of Paul E. Schupp". Illinois Journal of Mathematics . 54: 1–9. doi: 10.1215/ijm/1299679735 . MR   2776982.
  3. 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
  4. "Conference 'Groups and Computation: Interactions between geometric group theory, computability and computer science'". Stevens Institute of Technology . Retrieved 2020-04-05.