Searcharxiv⌕ Search

arXiv subjects

Jonathan M. Fraser

Publications and source records attributed to Jonathan M. Fraser.

At least 91 records · Page 5Linked to original sources

Dimensions of sets which uniformly avoid arithmetic progressions

We provide estimates for the dimensions of sets in $\mathbb{R}$ which uniformly avoid finite arithmetic progressions. More precisely, we say $F$ uniformly avoids arithmetic progressions of length $k \geq 3$ if there is an $ε>0$ such that one cannot find an arithmetic progression of length $k$ and gap length $Δ>0$ inside the $εΔ$ neighbourhood of $F$. Our main result is an explicit upper bound for the Assouad (and thus Hausdorff) dimension of such sets in terms of $k$ and $ε$. In the other direction, we provide examples of sets which uniformly avoid arithmetic progressions of a given length but still have relatively large Hausdorff dimension. We also consider higher dimensional analogues of these problems, where arithmetic progressions are replaced with arithmetic patches lying in a hyperplane. As a consequence we obtain a discretised version of a `reverse Kakeya problem': we show that if the dimension of a set in $\mathbb{R}^d$ is sufficiently large, then it closely approximates arithmetic progressions in every direction.

math.CA↗

Some results in support of the Kakeya Conjecture

A Besicovitch set is a subset of $\R^d$ that contains a unit line segment in every direction and the famous Kakeya conjecture states that Besicovitch sets should have full dimension. We provide a number of results in support of this conjecture in a variety of contexts. Our proofs are simple and aim to give an intuitive feel for the problem. For example, we give a very simple proof that the packing and lower box-counting dimension of any Besicovitch set is at least $(d+1)/2$ (better estimates are available in the literature). We also study the `generic validity' of the Kakeya conjecture in the setting of Baire Category and prove that typical Besicovitch sets have full upper box-counting dimension. We also study a weaker version of the Kakeya problem where unit line segments are replaced by half-infinite lines. We prove that such `half-extended Besicovitch sets' have full Assouad dimension. This can be viewed as full resolution of a (much weakened) version of the Kakeya problem.

math.CA↗

The Assouad dimension of self-affine carpets with no grid structure

Previous study of the Assouad dimension of planar self-affine sets has relied heavily on the underlying IFS having a `grid structure', thus allowing for the use of approximate squares. We study the Assouad dimension of a class of self-affine carpets which do not have an associated grid structure. We find that the Assouad dimension is related to the box and Assouad dimensions of the (self-similar) projection of the self-affine set onto the first coordinate and to the local dimensions of the projection of a natural Bernoulli measure onto the first coordinate. In a special case we relate the Assouad dimension of the Przytycki-Urbański sets to the lower local dimensions of Bernoulli convolutions.

math.CA↗

Assouad type spectra for some fractal families

In a previous paper we introduced a new `dimension spectrum', motivated by the Assouad dimension, designed to give precise information about the scaling structure and homogeneity of a metric space. In this paper we compute the spectrum explicitly for a range of well-studied fractal sets, including: the self-affine carpets of Bedford and McMullen, self-similar and self-conformal sets with overlaps, Mandelbrot percolation, and Moran constructions. We find that the spectrum behaves differently for each of these models and can take on a rich variety of forms. We also consider some applications, including the provision of new bi-Lipschitz invariants and bounds on a family of `tail densities' defined for subsets of the integers.

math.CA↗

The Assouad dimensions of projections of planar sets

We consider the Assouad dimensions of orthogonal projections of planar sets onto lines. Our investigation covers both general and self-similar sets. For general sets, the main result is the following: if a set in the plane has Assouad dimension $s \in [0,2]$, then the projections have Assouad dimension at least $\min\{1,s\}$ almost surely. Compared to the famous analogue for Hausdorff dimension -- namely \emph{Marstrand's Projection Theorem} -- a striking difference is that the words `at least' cannot be dispensed with: in fact, for many planar self-similar sets of dimension $s < 1$, we prove that the Assouad dimension of projections can attain both values $s$ and $1$ for a set of directions of positive measure. For self-similar sets, our investigation splits naturally into two cases: when the group of rotations is discrete, and when it is dense. In the `discrete rotations' case we prove the following dichotomy for any given projection: either the Hausdorff measure is positive in the Hausdorff dimension, in which case the Hausdorff and Assouad dimensions coincide; or the Hausdorff measure is zero in the Hausdorff dimension, in which case the Assouad dimension is equal to 1. In the `dense rotations' case we prove that every projection has Assouad dimension equal to one, assuming that the planar set is not a singleton. As another application of our results, we show that there is no \emph{Falconer's Theorem} for Assouad dimension. More precisely, the Assouad dimension of a self-similar (or self-affine) set is not in general almost surely constant when one randomises the translation vectors.

math.CA↗

Assouad type dimensions for self-affine sponges

We study the Assouad and lower dimensions of self-affine sponges; the higher dimensional analogue of the planar self-affine carpets of Bedford and McMullen. Our techniques involve the weak tangents of Mackay and Tyson as well as regularity properties of doubling measures in the context studied by Bylund and Gudayol.

math.MG↗

Quantifying inhomogeneity in fractal sets

An inhomogeneous fractal set is one which exhibits different scaling behaviour at different points. The Assouad dimension of a set is a quantity which finds the `most difficult location and scale' at which to cover the set and its difference from box dimension can be thought of as a first-level overall measure of how inhomogeneous the set is. For the next level of analysis, we develop a quantitative theory of inhomogeneity by considering the measure of the set of points around which the set exhibits a given level of inhomogeneity at a certain scale. For a set of examples, a family of $(\times m, \times n)$-invariant subsets of the 2-torus, we show that this quantity satisfies a Large Deviations Principle. We compare members of this family, demonstrating how the rate function gives us a deeper understanding of their inhomogeneity.

math.DS↗

Inhomogeneous self-similar sets with overlaps

It is known that if the underlying iterated function system satisfies the open set condition, then the upper box dimension of an inhomogeneous self-similar set is the maximum of the upper box dimensions of the homogeneous counterpart and the condensation set. First, we prove that this `expected formula' does not hold in general if there are overlaps in the construction. We demonstrate this via two different types of counterexample: the first is a family of overlapping inhomogeneous self-similar sets based upon Bernoulli convolutions; and the second applies in higher dimensions and makes use of a spectral gap property that holds for certain subgroups of $SO(d)$ for $d\geq 3$. We also obtain new upper bounds for the upper box dimension of an inhomogeneous self-similar set which hold in general. Moreover, our counterexamples demonstrate that these bounds are optimal. In the final section we show that if the \emph{weak separation property} is satisfied, ie. the overlaps are controllable, then the `expected formula' does hold.

math.CA↗

On the equality of Hausdorff measure and Hausdorff content

We are interested in situations where the Hausdorff measure and Hausdorff content of a set are equal in the critical dimension. Our main result shows that this equality holds for any subset of a self-similar set corresponding to a nontrivial cylinder of an irreducible subshift of finite type, and thus also for any self-similar or graph-directed self-similar set, regardless of separation conditions. The main tool in the proof is an exhaustion lemma for Hausdorff measure based on the Vitali Covering Theorem. We also give several examples showing that one cannot hope for the equality to hold in general if one moves in a number of the natural directions away from `self-similar'. For example, it fails in general for self-conformal sets, self-affine sets and Julia sets. We also give applications of our results concerning Ahlfors regularity. Finally we consider an analogous version of the problem for packing measure. In this case we need the strong separation condition and can only prove that the packing measure and $δ$-approximate packing pre-measure coincide for sufficiently small $δ>0$.

math.MG↗

The Assouad dimension of randomly generated fractals

We consider several different models for generating random fractals including random self-similar sets, random self-affine carpets, and fractal percolation. In each setting we compute either the \emph{almost sure} or the \emph{Baire typical} Assouad dimension and consider some illustrative examples. Our results reveal a common phenomenon in all of our models: the Assouad dimension of a randomly generated fractal is generically as big as possible and does not depend on the measure theoretic or topological structure of the sample space. This is in stark contrast to the other commonly studied notions of dimension like the Hausdorff or packing dimension.

math.MG↗

Remarks on the analyticity of subadditive pressure for products of triangular matrices

We study Falconer's subadditive pressure function with emphasis on analyticity. We begin by deriving a simple closed form expression for the pressure in the case of diagonal matrices and, by identifying phase transitions with zeros of Dirichlet polynomials, use this to deduce that the pressure is piecewise real analytic. We then specialise to the iterated function system setting and use a result of Falconer and Miao to extend our results to include the pressure for systems generated by matrices which are simultaneously triangularisable. Our closed form expression for the pressure simplifies a similar expression given by Falconer and Miao by reducing the number of equations needing to be solved by an exponential factor. Finally we present some examples where the pressure has a phase transition at a non-integer value and pose some open questions.

math.DS↗

Uniform scaling limits for ergodic measures

We prove that ergodic measures on one-sided shift spaces are uniformly scaling in the sense of Gavish. That is, given a shift ergodic measure we prove that at almost every point the scenery distributions weakly converge to a common distribution on the space of measures. Moreover, we give an explicit description of the limiting distribution in terms of a `reverse Jacobian' function associated with the corresponding measure on the space of left infinite sequences.

math.DS↗

First and second moments for self-similar couplings and Wasserstein distances

We study aspects of the Wasserstein distance in the context of self-similar measures. Computing this distance between two measures involves minimising certain moment integrals over the space of \emph{couplings}, which are measures on the product space with the original measures as prescribed marginals. We focus our attention on self-similar measures associated to equicontractive iterated function systems satisfying the open set condition and consisting of two maps on the unit interval. We are particularly interested in understanding the restricted family of \emph{self-similar} couplings and our main achievement is the explicit computation of the 1st and 2nd moment integrals for such couplings. We show that this family is enough to yield an explicit formula for the 1st Wasserstein distance and provide non-trivial upper and lower bounds for the 2nd Wasserstein distance.

math.FA↗

A note on the 1-prevalence of continuous images with full Hausdorff dimension

We consider the Banach space consisting of real-valued continuous functions on an arbitrary compact metric space. It is known that for a prevalent (in the sense of Hunt, Sauer and Yorke) set of functions the Hausdorff dimension of the image is as large as possible, namely 1. We extend this result by showing that `prevalent' can be replaced by `1-prevalent', i.e. it is possible to \emph{witness} this prevalence using a measure supported on a one dimensional subspace. Such one dimensional measures are called \emph{probes} and their existence indicates that the structure and nature of the prevalence is simpler than if a more complicated `infinite dimensional' witnessing measure has to be used.

math.MG↗

On the $L^q$-spectrum of planar self-affine measures

We study the dimension theory of a class of planar self-affine multifractal measures. These measures are the Bernoulli measures supported on box-like self-affine sets, introduced by the author, which are the attractors of iterated function systems consisting of contracting affine maps which take the unit square to rectangles with sides parallel to the axes. This class contains the self-affine measures recently considered by Feng and Wang as well as many other measures. In particular, we allow the defining maps to have non-trivial rotational and reflectional components. Assuming the rectangular open set condition, we compute the $L^q$-spectrum by means of a $q$-modified singular value function. A key application of our results is a \emph{closed form expression} for the $L^q$-spectrum in the case where there are no mappings that switch the coordinate axes. This is useful for computational purposes and also allows us to prove differentiability of the $L^q$-spectrum at $q=1$ in the more difficult `non-multiplicative' situation. This has applications concerning the Hausdorff, packing and entropy dimension of the measure as well as the Hausdorff and packing dimension of the support. Due to the possible inclusion of axis reversing maps, we are led to extend some results of Peres and Solomyak on the existence of $L^q$-spectrum of self-similar measures to the graph-directed case.

math.DS↗

Inhomogeneous self-affine carpets

We investigate the dimension theory of inhomogeneous self-affine carpets. Through the work of Olsen, Snigireva and Fraser, the dimension theory of inhomogeneous self-similar sets is now relatively well-understood, however, almost no progress has been made concerning more general non-conformal inhomogeneous attractors. If a dimension is countably stable, then the results are immediate and so we focus on the upper and lower box dimensions and compute these explicitly for large classes of inhomogeneous self-affine carpets. Interestingly, we find that the `expected formula' for the upper box dimension can fail in the self-affine setting and we thus reveal new phenomena, not occurring in the simpler self-similar case.

math.MG↗

On Fourier analytic properties of graphs

We study the Fourier dimensions of graphs of real-valued functions defined on the unit interval [0,1]. Our results imply that the graph of the fractional Brownian motion is almost surely not a Salem set, answering in part a question of Kahane from 1993, and that the graph of a Baire typical function in C[0,1] has Fourier dimension zero.

math.CA↗