Alexander Melnikov (academic)

Alexander G. Melnikov
Born
Novosibirsk, Russia
CitizenshipNew Zealand
Alma materNovosibirsk State University (BSc, MSc, C.Sc.); University of Auckland (PhD); Sobolev Institute of Mathematics (D.Sc.)
Known forComputable structure theory
AwardsRutherford Discovery Fellowship (2019); NZMS Early Career Research Award (2016); Massey University Early Career Research Medal (2017)
Scientific career
FieldsComputability theory, computable algebra, mathematical logic
InstitutionsVictoria University of Wellington, Massey University, University of California, Berkeley, Nanyang Technological University
Thesis Computability and Structure  (2013)
Doctoral advisorBakhadyr Khoussainov; Andre Nies

Alexander G. "Sasha" Melnikov is a Russian-born mathematician whose work centres on computability theory and its applications to algebra, topology and analysis. He is an Associate Professor in the School of Mathematics and Statistics at Victoria University of Wellington in New Zealand.[1]

Education

Melnikov earned a BSc (2006) and MSc (2008) in mathematics from Novosibirsk State University. He then obtained two doctoral qualifications: a Candidate of Sciences (C.Sc., 2012) from Novosibirsk State University on effective properties of decomposable abelian groups, and a PhD in computer science (2013) from the University of Auckland with the dissertation Computability and Structure, supervised by Bakhadyr Khoussainov and Andre Nies.[2] In 2019 he was awarded a Doctor of Sciences (D.Sc.) by the Sobolev Institute of Mathematics for work on classification problems and constructive models.[2]

Career

After postdoctoral posts at Nanyang Technological University (2012–2013), Victoria University of Wellington (2013–2014), and the University of California, Berkeley (2014–2015), Melnikov joined Massey University as a Lecturer in 2015, was promoted to Senior Lecturer in 2017 and to Associate Professor in 2021.[2] Later in 2021 he returned to Victoria University of Wellington, where he now teaches algebra and logic and leads research in computable mathematics.[3]

Research

Melnikov’s research focuses on computability-theoretic classification problems in algebraic, topological and analytical structures. His recent work includes studies of computably compact metric spaces, computable Gelfand duality and effective presentations of locally compact groups. In 2024 he co-authored “Punctually Presented Structures II: Comparing Presentations”, introducing new invariants for measuring the complexity of algebraic classifications.[4]

Honours and awards

  • Rutherford Discovery Fellowship (Royal Society Te Apārangi, 2019–2024) for the project “Applications of modern computability”.[5]
  • NZMS Early Career Research Award (New Zealand Mathematical Society, 2016) for highly original contributions to computability in algebra and topology.[2]
  • Massey University Early Career Research Medal (2017).[6]

Selected works

  • R. Downey & A. G. Melnikov (2013). “Effectively categorical abelian groups.” Journal of Algebra 373: 223–248. doi:10.1016/j.jalgebra.2012.09.020[7]
  • A. G. Melnikov (2014). “Computable abelian groups.” Bulletin of Symbolic Logic 20 (3): 315–356. doi:10.1017/bsl.2014.32[8]
  • M. Harrison-Trainor, A. G. Melnikov & K. M. Ng (2020). “Computability of Polish spaces up to homeomorphism.” Journal of Symbolic Logic 85 (4): 1664–1686. doi:10.1017/jsl.2020.67[9]

References

  1. ^ "Alexander G. Melnikov". Victoria University of Wellington. Retrieved 28 July 2025.
  2. ^ a b c d "Academic CV – Alexander G. Melnikov" (PDF). Victoria University of Wellington. Retrieved 28 July 2025.
  3. ^ "Sasha Melnikov – Te Herenga Waka". Victoria University of Wellington. Retrieved 28 July 2025.
  4. ^ Dorzhieva, E.; Melnikov, A. G. (2024). "Punctually Presented Structures II: Comparing Presentations". Annals of Pure and Applied Logic. doi:10.1016/j.apal.2024.103208 (inactive 11 August 2025).{{cite journal}}: CS1 maint: DOI inactive as of August 2025 (link)
  5. ^ "Alexander Melnikov – Rutherford Discovery Fellowship 2019". Royal Society Te Apārangi. Retrieved 28 July 2025.
  6. ^ "Research excellence awards – Early Career Research Medal recipients". Massey University. Retrieved 28 July 2025.
  7. ^ "Effectively categorical abelian groups". ResearchGate. Retrieved 28 July 2025.
  8. ^ "Computable abelian groups". ResearchGate. Retrieved 28 July 2025.
  9. ^ "Computability of Polish spaces up to homeomorphism". ResearchGate. Retrieved 28 July 2025.