On the relative grid dimension of continuous functions (Q1803960): Difference between revisions

The author is concerned with the following problem on the upper box counting dimension of subsets \(E\) of the unit square \(S=[0,1]\times [0,1]\): For a given subsequence of natural numbers \(\nu(n)\) with \(n=1,2,\dots\) consider the set of elementary closed squares of the regular \(\nu(n)\times\nu(n)\) subdivision of \(S\), called the \(\nu(n)\)-th grid \(G_{\nu(n)}\), and let \(N(E,\nu(n))\) denote the number of elements of \(G_{\nu(n)}\) which meet \(E\subseteq S\). The grid dimension \(\alpha_ \nu(E)\) of \(E\) relative to the given sequence \(\nu\) is \[ \alpha_ \nu(E)=\limsup_{n\to\infty}{\log N(E,\nu(n))\over\log\nu(n)}. \] For \(\nu(n)=n\) one obtains the upper box counting dimension \(\alpha(E)\). What kind of growth condition on \(\nu\) ensure that \(\alpha_ \nu(E)=\alpha(E)\)? The author has found the following answers: 1. The condition \[ \lim_{n\to\infty} {\log\nu(n+1)\over\log\nu(n)}=1 \] is sufficient for every \(E\subseteq S\). 2. If \(\nu(n)\) satisfies \[ r=\limsup_{n\to\infty}{\log\nu(n+1)\over\log\nu(n)}>1 \] then for every \(\varepsilon>0\) there exists a continuous graph \(\Gamma_ f\) such that \[ \alpha(\Gamma_ f)\geq \alpha_ \nu(\Gamma_ f)+{\sqrt r- 1\over\sqrt r+1}-\varepsilon. \] 3. If one allows any set \(E\subseteq S\) instead of a continuous graph \(\Gamma_ f\) then there exists a set \(E=C\times C\) \((C\) is some Cantor set) such that \[ \alpha(E)=\alpha_ \nu(E)+{r-1\over r+1} \] with \(r\) as in the second item. The last statement is due to his referee. The author asks whether the last statement is also true for some graph of a continuous function.