Available in electronic format
Available in print format
Proceedings of the American Mathematical Society
Proceedings of the American Mathematical Society
ISSN 1088-6826 (e) ISSN 0002-9939 (p)
     

Continued fractions and heavy sequences

Author(s): Michael Boshernitzan; David Ralston
Journal: Proc. Amer. Math. Soc. 137 (2009), 3177-3185.
MSC (2000): Primary 11K38, 11J71, 37A30
Posted: May 15, 2009
Retrieve article in: PDF

Abstract | References | Similar articles | Additional information

Abstract: We initiate the study of the sets $ \mathcal{H}(c)$, $ 0<c<1$, of real $ x$ for which the sequence $ (kx)_{k\geq1}$ (viewed mod 1) consistently hits the interval $ [0,c)$ at least as often as expected (i. e., with frequency $ \geq c$). More formally,

$\displaystyle \mathcal{H}(c) \stackrel{\text{def}}{=} \big\{\alpha\in \mathbb{... ...n\mid \langle k\alpha\rangle <c\}\big)\geq cn, \text{ for all } n\geq1\big\}, $

where $ \langle x\rangle =x-[x]$ stands for the fractional part of $ x\in\mathbb{R}$.

We prove that, for rational $ c$, the sets $ \mathcal{H}(c)$ are of positive Hausdorff dimension and, in particular, are uncountable. For integers $ m\geq1$, we obtain a surprising characterization of the numbers $ \alpha\in\mathcal{H}_m \stackrel{\text{def}}{=} \mathcal{H}(\tfrac1m)$ in terms of their continued fraction expansions: The odd entries (partial quotients) of these expansions are divisible by $ m$. The characterization implies that $ x\in\mathcal{H}_m$ if and only if $ \frac 1{mx} \in\mathcal{H}_m$, for $ x>0$. We are unaware of a direct proof of this equivalence without making use of the mentioned characterization of the sets $ \mathcal{H}_m$.

We also introduce the dual sets $ \widehat{\mathcal{H}}_m$ of reals $ y$ for which the sequence of integers $ \big([ky]\big)_{k\geq1}$ consistently hits the set $ m\mathbb{Z}$ with the at least expected frequency $ \frac1m$ and establish the connection with the sets $ \mathcal{H}_m$:

\begin{displaymath}\text{ If $xy=m$ for $x,y>0$, then $x\in\mathcal{H}_m\iff y\in\widehat{\mathcal{H}}_m$.} \end{displaymath}

The motivation for the present study comes from Y. Peres's ergodic lemma.


References:

1.
Y. Dupain, T. Vera Sós, On the one-sided boundedness of discrepancy-function of the sequence $ \{n\alpha\}$, Acta Arith. 37 (1980), 363-374. MR 598889 (82c:10058)

2.
K. Falconer, Fractal Geometry: Mathematical Foundations and Applications, John Wiley & Sons, Ltd., 1990. MR 1102677 (92j:28008)

3.
H. Furstenberg, Recurrence in ergodic theorem and combinatorial number theory, Princeton University Press, 1981. MR 603625 (82j:28010)

4.
A. Y. Khinchin, Continued Fractions, The University of Chicago Press, 1964. MR 0161833 (28:5037)

5.
S. Lang, Introduction to Diophantine Approximations, Springer-Verlag, 1995. MR 1348400 (96h:11067)

6.
Y. Peres, A combinatorial application of the maximal ergodic theorem, Bull. London Math. Soc. 20 (1988), 248-252. MR 931186 (89e:28033)

7.
D. Ralston, Heaviness--An Extension of a Lemma of Y. Peres, Houston Journal of Mathematics. To appear.


Similar Articles:

Retrieve articles in Proceedings of the American Mathematical Society with MSC (2000): 11K38, 11J71, 37A30

Retrieve articles in all Journals with MSC (2000): 11K38, 11J71, 37A30


Additional Information:

Michael Boshernitzan
Affiliation: Department of Mathematics, Rice University, Houston, Texas 77005
Email: michael@rice.edu

David Ralston
Affiliation: Department of Mathematics, Rice University, Houston, Texas 77005
Address at time of publication: Department of Mathematics, Ohio State University, 231 W. 18th Avenue, Columbus, Ohio 43210

DOI: 10.1090/S0002-9939-09-09625-7
PII: S 0002-9939(09)09625-7
Received by editor(s): October 24, 2007,
Received by editor(s) in revised form: March 7, 2008
Posted: May 15, 2009
Additional Notes: The second author was supported in part by NSF VIGRE grant DMS-0240058.
Communicated by: Michael T. Lacey
Copyright of article: Copyright 2009, American Mathematical Society
The copyright for this article reverts to public domain after 28 years from publication.


  AMS Website Logo Small Comments: webmaster@ams.org
© Copyright 2009, American Mathematical Society
Privacy Statement
Search the AMSPowered by Google