• Title/Summary/Keyword: $GCF_{\epsilon}$ expansion

Search Result 2, Processing Time 0.015 seconds

ON THE LARGE DEVIATION FOR THE GCF𝝐 EXPANSION WHEN THE PARAMETER 𝝐 ∈ [-1, 1]

  • Zhong, Ting
    • Journal of the Korean Mathematical Society
    • /
    • v.54 no.3
    • /
    • pp.835-845
    • /
    • 2017
  • The $GCF_{\epsilon}$ expansion is a new class of continued fractions induced by the transformation $T_{\epsilon}:(0, 1]{\rightarrow}(0, 1]$: $T_{\epsilon}(x)={\frac{-1+(k+1)x}{1+k-k{\epsilon}x}}$ for $x{\in}(1/(k+1),1/k]$. Under the algorithm $T_{\epsilon}$, every $x{\in}(0,1]$ corresponds to an increasing digits sequences $\{k_n,n{\geq}1\}$. Their basic properties, including the ergodic properties, law of large number and central limit theorem have been discussed in [4], [5] and [7]. In this paper, we study the large deviation for the $GCF_{\epsilon}$ expansion and show that: $\{{\frac{1}{n}}{\log}k_n,n{\geq}1\}$ satisfies the different large deviation principles when the parameter ${\epsilon}$ changes in [-1, 1], which generalizes a result of L. J. Zhu [9] who considered a case when ${\epsilon}(k){\equiv}0$ (i.e., Engel series).

HOW THE PARAMETER ε INFLUENCE THE GROWTH RATES OF THE PARTIAL QUOTIENTS IN GCFε EXPANSIONS

  • Zhong, Ting;Shen, Luming
    • Journal of the Korean Mathematical Society
    • /
    • v.52 no.3
    • /
    • pp.637-647
    • /
    • 2015
  • For generalized continued fraction (GCF) with parameter ${\epsilon}(k)$, we consider the size of the set whose partial quotients increase rapidly, namely the set $$E_{\epsilon}({\alpha}):=\{x{\in}(0,1]:k_{n+1}(x){\geq}k_n(x)^{\alpha}\;for\;all\;n{\geq}1\}$$, where ${\alpha}$ > 1. We in [6] have obtained the Hausdorff dimension of $E_{\epsilon}({\alpha})$ when ${\epsilon}(k)$ is constant or ${\epsilon}(k){\sim}k^{\beta}$ for any ${\beta}{\geq}1$. As its supplement, now we show that: $$dim_H\;E_{\epsilon}({\alpha})=\{\frac{1}{\alpha},\;when\;-k^{\delta}{\leq}{\epsilon}(k){\leq}k\;with\;0{\leq}{\delta}<1;\\\;\frac{1}{{\alpha}+1},\;when\;-k-{\rho}<{\epsilon}(k){\leq}-k\;with\;0<{\rho}<1;\\\;\frac{1}{{\alpha}+2},\;when\;{\epsilon}(k)=-k-1+\frac{1}{k}$$. So the bigger the parameter function ${\epsilon}(k_n)$ is, the larger the size of $E_{\epsilon}({\alpha})$ becomes.