Displaying similar documents to “There exists a polyhedron dominating infinitely many different homotopy types”

Continuous images and other topological properties of Valdivia compacta

Ondřej Kalenda (1999)

Fundamenta Mathematicae

Similarity:

We study topological properties of Valdivia compact spaces. We prove in particular that a compact Hausdorff space K is Corson provided each continuous image of K is a Valdivia compactum. This answers a question of M. Valdivia (1997). We also prove that the class of Valdivia compacta is stable with respect to arbitrary products and we give a generalization of the fact that Corson compacta are angelic.

The geometry of laminations

Robbert Fokkink, Lex Oversteegen (1996)

Fundamenta Mathematicae

Similarity:

A lamination is a continuum which locally is the product of a Cantor set and an arc. We investigate the topological structure and embedding properties of laminations. We prove that a nondegenerate lamination cannot be tree-like and that a planar lamination has at least four complementary domains. Furthermore, a lamination in the plane can be obtained by a lakes of Wada construction.

The box-counting dimension for geometrically finite Kleinian groups

B. Stratmann, Mariusz Urbański (1996)

Fundamenta Mathematicae

Similarity:

We calculate the box-counting dimension of the limit set of a general geometrically finite Kleinian group. Using the 'global measure formula' for the Patterson measure and using an estimate on the horoball counting function we show that the Hausdorff dimension of the limit set is equal to both: the box-counting dimension and packing dimension of the limit set. Thus, by a result of Sullivan, we conclude that for a geometrically finite group these three different types of dimension coincide...

Recursive expansions

C. Ash, J. Knight (1994)

Fundamenta Mathematicae

Similarity:

Let A be a recursive structure, and let ψ be a recursive infinitary Π 2 sentence involving a new relation symbol. The main result of the paper gives syntactical conditions which are necessary and sufficient for every recursive copy of A to have a recursive expansion to a model of ψ, provided A satisfies certain decidability conditions. The decidability conditions involve a notion of rank. The main result is applied to prove some earlier results of Metakides-Nerode and Goncharov. In these...

Reverse mathematics of some topics from algorithmic graph theory

Peter Clote, Jeffry Hirst (1998)

Fundamenta Mathematicae

Similarity:

This paper analyzes the proof-theoretic strength of an infinite version of several theorems from algorithmic graph theory. In particular, theorems on reachability matrices, shortest path matrices, topological sorting, and minimal spanning trees are considered.