Continued fractions over non-Euclidean imaginary quadratic rings (1908.00121v4)
Abstract: We propose and study a generalized continued fraction algorithm that can be executed in an arbitrary imaginary quadratic field, the novelty being a non-restriction to the five Euclidean cases. Many haLLMark properties of classical continued fractions are shown to be retained, including exponential convergence, best-of-the-second-kind approximation quality (up to a constant), periodicity of quadratic irrational expansions, and polynomial time complexity.
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.