Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 79 tok/s
Gemini 2.5 Pro 55 tok/s Pro
GPT-5 Medium 27 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 85 tok/s Pro
GPT OSS 120B 431 tok/s Pro
Kimi K2 186 tok/s Pro
2000 character limit reached

Euclidean ideal classes in Galois number fields of odd prime degree (2209.04809v1)

Published 11 Sep 2022 in math.NT

Abstract: Weinberger in 1972, proved that the ring of integers of a number field with unit rank at least $1$ is a principal ideal domain if and only if it is a Euclidean domain, provided the generalised Riemann hypothesis holds. Lenstra extended the notion of Euclidean domains in order to capture Dedekind domains with finite cyclic class group and proved an analogous theorem in this setup. More precisely, he showed that the class group of the ring of integers of a number field with unit rank at least $1$ is cyclic if and only if it has a Euclidean ideal class, provided the generalised Riemann hypothesis holds. The aim of this paper is to show the following. Suppose that $\mathbf{K}_1$ and $\mathbf{K}_2$ are two Galois number fields of odd prime degree with cyclic class groups and Hilbert class fields that are abelian over $\mathbb{Q}$. If $\mathbf{K}_1\mathbf{K}_2$ is ramified over $\mathbf{K}_i$, then at least one $\mathbf{K}_i$ ($i \in {1,2}$) must have a Euclidean ideal class.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.