We study the Diophantine problem (decidability of finite systems of equations) in different
classes of finitely generated solvable groups (nilpotent, polycyclic, metabelian, free solvable …

In this paper we study the Diophantine problem in Chevalley groups G π (Φ, R), where Φ is
a reduced irreducible root system of rank> 1, R is an arbitrary commutative ring with 1. We …

We investigate systems of equations and the first-order theory of one-relator monoids. We
describe a family F of one-relator monoids of the form< A| w= 1> where for each monoid M in …

The Diophantine problem in the classical matrix groups - IOPscience This site uses cookies.
By continuing to use this site you agree to our use of cookies. To find out more, see our …

Groups elementarily equivalent to the classical matrix groups Page 63 Alexei G. Myasnikov
and Mahmood Sohrabi Groups Elementarily Equivalent to the Classical Matrix Groups To …

We study metabelian groups 𝐺 given by full rank finite presentations⟨ A∣ R⟩ M in the
variety ℳ of metabelian groups. We prove that 𝐺 is a product of a free metabelian subgroup …

В этой работе мы исследуем диофантовы проблемы в классических матричных группах
GLn (R), SLn (R), Tn (R), UTn (R), n⩾ 3, над ассоциативным кольцом с единицей R. Мы …

Abstract Famous Hilbert's Tenth problem asks whether there is an algorithm to solve
equations over integers. Negative answer to it (Matiyasevich-Robinson-Davis-Putnam …

АЮВеретенников, МАВеретенникова, “Об улучшенных оценках и условиях сходимости
для цепей Маркова”, Изв. РАН. Сер. матем., 86:1 (2022), 98–133; Izv. Math., 86:1 (2022) …