Pyotr Novikov
(Redirected from P.S. Novikov)
Pyotr Sergeyevich Novikov (Russian: Пётр Серге́евич Но́виков; 28 August 1901, Moscow – 9 January 1975, Moscow) was a Soviet mathematician.
Novikov is known for his work on combinatorial problems in group theory: the word problem for groups, and his progress in the Burnside problem. He was awarded the Lenin Prize in 1957 for proving the undecidability of the word problem in groups.[1]
In 1953, he became a corresponding member of the Academy of Sciences of the Soviet Union. In 1960, he was elected a full member.
He was married to mathematician Lyudmila Keldysh (1904–1976) and raised mathematician Sergei Novikov (born 1938) as his son. Sergei Adian and Albert Muchnik were among his students.
Awards and honors[edit]
- Lenin Prize (1957)
- Two Orders of Lenin (1961, 1971)
- Order of the Red Banner of Labour
- State Prize of the Russian Federation (1999, posthumous)
See also[edit]
References[edit]
- ^ S. I. Adian, Mathematical logic, the theory of algorithms and the theory of sets, AMS Bookstore, 1977, ISBN 0-8218-3033-3, p. 26. (being Novikov's Festschrift on the occasion of his seventieth birthday)
External links[edit]
- O'Connor, John J.; Robertson, Edmund F., "Pyotr Novikov", MacTutor History of Mathematics Archive, University of St Andrews
- Pyotr Novikov at the Mathematics Genealogy Project
Categories:
- 1901 births
- 1975 deaths
- 20th-century Russian mathematicians
- Mathematicians from Moscow
- Academic staff of the D. Mendeleev University of Chemical Technology of Russia
- Academic staff of Moscow State Pedagogical University
- Full Members of the USSR Academy of Sciences
- Moscow State University alumni
- Recipients of the Lenin Prize
- Recipients of the Order of Lenin
- Recipients of the Order of the Red Banner of Labour
- State Prize of the Russian Federation laureates
- Group theorists
- Soviet mathematicians
- Russian mathematician stubs
- Burials at Novodevichy Cemetery
- Russian scientists