Biography:Yuri Matiyasevich

From HandWiki
Short description: Russian mathematician and computer scientist
Yuri Matiyasevich
Yuri Matiyasevich. Portrait 1969.jpg
Born (1947-03-02) 2 March 1947 (age 77)
Leningrad, Soviet Union
NationalitySoviet
Russian
Alma materLeningrad State University
Known forhis contribution to computability theory, especially solving Hilbert's tenth problem, through Matiyasevich's theorem
AwardsPetersburg Mathematical Society Prize (1970),
Markov Prize (1980),
Humboldt Award (1998)
Scientific career
FieldsMathematics and Theoretical computer science
InstitutionsPetersburg Department of Steklov Institute of Mathematics

Yuri Vladimirovich Matiyasevich, (Russian: Ю́рий Влади́мирович Матиясе́вич; born 2 March 1947 in Leningrad) is a Russian mathematician and computer scientist. He is best known for his negative solution of Hilbert's tenth problem (Matiyasevich's theorem), which was presented in his doctoral thesis at LOMI (the Leningrad Department of the Steklov Institute of Mathematics).

Biography

Early years and education

Yuri Matiyasevich was born in Leningrad on March 2, 1947. The first few classes he studied at school No. 255 with Sofia G. Generson, thanks to whom he became interested in mathematics. In 1961 he began to participate in all-Russian olympiads. From 1962 to 1963 he studied at Leningrad physical and mathematical school No. 239. Also from 7th to 9th grade he was involved in the mathematical circle of the Leningrad Palace of Pioneers. In 1963-1964 he completed 10th grade at the Moscow State University physics and mathematics boarding school No. 18 named after A. N. Kolmogorov.[1][2]

In 1964, he won a gold medal the International Mathematical Olympiad[3] and was enrolled in the Mathematics and Mechanics Department of St. Petersburg State University without exams. He took his high school diploma exams as a first-year student.[4][5]

Being a second-year student, he released two papers in mathematical logic that were published in the Proceedings of the USSR Academy of Sciences. He presented these works at the International Congress of Mathematicians in 1966.[2]

After graduation, he enrolled in graduate school at St. Petersburg Department of Steklov Mathematical Institute of the Russian Academy of Sciences (POMI). In 1970, under the guidance of Sergei Maslov (mathematician) (ru), he defended his thesis for the degree of Candidate of Sciences in Physics and Mathematics.[6]

In 1972, at the age of 25, he defended his doctoral dissertation on the unsolvability of Hilbert's tenth problem.[7]

From 1974 Matiyasevich worked in scientific positions at LOMI, first as a senior researcher, in 1980 he headed the Laboratory of Mathematical Logic. In 1995, Matiyasevich became a professor at POMI, initially at the chair of software engineering, later at the chair of algebra and number theory.[8]

In 1997, he was elected as a corresponding member of Russian Academy of Sciences. Since 1998, Yuri Matiyasevich has been a vice-president of St. Petersburg Mathematical Society. Since 2002, he has been a head of St.Petersburg City Mathematical Olympiad.

Since 2003, Matiyasevich has been a co-director of an annual German–Russian student school JASS.

In 2008, he was elected as a full member of Russian Academy of Sciences.[9]

He was a member of the American Mathematical Society and the Association for Symbolic Logic; and also of the editorial boards for the journals Discrete Mathematics and Applications and Computer Instruments in Education. As a teacher, he mentored Eldar Musayev, Maxim Vsemirnov, Alexei Pastor, Dmitri Karpov[10]

A polynomial related to the colorings of a triangulation of a sphere was named after Matiyasevich; see The Matiyasevich polynomial, four colour theorem and weight systems.

Awards and honors

  • 1964: Gold medal at the International Mathematical Olympiad held in Moscow.
  • 1970: "Young mathematician prize" of the Leningrad Mathematical Society.[11]
  • 1980: Markov Prize of Academy of Sciences of the USSR.
  • 1996: Honorary Degree, Université d'Auvergne.
  • 1998: He received Humboldt Research Award.
  • 2003: Honorary Degree, Université Pierre et Marie Curie (UPMC).
  • 2007: Member of the Bavarian Academy of Sciences.

Selected works

  • In graph theory, he found an unexpected connection between the four color theorem and divisibility of binomial coefficients, and gave a probabilistic interpretation of the four color theorem.[13]
  • He discovered a number of new interesting qualities of the zeros of the Riemann [math]\displaystyle{ \xi }[/math]-function.[10]

Book

Papers

See also

References

Sources

External links