Papers
Topics
Authors
Recent
Search
2000 character limit reached

Totally p-adic Numbers of Degree 3

Published 3 Sep 2020 in math.NT | (2009.01795v1)

Abstract: The height of an algebraic number $\alpha$ is a measure of how arithmetically complicated $\alpha$ is. We say $\alpha$ is totally $p$-adic if the minimal polynomial of $\alpha$ splits completely over the field $\mathbb{Q}_p$ of $p$-adic numbers. In this paper, we investigate what can be said about the smallest nonzero height of a degree $3$ totally $p$-adic number. In particular, we provide an algorithm to determine, given a prime $p$, the smallest height of a degree $3$ totally $p$-adic number.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

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

Collections

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