2000 character limit reached
Purely Periodic and Transcendental Complex Continued Fractions
Published 21 May 2018 in math.NT | (1805.08007v4)
Abstract: Adolf Hurwitz proposed in 1887 a continued fraction algorithm for complex numbers: Hurwitz continued fractions (HCF). Among other similarities between HCF and regular continued fractions, quadratic irrational numbers over $\mathbb{Q}(i)$ are precisely those with periodic HCF expansions. In this paper, we give some necessary as well as some sufficient conditions for pure periodicity of HCF. Then, we characterize badly approximable complex numbers in terms of HCF. Finally, we prove a slightly weaker complex analogue of a theorem by Y. Bugeaud on the transcendence of certain continued fractions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.