Search arXivSearch

arXiv · 1802.09378

Decreasing height along continued fractions

Abstract

The fact that the euclidean algorithm eventually terminates is pervasive in mathematics. In the language of continued fractions, it can be stated by saying that the orbits of rational points under the Gauss map x-->{1/x} eventually reach zero. Analogues of this fact for Gauss maps defined over quadratic number fields have relevance in the theory of flows on translation surfaces, and have been established via powerful machinery, ultimately relying on the Veech dichotomy. In this paper, for each commensurability class of noncocompact triangle groups of quadratic invariant trace field, we construct a Gauss map whose defining matrices generate a group in the class; we then provide a direct and self-contained proof of termination. As a byproduct, we provide a new proof of the fact that noncocompact triangle groups of quadratic invariant trace field have the projective line over that field as the set of cross-ratios of cusps. Our proof is based on an analysis of the action of nonnegative matrices with quadratic integer entries on the Weil height of points. As a consequence of the analysis, we show that long symbolic sequences in the alphabet of our maps can be effectively split into blocks of predetermined shape having the property that the height of points which obey the sequence and belong to the base field decreases strictly at each block end. Since the height cannot decrease infinitely, the termination property follows.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Giovanni Panti. 2018-06-26. Decreasing height along continued fractions. https://doi.org/10.1017/etds.2018.55

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Monotonicity, global symplectification and the stability of Dry Ten Martini Problem

We prove that, for every irrational frequency and every analytic Type I potential, each supercritical spectral energy satisfying the gap-labelling condition is an endpoint of an open spectral gap. This establishes the conjecture of Ge--Jitomirskaya--You \cite{GJY,You} in the supercritical regime. Consequently, the ``all gaps open'' property of the supercritical almost Mathieu operator persists under sufficiently small analytic perturbations. The main ingredient is a global symplectification of the center bundle that preserves quantitative monotonicity. This allows us to study gap opening through the center dynamics of the dual long-range operator, which has no natural Schrödinger form. We first establish the result for trigonometric polynomial potentials and then pass to general analytic potentials by controlling the dependence on the truncation dimension. The proof combines a discrete Hellmann--Feynman identity, dimension-free Aubry duality in weighted analytic norms, and a quantitative cone argument based on pre-monotonicity. These estimates ensure that the gaps survive in the analytic limit. Our results establish analytic stability of the Dry Ten Martini Problem in the supercritical regime and give a partial answer to a question of M. Shamis on the persistence of periodic spectral gaps.

math.DS

Asymmetry of a class of Mellin transforms via bounded solutions

We introduce a family of parametrized non-homogeneous linear complex differential equations on $[1,\infty)$, depending on a complex parameter $s$ in the critical strip. We identify sufficient conditions on the non-homogeneous term that induce a structural asymmetry between the solutions corresponding to the parameters $s$ and $1-s$. More precisely, if both solutions with initial value $1$ are bounded on $[1,\infty)$, then necessarily $\Re(s)=\tfrac12$. The initial condition associated with the unique bounded solution corresponding to a parameter $s$ represents a zero of the Mellin transform associated with the non-homogeneous term at the point $s$.

math.DS

Self-similar Delone sets and Pisot numbers

We consider Delone point patterns with self-similarity. Under mild conditions, the similarity factor is a Pisot number if and only if the pattern is uniformly discrete. The classical case is a Meyer set $Λ$ with $Λ\supset θΛ$ for some $θ>1,$ for which $θ$ must be a Pisot number or a Salem number. When $Λ$ contains several similar copies of itself, the case of a Salem number drops out for $θ<2.$ On the other hand, strictly self-similar patterns with a Pisot factor must be Meyer sets. Various examples are given.

math.DS