We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We show that the Hausdorff dimension of any slice of the graph of the Takagi function is bounded above by the Assouad dimension of the graph minus one, and that the bound is sharp. The result is deduced from a statement on more general self-affine sets, which is of independent interest. We also prove that Marstrand’s slicing theorem on the graph of the Takagi function extends to all slices if and only if the upper pointwise dimension of every projection of the length measure on the x-axis lifted to the graph is at least one.
We prove that the continuous function${\rm{\hat \Omega }}:2^\omega \to $ that is defined via$X \mapsto \mathop \sum \limits_n 2^{ - K\left( {Xn} \right)} $ for all $X \in {2^\omega }$ is differentiable exactly at the Martin-Löf random reals with the derivative having value 0; that it is nowhere monotonic; and that $\mathop \smallint \nolimits _0^1{\rm{\hat{\Omega }}}\left( X \right)\,{\rm{d}}X$ is a left-c.e. $wtt$-complete real having effective Hausdorff dimension ${1 / 2}$.
We further investigate the algorithmic properties of ${\rm{\hat{\Omega }}}$. For example, we show that the maximal value of ${\rm{\hat{\Omega }}}$ must be random, the minimal value must be Turing complete, and that ${\rm{\hat{\Omega }}}\left( X \right) \oplus X{ \ge _T}\emptyset \prime$ for every X. We also obtain some machine-dependent results, including that for every $\varepsilon > 0$, there is a universal machine V such that ${{\rm{\hat{\Omega }}}_V}$ maps every real X having effective Hausdorff dimension greater than ε to a real of effective Hausdorff dimension 0 with the property that $X{ \le _{tt}}{{\rm{\hat{\Omega }}}_V}\left( X \right)$; and that there is a real X and a universal machine V such that ${{\rm{\Omega }}_V}\left( X \right)$ is rational.
A formula for the interior $\varepsilon$-neighborhood of the classical von Koch snowflake curve is computed in detail. This function of $\varepsilon$ is shown to match quite closely with earlier predictions of what it should be, but is also much more precise. The resulting ‘tube formula’ is expressed in terms of the Fourier coefficients of a suitable nonlinear and periodic analog of the standard Cantor staircase function and reflects the self-similarity of the Koch curve. As a consequence, the possible complex dimensions of the Koch snowflake are computed explicitly.
We give an elementary proof of the theorem of Saks that states that most functions in C[0, 1] have infinite unilateral derivatives at a continuum many points.
Pour chaque nombre α de (0, 1), nous construisons une fonction f qui est lipschitzienne d'ordre α et dont le reste Rn(f) par l'application de la règle du trapèze est précisément égal à 1/n lorsque n est une puissance entière et arbitraire de 2.
We construct an explicit continuous function F such that for each point x, every extended real number is a derived number of F at x and F has an infinite left and an infinite right derived number at x.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.