
TL;DR
This paper investigates the minimal height of degree 3 totally p-adic algebraic numbers and provides an algorithm to compute this minimal height for any prime p.
Contribution
It introduces a novel algorithm to determine the smallest height of degree 3 totally p-adic numbers for a given prime p.
Findings
Algorithm successfully computes minimal heights for various primes p.
Provides insights into the distribution of heights among degree 3 totally p-adic numbers.
Establishes bounds and properties related to the height of these algebraic numbers.
Abstract
The height of an algebraic number is a measure of how arithmetically complicated is. We say is totally -adic if the minimal polynomial of splits completely over the field of -adic numbers. In this paper, we investigate what can be said about the smallest nonzero height of a degree totally -adic number. In particular, we provide an algorithm to determine, given a prime , the smallest height of a degree totally -adic number.
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.
