Search arXiv⌕ Search

arXiv · 2611.10081

A singular homeomorphism between Pierce expansions and continued fraction expansions

Abstract

In this paper, we study the map $Θ$ which sends each $x\in[0,1]$ to the number whose continued fraction digits are the first Pierce expansion digit of $x$ and the gaps between two consecutive Pierce expansion digits of $x$. We investigate the regularity of $Θ$ and $Θ^{-1}$, including the optimal Hölder exponent of $Θ^{-1}$, and the local and Hausdorff dimensions of the push-forwards of the Lebesgue measure under $Θ$ and $Θ^{-1}$. We also study the differentiability of $Θ$ at rational and irrational points, and calculate the Hausdorff dimension of the set of points at which $Θ$ has an infinite derivative.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Min Woong Ahn. 2026-11-06. A singular homeomorphism between Pierce expansions and continued fraction expansions. https://arxiv.org/abs/2611.10081

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

KEEP EXPLORING

Related papers

A note on polynomial sequences modulo integers (revised version)

For a real polynomial $P(x)$ we study the integer sequence $λ(P)=(\lfloor P(k) \rfloor)_{k\ge1}$ modulo integers. We show that for nonlinear $P$ the sequence $λ(P)$ is uniformly distributed (u.d.) in $\mathbb{Z}$ if and only if $P$ has an irrational coefficient other than the constant term. In fact, if all non-constant coefficients of a nonlinear $P$ are rational, then $λ(P)$ fails to be u.d.\ modulo every prime in a set of primes of positive density. We also study completeness: $P$ is complete modulo $m$ if $\lfloor P(x) \rfloor$ meets every residue class modulo $m$. For $P$ of even degree we prove that $λ(P)$ meets every residue class modulo every integer if and only if $P$ has an irrational non-constant coefficient. The same holds for every polynomial $P(x)=ax^n+c$ with $n\ge2$, and for every nonlinear $P$ with $P(x)-P(0)\in\mathbb{Z}[x]$. For linear $P$, both properties are characterized completely, and the two notions differ.

math.NT↗

Qin's Algorithm, Continued Fractions and 2-dimensional Lattices

In his ``Mathematical Treatise in Nine Sections''(1247), Jiushao Qin introduced ``the Dayan method of deriving unity'' for computing modular inverses, an essential component of his treatment of the Chinese remainder theorem. A distinctive feature of Qin's algorithm is its use of a state consisting of four nonnegative integers arranged in a matrix. In this paper, we investigate the mathematical structure of these states and their connections with continued fractions and two-dimensional lattices. By introducing a signed version of the state, we obtain a natural matrix representation that reveals the convergents of continued fractions and gives direct derivations of several classical results. We then show that the signed states form bases of a family of two-dimensional lattices arising from modular congruences. In particular, we prove that a shortest lattice vector can be obtained from the rows of a signed state or their sum or difference. We also study the monotonicity of the inner products of the state vectors and discuss a subsequent result that locates a shortest vector in one of two consecutive states. It is surprising that a shortest lattice vector is found in a highly structure sequence of states. These results demonstrate that the state structure of Qin's algorithm provides a unified framework for understanding modular inversion, continued fractions, and shortest vectors in two-dimensional lattices.

math.NT↗