Olga Kharlampovich (born March 25, 1960, in Sverdlovsk[1][2]) is a Russian-Canadian mathematician working in the area of group theory.
Kharlampovich is known for her example of a finitely presented 3-step solvable group with unsolvable word problem (solution of the Novikov–Adian problem)[pub 1] and for the solution together with A. Myasnikov of the Tarski conjecture (from 1945) about equivalence of first-order theories of finitely generated non-abelian free groups[pub 2] (also solved by Zlil Sela[3]) and decidability of this common theory.
She received an Ural Mathematical Society Award in 1984 for the solution of the Malcev–Kargapolov problem posed in 1965 about the algorithmic decidability of the universal theory of the class of all finite nilpotent groups.
Kharlampovich was awarded in 1996 the Krieger–Nelson Prize of the Canadian Mathematical Society for her work on algorithmic problems in varieties of groups and Lie algebras (the description of this work can be found in the survey paper with Sapir[pub 5] and on the prize web site).
[6] She was elected a Fellow of the American Mathematical Society in the 2020 class "for contributions to algorithmic and geometric group theory, algebra and logic.