Hostname: page-component-7b7567c8c-slfcl Total loading time: 0 Render date: 2026-11-19T11:28:05.708Z Has data issue: false hasContentIssue false

Small sets containing any pattern

Published online by Cambridge University Press:  31 July 2018

URSULA MOLTER
Affiliation:
Departamento de Matemática and IMAS/UBA-CONICET, Facultad de Cs. Exactas y Naturales, Universidad de Buenos Aires, Ciudad Universitaria, Pab. I, (1428) CABA, Argentina. e-mail: umolter@dm.uba.ar; ayavicoli@dm.uba.ar
ALEXIA YAVICOLI
Affiliation:
Departamento de Matemática and IMAS/UBA-CONICET, Facultad de Cs. Exactas y Naturales, Universidad de Buenos Aires, Ciudad Universitaria, Pab. I, (1428) CABA, Argentina. e-mail: umolter@dm.uba.ar; ayavicoli@dm.uba.ar
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Given any dimension function h, we construct a perfect set E ⊆ ${\mathbb{R}}$ of zero h-Hausdorff measure, that contains any finite polynomial pattern.

This is achieved as a special case of a more general construction in which we have a family of functions $\mathcal{F}$ that satisfy certain conditions and we construct a perfect set E in ${\mathbb{R}}^N$, of h-Hausdorff measure zero, such that for any finite set {f1,. . .,fn} ⊆ $\mathcal{F}$, E satisfies that $\bigcap_{i=1}^n f^{-1}_i(E)\neq\emptyset$.

We also obtain an analogous result for the images of functions. Additionally we prove some related results for countable (not necessarily finite) intersections, obtaining, instead of a perfect set, an $\mathcal{F}_{\sigma}$ set without isolated points.

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 2018