An \(\ell -p\) switch trick to obtain a new proof of a criterion for arithmetic equivalence
- 15 Downloads
Two number fields are called arithmetically equivalent if they have the same Dedekind zeta function. In the 1970s Perlis showed that this is equivalent to the condition that for almost every rational prime \(\ell \) the arithmetic type of \(\ell \) is the same in each field. In the 1990s Perlis and Stuart gave an unexpected characterization for arithmetic equivalence; they showed that to be arithmetically equivalent it is enough for almost every prime \(\ell \) to have the same number of prime factors in each field. Here, using an \(\ell -p\) switch trick, we provide an alternative proof of that fact based on a classical elementary result of Smith from the 1870s.
We would like to thank the referee for the careful reading of the paper, and specially for point it out a flaw in an argument of a previous version of the proof of Lemma 2.1.
- 4.Mantilla-Soler, G.: On a question of Perlis and Stuart regarding arithmetic equivalence. arXiv:1807.03243 (preprint)
- 9.Smith, H.J.S.: On the value of a certain arithmetical determinant. In: Proceedings of the London Mathematical Society, vol. 1(1), pp. 208–213. Oxford University Press, Oxford (1875)Google Scholar