The continuum random tree is the scaling limit of unlabelled unrooted trees

We prove that the uniform unlabelled unrooted tree with n vertices and vertex degrees in a fixed set converges in the Gromov-Hausdorff sense after a suitable rescaling to the Brownian continuum random tree. This proves a conjecture by Aldous. Moreover, we establish Benjamini-Schramm convergence of this model of random trees

An Algebraic and Logical approach to continuous images

Continuous mappings between compact Hausdorff spaces can be studied using homomorphisms between algebraic structures (lattices, Boolean algebras) associated with the spaces. This gives us more tools with which to tackle problems about these continuous mappings -- also tools from Model Theory. We illustrate by showing that the \v{C}ech-Stone remainder $[0,\infty)$ has a universality property akin to that of $N^*$; a theorem of Ma\'ckowiak and Tymchatyn implies it own generalization to non-metric continua; and certain concrete compact spaces need not be continuous images of $N^*$.Comment: Notes from a series of lectures at http://www.cts.cuni.cz/events/ws/2002/ws2002.htm, the 30th Winter School on Abstract Analysis 2002-05-02: corrected version after referee's repor

Constructive Dimension and Turing Degrees

This paper examines the constructive Hausdorff and packing dimensions of Turing degrees. The main result is that every infinite sequence S with constructive Hausdorff dimension dim_H(S) and constructive packing dimension dim_P(S) is Turing equivalent to a sequence R with dim_H(R) <= (dim_H(S) / dim_P(S)) - epsilon, for arbitrary epsilon > 0. Furthermore, if dim_P(S) > 0, then dim_P(R) >= 1 - epsilon. The reduction thus serves as a *randomness extractor* that increases the algorithmic randomness of S, as measured by constructive dimension. A number of applications of this result shed new light on the constructive dimensions of Turing degrees. A lower bound of dim_H(S) / dim_P(S) is shown to hold for the Turing degree of any sequence S. A new proof is given of a previously-known zero-one law for the constructive packing dimension of Turing degrees. It is also shown that, for any regular sequence S (that is, dim_H(S) = dim_P(S)) such that dim_H(S) > 0, the Turing degree of S has constructive Hausdorff and packing dimension equal to 1. Finally, it is shown that no single Turing reduction can be a universal constructive Hausdorff dimension extractor, and that bounded Turing reductions cannot extract constructive Hausdorff dimension. We also exhibit sequences on which weak truth-table and bounded Turing reductions differ in their ability to extract dimension.Comment: The version of this paper appearing in Theory of Computing Systems, 45(4):740-755, 2009, had an error in the proof of Theorem 2.4, due to insufficient care with the choice of delta. This version modifies that proof to fix the error

On the Problem of Computing the Probability of Regular Sets of Trees

We consider the problem of computing the probability of regular languages of infinite trees with respect to the natural coin-flipping measure. We propose an algorithm which computes the probability of languages recognizable by \emph{game automata}. In particular this algorithm is applicable to all deterministic automata. We then use the algorithm to prove through examples three properties of measure: (1) there exist regular sets having irrational probability, (2) there exist comeager regular sets having probability $0$ and (3) the probability of \emph{game languages} $W_{i,k}$, from automata theory, is $0$ if $k$ is odd and is $1$ otherwise

Limits of Baumslag-Solitar groups and dimension estimates in the space of marked groups

We prove that the limits of Baumslag-Solitar groups which we previously studied are non-linear hopfian C*-simple groups with infinitely many twisted conjugacy classes. We exhibit infinite presentations for these groups, classify them up to group isomorphism, describe their automorphisms and discuss the word and conjugacy problems. Finally, we prove that the set of these groups has non-zero Hausforff dimension in the space of marked groups on two generators.Comment: 30 pages, no figures, englis

Graphs, permutations and topological groups

Various connections between the theory of permutation groups and the theory of topological groups are described. These connections are applied in permutation group theory and in the structure theory of topological groups. The first draft of these notes was written for lectures at the conference Totally disconnected groups, graphs and geometry in Blaubeuren, Germany, 2007.Comment: 39 pages (The statement of Krophollers conjecture (item 4.30) has been corrected