Enumerating orders in number fields
Markus Kirschmer, J\"urgen Kl\"uners

TL;DR
This paper introduces a tree structure to systematically enumerate all orders within a number field, including those of bounded index and over specific orders, facilitating comprehensive analysis.
Contribution
It presents a novel tree-based method for enumerating all orders in a number field, extending to bounded index and specific base orders.
Findings
Efficient enumeration of orders in algebraic number fields.
Framework applicable to orders of bounded index and over given orders.
Provides a systematic approach to explore the structure of orders.
Abstract
We arrange the orders in an algebraic number field in a tree. This tree can be used to enumerate all orders of bounded index in the maximal order as well as the orders over some given order.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Analytic Number Theory Research · Coding theory and cryptography
