Hostname: page-component-89b8bd64d-nlwjb Total loading time: 0 Render date: 2026-05-09T08:33:17.639Z Has data issue: false hasContentIssue false

Classes of sets with large intersection

Published online by Cambridge University Press:  26 February 2010

K. J. Falconer
Affiliation:
School of Mathematics, University Walk, Bristol, BS8 1TW
Get access

Extract

If E1 and E2 are subsets of ℝn and a- is an isometry or similarity transformation, it is useful to be able to estimate the Hausdorff dimension of E1 ∩ σ(E2) in terms of the dimensions of E1 and E2. If E1 and E2 are compact, then, as σvaries, dim (El ∩ σ(E2)) is “in general” at most max (dim E1 + dim E2 − n, 0) and “often” at least this value (see Mattila [9] and Kahane [7] for more precise statements of these ideas). However, as we shall see, it is possible to construct non-compact sets E of any given dimension that are “sufficiently dense” in ℝn to ensure that dim (E ∩ σ(E)) = dim E for all similarities σ More generally, we shall show that for each s there are large classes of sets & of dimensions between s and n, closed under reasonable transformations including similarities, such that the intersection of any countable collection of sets in & has dimension at least s. Such collections of sets are required, for example, in the constructions of subsets of ℝn with certain dimensional properties given by Davies [1] and Falconer [5].

Information

Type
Research Article
Copyright
Copyright © University College London 1985

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable