Olga Kharlampovich

from Wikipedia, the free encyclopedia

Olga Kharlampovich , Russian Ольга Харлампович , Transkription Olga Charlampowitsch, (* 1958 ) is a Russian-Canadian mathematician who deals with geometric and combinatorial group theory, especially under algorithmic aspects.

Kharlampovich received his PhD in 1984 from Lev Shevrin at the Urals State University ( Algorithmic and other combinatorial problems for groups and Lie algebras ). In 1990 she completed her habilitation (Russian doctorate) at the Steklow Institute in Moscow. She has been a professor at McGill University since 1999 . Since 2011 she has been a professor at Hunter College, City University of New York .

In 2006, together with Alexei Myasnikov, independently of Zlil Sela , she solved the Tarski problem (1945) of the equivalence of first-order theories of finally generated non-Abelian free groups .

As a student in 1980, she solved a problem from Pyotr Sergeyevich Novikov and Sergei Ivanovich Adjan . Nowikow and Boone had shown the insolubility of the word problem for groups finally presented. In 1973 Novikov and Adjan proposed the corresponding problem for finally presented groups that fulfill a nontrivial identity. Kharlampovich constructed a group that can be resolved in three steps (finally presented) with an unsolvable word problem. A year earlier she had shown the unsolvability of the decision problem for finite nilpotent groups (a problem by Kargapolov and Malzew ). For this work she received a gold medal from the Soviet Academy of Sciences .

She later examined the relationship between algebraic and algorithmic properties in varieties via groups and Lie groups , especially with regard to the decidability of the word problem.

Together with other Russian mathematicians, she founded the research field of algebraic geometry using groups.

In 1996 she received the Krieger Nelson Prize . In 2014 she is invited speaker at the ICM in Seoul with Alexei Miasnikov (Model theory and algebraic geometry in groups, non-standard actions and algorithmic problems).

Fonts

  • with Mark Sapir Algorithmic Problems in Varieties, a survey , International Journal of Algebra and Computation, Volume 12, 1995, pp. 379-602

Web links

Individual evidence

  1. ^ Mathematics Genealogy Project
  2. ↑ Kharlampovich, Myasnikov Elementary theory of free non-abelian groups , Journal of Algebra, Volume 302, 2006, pp. 451-552
  3. ↑ Kharlampovich A finitely presented solvable group with unsolvable word problem , Izvest. Ak. Nauk, Ser. Mat., 45, 1981, 852-873
  4. ↑ G. Baumslag, A. Miasnikov, VN Remeslennikov Algebraic geometry over groups I. Algebraic sets and ideal theory , J. Algebra, Volume 219, 1999, pp. 16-79.
  5. ↑ O. Kharlampovich, A. Myasnikov Irreducible affine varieties over a free group. I: Irreducibility of quadratic equations and zeroset , J. Algebra, volume. 200, 1998, pp. 492-516, Part 2 Systems in row-echelon form and description of residually free groups , J. Algebra, Volume 200, 1998, pp. 517-570
personal data
SURNAME Kharlampovich, Olga
ALTERNATIVE NAMES Харлампович, Ольга; Charlampovich, Olga
BRIEF DESCRIPTION Canadian-Russian mathematician
DATE OF BIRTH 1958