Undecidability of the Diophantine problem for one-relator groups and one-relation monoids
Carl-Fredrik Nyberg-Brodda
Abstract
We prove that the Diophantine problem, i.e. the problem of solving equations with coefficients, in one-relator groups and one-relation monoids is undecidable in general. Specifically, we show that for all d ≥ 2, the Diophantine problem for the Baumslag-Gersten group Bd = BG(1,d) and for a closely related one-relation monoid Md are both undecidable. Both results are obtained by an encoding of a recent undecidability result due to Rybalov.
Create a lesson
Related papers
An order automorphism of a Dlab group not induced by conjugation
Ting Gong, Yong Yang, Michael Ruofan Zeng
Finite groups with large power-avoiding subsets
Simon R. Blackburn, Sarah B. Hart, Daniel McVeagh
Involution and Commutator Length in PU(n,1)
Zhongqi Wang, Shihai Yang
Quandles associated with group actions
Ryoya Kai
Uncountably many local isomorphism types of compactly generated simple groups
Ilaria Castellano, Jorge Fariña-Asategui, Mikel Eguzki Garciarena et al.
A classification of finite simply reducible groups of order at most 2000
Yongzhi Luan