Gennady Makanin
Gennady Semenovich Makanin
Born
Gennady Semenovich Makanin

(1938-05-19)May 19, 1938
Died2017
NationalityRussian
Alma materMoscow State University
Known forMakanin's algorithm (1977)[1][2]
Makanin-Razborov algorithm[3][4]
Makanin-Razborov diagrams[5]
Scientific career
Fieldsmathematics
InstitutionsSteklov Institute of Mathematics

Gennady (or Gennadii or Gennadiy) Semenovich Makanin (1938–2017) was a Russian mathematician, awarded the 2010 I. M. Vinogradov Prize for a series of papers on the problem of algorithmically recognizing the solvability of arbitrary equations in free groups and semigroups.

Education and career

At Moscow State University he received his undergraduate degree and in 1967 his Russian Candidate of Sciences degree (PhD). His dissertation К проблеме тождества в конечно-определённых группах и полугруппах (On the identity problem in finitely-presented groups and semigroups) was supervised by Andrey Markov Jr. and Sergei Adian.[6][7]

Makanin spent his career (since 1966) working at the Steklov Institute of Mathematics (since 2013 as a freelance employee). From the Steklov Institute of Mathematics he received in 1977 his Russian Doctor of Sciences degree (similar to habilitation) with dissertation Проблема разрешимости уравнений в свободной полугруппе (The problem of solvability of equations in a free semigroup). On the basis of his 1977 dissertation he was an invited speaker at the 1978 International Congress of Mathematicians in Helsinki.[8][9]

He gained international recognition for his research on combinatorial group theory and algorithmic problems in the theory of semigroups. Zlil Sela, Eliyahu Rips, and others have made important applications of Makanin-Razborov diagrams to geometric group theory.

In 1982 Makanin published a complete solution (an algorithm with proof of validity) to the problem of recognizing the solvability of equations in a free group. An English translation was published in 1983.[10] In 1984 (followed by English translation in 1985) he published a proof, using techniques similar to those in his 1982 paper, of the decidability, for any free group, of two different formal theories generated by that free group.[11]

Remarks on Makanin's research

Martin Davis and Julia Robinson worked unsuccessfully on the problem which was eventually solved in 1977 by Makanin:

We worked together on a problem on which we didn’t get anywhere. We were trying to prove the unsolvability of the decision problem for word equations. It turned out that we wouldn’t have been able to do that because the problem is solvable. Makanin solved it positively. That had a curious relationship to Hilbert’s Tenth Problem, because some of the Russians were interested in proving it unsolvable because its unsolvability would have been a way to get the unsolvability of Hilbert’s Tenth Problem, without proving my conjecture, which they thought was likely false. But in fact, it turned out to be on the other side of the line.[12]

Yuri Matiyasevich published a generalization of what he called the "celebrated theorem of G. S. Makanin about decidability of word equations".[13]

Selected publications

  • Makanin, G. S. (1977). "The Problem of Solvability of Equations in a Free Semigroup". Mathematics of the USSR-Sbornik. 32 (2): 129–198. Bibcode:1977SbMat..32..129M. doi:10.1070/SM1977v032n02ABEH002376.
  • —— (1982). "Уравнения в свободной группе (Equations in a free group)". Известия АН СССР. Серия математика. 46 (6): 1199–1273.
  • —— (1984). "Универсальная теория и позитивная теория свободной группы (Universal theory and positive theory of the free group)". Известия АН СССР. Серия математика. 48 (4): 735–749.
  • —— (1992). "Investigations on equations in a free group". Word Equations and Related Topics. Lecture Notes in Computer Science. Vol. 572. pp. 1–11. doi:10.1007/3-540-55124-7_1. ISBN 978-3-540-55124-9.
  • —— (1993). "On general solution of equations in a free semigroup". Word Equations and Related Topics. Lecture Notes in Computer Science. Vol. 677. pp. 1–5. doi:10.1007/3-540-56730-5_27. ISBN 978-3-540-56730-1.
  • —— (1996). "Multiplication of natural number parameters and equations in a free semigroup". Transactions of the American Mathematical Society. 348 (12): 4813–4824. doi:10.1090/S0002-9947-96-01670-4. ISSN 0002-9947.
  • ——; Abdulrab, H.; Goralcik, P. (1997). "Functions for the general solution of parametric word equations". Logical Foundations of Computer Science. Lecture Notes in Computer Science. Vol. 1234. pp. 189–202. doi:10.1007/3-540-63045-7_20. ISBN 978-3-540-63045-6.
  • ——; Makanina, Tatiana A. (1999). "Functions for parametrization of solutions of an equation in a free monoid". Transactions of the American Mathematical Society. 352 (1): 1–54. doi:10.1090/S0002-9947-99-02287-4. ISSN 0002-9947.
  • ——; Makanina, Tatiana A. (2000). "Parametrisation of solutions of parametric equation in free monoid". Theoretical Computer Science. 242 (1–2): 403–475. doi:10.1016/S0304-3975(00)00004-9.

References

  1. ↑ Diekert, Volker (1998). "Makanin's algorithm for solving word equations with regular constraints". elib, University of Stuttgart. doi:10.18419/opus-2419.
  2. ↑ Gutiérrez, Claudio (1998). "Solving equations in strings: On Makanin's algorithm". In: Lucchesi C.L., Moura A.V. (eds.) LATIN '98: Theoretical Informatics (3rd Latin American Symposium — Campinals, Brazil, April 20–24, 1998 Proceedings). Lecture Notes in Computer Science, vol. 1380. Vol. 1380. Berlin; Heidelberg: Springer. pp. 358–373. doi:10.1007/BFb0054336. ISBN 978-3-540-64275-6. ISSN 0302-9743.
  3. ↑ G. S. Makanin Equations in a free group. (Russian), Izvestia Akademii Nauk SSSR, Seriya Matematischeskaya, vol. 46 (1982), no. 6, pp. 1199–1273
  4. ↑ A. A. Razborov. Systems of equations in a free group. (in Russian) Izvestia Akademii Nauk SSSR, Seriya Matematischeskaya, vol. 48 (1984), no. 4, pp. 779–832.
  5. ↑ Sela, Z. (2016). "Word equations I: Pairs and their Makanin-Razborov diagrams". arXiv:1607.05431 [math.GR].
  6. ↑ Gennady Makanin at the Mathematics Genealogy Project
  7. ↑ Nyberg-Brodda, Carl-Fredrik (2021). "A translation of G. S. Makanin's 1966 Ph.D. thesis "On the Identity Problem for Finitely Presented Groups and Semigroups". arXiv:2102.00745 [math.GR].
  8. ↑ "Makanin, G. S." ICM Plenary and Invited Speakers.
  9. ↑ Eight Lectures Delivered at the International Congress of Mathematicians in Helsinki, 1978. American Mathematical Society Translations: Series 2. Vol. 117. American Mathematical Society. 1981. doi:10.1090/trans2/117. ISBN 9780821830697. MR 0665105. ISBN 978-0-8218-3069-7 (print); ISBN 978-1-4704-3328-4 (online)
  10. ↑ Makanin, Gennady S. (1983). "Equations in a free group". Mathematics of the USSR-Izvestiya. 21 (3): 483–. Bibcode:1983IzMat..21..483M. doi:10.1070/IM1983v021n03ABEH001803.
  11. ↑ Makanin, Gennadiı Semyonovich (1985). "Decidability of the universal and positive theories of a free group". Mathematics of the USSR-Izvestiya. 25 (1): 75. Bibcode:1985IzMat..25...75M. doi:10.1070/IM1985v025n01ABEH001269.
  12. ↑ Jackson, Allyn (May 2008). "An interview with Martin Davis". Notices of the AMS. 55 (5): 560–571. (quote from Martin Davis, p. 565)
  13. ↑ Matiyasevich Y. (1997). "Some decision problems for traces". In Adian S.; Nerode A. (eds.). Logical Foundations of Computer Science. LFCS 1997. Lecture Notes in Computer Science, vol. 1234. Berlin; Heidelberg: Springer. pp. 248–257. doi:10.1007/3-540-63045-7_25.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.