Counting rational points close to p-adic integers and applications in Diophantine approximation

Abstract

We find upper and lower bounds on the number of rational points that are -approximations of some n-dimensional p-adic integer. Lattice point counting techniques are used to find the upper bound result, and a Pigeon-hole principle style argument is used to find the lower bound result. We use these results to find the Hausdorff dimension for the set of p-adic weighted simultaneously approximable points intersected with p-adic coordinate hyperplanes. For the lower bound result we show that the set of rational points that τ-approximate a p-adic integer form a set of resonant points that can be used to construct a local ubiquitous system of rectangles.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…