Pyotr Novikov

Revision as of 00:16, 3 April 2025 by imported>Citrus Lover (add link to List of second-generation Mathematicians)
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Template:Short description Template:Infobox scientist Template:Family name hatnote Pyotr Sergeyevich NovikovTemplate:Efn (Template:Langx; 15 August 1901, Moscow – 9 January 1975, Moscow) was a Soviet mathematician known for his work in group theory. His son, Sergei Novikov, was also a mathematician.

Early life and educationEdit

Pyotr Sergeyevich Novikov was born on 15 August 1901 in Moscow, Russia to Sergei Novikov, a merchant, and Alexandra Novikov.<ref name="MacTutor1"/>

He served in the Red Army during the Russian Civil War from 1920 to July 1922.<ref name="MacTutor1"/> He studied at Moscow University from 1919 to 1920 and again from 1922 until he graduated in 1925.<ref name="MacTutor1"/> He studied under Nikolai Luzin until he finished his graduate studies in 1929.<ref name="MacTutor1"/>

CareerEdit

Novikov worked at the Moscow D. Mendeleev Institute of Chemical Technology from 1929 until 1934, when he joined the Department of Real Function Theory at the Steklov Institute of Mathematics. He was awarded his doctorate in 1935 and promoted to full professor in 1939.<ref name="MacTutor1"/> Novikov became head of the Department of Analysis at the Moscow State Teachers Training Institute in 1944.<ref name="MacTutor1"/> In 1957, he became the first head of the Department of Mathematical Logic at the Steklov Institute.<ref name="MacTutor1"/> He jointly held both positions until he retired in 1972 and 1973 respectively.<ref name="MacTutor1"/>

Sergei Adian and Albert Muchnik were among his students.<ref>Template:MathGenealogy</ref>

ResearchEdit

Novikov is known for his work on combinatorial problems in group theory: the word problem for groups, and his progress in the Burnside problem.<ref name="MacTutor1"/> In 1955, he proved the Novikov–Boone theorem: that there is a finite presentation of a group Template:Math for which there is no algorithm which, given two words u, v, decides whether u and v describe the same element in the group.<ref>Template:Citation</ref>

Awards and honorsEdit

Novikov was elected a corresponding member and then a full member of the Academy of Sciences of the Soviet Union in 1953 and 1960, respectively.

He was awarded the Lenin Prize in 1957 for proving the undecidability of the word problem in groups.<ref>S. I. Adian, Mathematical logic, the theory of algorithms and the theory of sets, AMS Bookstore, 1977, Template:ISBN, p. 26. (being Novikov's Festschrift on the occasion of his seventieth birthday)</ref>

He received the Order of Lenin in 1961 and again in 1971. He was awarded the Order of the Red Banner of Labour. The State Prize of the Russian Federation was awarded to Novikov posthumously in 1999.Template:Cn

Personal lifeEdit

He was married to mathematician Lyudmila Keldysh (1904–1976).<ref name="MacTutor1">Template:MacTutor Biography</ref> Their son Sergei Novikov (1938–2024) became the first Soviet mathematician to receive the Fields Medal.<ref name="MacTutor2">Template:MacTutor Biography</ref><ref name="MSU-death">{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>

He died on 9 January 1975 in Moscow.<ref name="MacTutor1"/>

See alsoEdit

Template:Portal

NotesEdit

Template:Notelist

ReferencesEdit

Template:Reflist

Template:Authority control


Template:Russia-mathematician-stub