Consider a graph directed iterated function system (GIFS) on the line which consists of similarities. Assuming neither any separation conditions, nor any restrictions on the contractions, we compute the almost sure dimension of the attractor. Then we apply our result to give a partial answer to an open problem in the field of fractal image recognition concerning some self-affine graph directed attractors in space.

In a recent paper of Feng and Sidorov they show that for β ∈ (1,(1+√5)/2) the set of β-expansions grows exponentially for every x ∈ (0,1/(β-1)). In this paper we study this growth rate further. We also consider the set of β-expansions from a dimension theory perspective.

We investigate a weighted version of Hausdorff dimension introduced by V. Afraimovich, where the weights are determined by recurrence times. We do this for an ergodic invariant measure with positive entropy of a piecewise monotonic transformation on the interval $[0,1]$, giving first a local result and proving then a formula for the dimension of the measure in terms of entropy and characteristic exponent. This is later used to give a relation between the dimension of a closed invariant subset and a pressure...

We give an explicit upper bound for the number of isolated intersections between an integral curve of a polynomial vector field in ${ℝ}^n$ and an algebraic hypersurface. The answer is polynomial in the height (the magnitude of coefficients) of the equation and the size of the curve in the space-time, with the exponent depending only on the degree and the dimension.The problem turns out to be closely related to finding an explicit upper bound for the length of ascending chains of polynomial ideals spanned...