Raney Transducers and the Lowest Point of the $p$-Lagrange spectrum

TL;DR

This paper investigates the lowest point of the $p$-Lagrange spectrum by developing an algorithm with Raney transducers to compute it, revealing interesting patterns and conjecturing its always finite termination.

Contribution

It introduces a novel algorithm using Raney transducers to compute the minimum of the $p$-Lagrange spectrum and explores its properties for various primes.

Findings

The algorithm computes $ ext{min} \, ext{L}_p$ for primes less than 2000.

$ ext{min} \, ext{L}_p$ is the square root of a rational number for these primes.

Highest values occur at Heegner primes 67, 3, and 163.

Abstract

It is well known that the golden ratio $\phi$ is the ''most irrational'' number in the sense that its best rational approximations $s/t$ have error $\sim 1/(\sqrt{5} t^2)$ and this constant $\sqrt{5}$ is as low as possible. Given a prime $p$, how can we characterize the reals $x$ such that $x$ and $p x$ are both ''very irrational''? This is tantamount to finding the lowest point of the $p$-Lagrange spectrum $\mathcal{L}_p$ as previously defined by the third author. We describe an algorithm using Raney transducers that computes $\min \mathcal{L}_p$ if it terminates, which we conjecture it always does. We verify that $\min \mathcal{L}_p$ is the square root of a rational number for primes $p < 2000$. Mysteriously, the highest values of $\min \mathcal{L}_p$ occur for the Heegner primes $67$, $3$, and $163$, and for all $p$, the continued fractions of the corresponding very irrational numbers $x$ and $p x$ are in one of three symmetric relations.