Hostname: page-component-6898cfcb55-cbk24 Total loading time: 0 Render date: 2026-11-11T04:49:12.036Z Has data issue: false hasContentIssue false

Regular and ubiquitous systems, and ℳs∞-dense sequences

Published online by Cambridge University Press:  26 February 2010

Bryan P. Rynne
Affiliation:
Department of Mathematics, Heriot-Watt University, Riccarton, Edinburgh. EH14 4AS.
Get access

Abstract

“Regular systems” of numbers in ℝ and “ubiquitous systems” in ℝk, k ≥ 1, have been used previously to obtain lower bounds for the Hausdorff dimension of various sets in ℝ and ℝk respectively. Both these concepts make sense for systems of numbers in ℝ, but the definitions of the two types of object are rather different. In this paper it will be shown that, after certain modifications to the definitions, the two concepts are essentially equivalent.

We also consider the concept of a ℳs∞-dense sequence in ℝk, which was introduced by Falconer to construct classes of sets having “large intersection”. We will show that ubiquitous systems can be used to construct examples of ℳs∞-dense sequences. This provides a relatively easy means of constructing ℳs∞-dense sequences; a direct construction and proof that a sequence is ℳs∞-dense is usually rather difficult.

MSC classification

Information

Type
Research Article
Copyright
Copyright © University College London 1992

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