Diophantine problems over $\mathbb{Z}^{ab}$ modulo prime numbers
Number Theory
2021-04-15 v1 Logic
Abstract
Let be the ring of integers of , the maximal abelian extension of . We show that there exists an algorithm to decide whether a system of equations and inequations, with integer coefficients, has a solution in modulo every rational prime.
Cite
@article{arxiv.2104.06741,
title = {Diophantine problems over $\mathbb{Z}^{ab}$ modulo prime numbers},
author = {Kartas Konstantinos},
journal= {arXiv preprint arXiv:2104.06741},
year = {2021}
}