The box-counting dimension for geometrically finite Kleinian groups

B. Stratmann; Mariusz Urbański

Displaying similar documents to “The box-counting dimension for geometrically finite Kleinian groups”

Compositions of simple maps

Jerzy Krzempek (1999)

Fundamenta Mathematicae

Similarity:

A map (= continuous function) is of order ≤ k if each of its point-inverses has at most k elements. Following [4], maps of order ≤ 2 are called simple. Which maps are compositions of simple closed [open, clopen] maps? How many simple maps are really needed to represent a given map? It is proved herein that every closed map of order ≤ k defined on an n-dimensional metric space is a composition of (n+1)k-1 simple closed maps (with metric domains). This theorem fails...

Paul Erdős’s (1913-1996)

András Sárközy (1997)

Acta Arithmetica

Similarity:

Almost all submaximal groups are paracompact and σ-discrete

O. Alas, I. Protasov, M. Tkačenko, V. Tkachuk, R. Wilson, I. Yaschenko (1998)

Fundamenta Mathematicae

Similarity:

We prove that any topological group of a non-measurable cardinality is hereditarily paracompact and strongly σ-discrete as soon as it is submaximal. Consequently, such a group is zero-dimensional. Examples of uncountable maximal separable spaces are constructed in ZFC.

Expansions of the real line by open sets: o-minimality and open cores

Chris Miller, Patrick Speissegger (1999)

Fundamenta Mathematicae

Similarity:

The open core of a structure ℜ := (ℝ,<,...) is defined to be the reduct (in the sense of definability) of ℜ generated by all of its definable open sets. If the open core of ℜ is o-minimal, then the topological closure of any definable set has finitely many connected components. We show that if every definable subset of ℝ is finite or uncountable, or if ℜ defines addition and multiplication and every definable open subset of ℝ has finitely many connected components, then the open core...

Bohr compactifications of discrete structures

Joan Hart, Kenneth Kunen (1999)

Fundamenta Mathematicae

Similarity:

We prove the following theorem: Given a⊆ω and $1 \leq α < ω_{1}^{C K}$ , if for some $η < ℵ_{1}$ and all u ∈ WO of length η, a is $Σ_{α}^{0} (u)$ , then a is $Σ_{α}^{0}$ .We use this result to give a new, forcing-free, proof of Leo Harrington’s theorem: $Σ_{1}^{1}$ -Turing-determinacy implies the existence of $0^{}$ .

On large Picard groups and the Hasse Principle for curves and K3 surfaces

Daniel Coray, Constantin Manoil (1996)

Acta Arithmetica

Similarity:

Partition properties of ω1 compatible with CH

Uri Abraham, Stevo Todorčević (1997)

Fundamenta Mathematicae

Similarity:

A combinatorial statement concerning ideals of countable subsets of ω is introduced and proved to be consistent with the Continuum Hypothesis. This statement implies the Suslin Hypothesis, that all (ω, ω*)-gaps are Hausdorff, and that every coherent sequence on ω either almost includes or is orthogonal to some uncountable subset of ω.