Papers
Topics
Authors
Recent
2000 character limit reached

Heights and transcendence of $p$--adic continued fractions

Published 8 Feb 2023 in math.NT | (2302.04017v6)

Abstract: Special kinds of continued fractions have been proved to converge to transcendental real numbers by means of the celebrated Subspace Theorem. In this paper we study the analogous $p$--adic problem. More specifically, we deal with Browkin $p$--adic continued fractions. First we give some new remarks about the Browkin algorithm in terms of a $p$--adic Euclidean algorithm. Then, we focus on the heights of some $p$--adic numbers having a periodic $p$--adic continued fraction expansion and we obtain some upper bounds. Finally, we exploit these results, together with $p$--adic Roth-like results, in order to prove the transcendence of two families of $p$--adic continued fractions.

Citations (1)

Summary

Paper to Video (Beta)

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.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.