arXiv · 2104.06741
Diophantine problems over $\mathbb{Z}^{ab}$ modulo prime numbers
Abstract
Let $\mathbb{Z}^{ab}$ be the ring of integers of $\mathbb{Q}^{ab}$, the maximal abelian extension of $\mathbb{Q}$. We show that there exists an algorithm to decide whether a system of equations and inequations, with integer coefficients, has a solution in $\mathbb{Z}^{ab}$ modulo every rational prime.
Explore related subjects
Keep this discovery
Kartas Konstantinos. 2021-04-14. Diophantine problems over $\mathbb{Z}^{ab}$ modulo prime numbers. https://arxiv.org/abs/2104.06741
Cite the original work for its findings. Save a collection to share your selection of sources.