2000 character limit reached
Groups with context-free Diophantine problem
Published 1 Feb 2021 in math.GR and cs.FL | (2102.00859v7)
Abstract: We find algebraic conditions on a group equivalent to the position of its Diophantine problem in the Chomsky Hierarchy. In particular, we prove that a finitely generated group has a context-free Diophantine problem if and only if it is finite.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.