On uniform distribution of double sequences

In this paper a new notion of uniform distribution of double sequences is introduced. In the most elementary case a double sequence (x_mn)_{m, nN} is called uniformly distributed in this sense if all finite matrices of equal size appear with the same frequency as submatrices of the infinite matrix (x_mn). Some special double sequences with such a distribution property are studied and metric theorems are proved.     

On the uniform distribution of sequences of random variables

Summary This paper deals with the almost sure uniform distribution (modulo 1) of sequences of random variables. In the case where the law of the increments X _n+h –X _n of the sequence X ₀, X ₁, does not depend on n, sufficient conditions are given to assure the uniform distribution (modulo 1) with probability one. As an illustrative example the partial sums of a sequence of independent, identically distributed variables is considered.     

Some remarks on countably determined measures and uniform distribution of sequences

Two topics are investigated: countably determined (regular Borel probability) measures on compact Hausdorff spaces, and uniform distribution of sequences regarding mainly this kind of measures. We prove several characterizations of countably determined measures, and apply the results in order to show the existence of a well distributed sequence in the support of a countably determined measure. We also generalize a result of Losert on the existence of uniformly distributed sequences in compact dyadic spaces.     

Capacity and uniform algebras

Let A be a uniform algebra on a compact space X, let M be the maximal ideal space of A, and consider an element ? of A. Choose a component W of $\text{C}$??(X). In 1963 Bishop showed that {$\text{y}\text{in}\text{M ¦ ?(y) ? W}$} can be made into a one-dimensional complex analytic space provided there is a subset G of W having positive area such that for each λ in $\text{G {y}\text{in}\text{M ¦ ?(y) = λ}}$ is finite. We show that the hypothesis of “positive area” may be replaced by “positive exterior capacity” and that no weaker condition will suffice.     

On the uniform distribution modulo one of some subsequences of polynomial sequences

Let P be a polynomial. We find a necessary and sufficient condition for some subsequences of (P(n)) to be uniformly distributed modulo one. These subsequences are defined by properties of the q-adic expansion of n.     

On the uniform distribution modulo one of subsequences of polynomial sequences II

Let P be a polynomial. As in the article [J. Coquet, J. Number Theory10 (1978), 291–296], we find a necessary and sufficient condition for some subsequences of (P(n)) to be uniformly distributed modulo one. These subsequences are defined by properties of the q-adic expansion of n.     

A criterion for the uniform distribution of sequences in compact metric spaces

LetX be a compact metric space, le μ be a non-negative normalized Borel measure onX and letf be a measurable bounded real-valued function defined onX such thatf is μ-almost everywhere continuous and different from zero. It is proved that a sequence (x _n ),n=1,2, … of points inX is μ-uniformly distributed if and only if for every Borel setE?X with μ(Bd(E))=0 we have \(\mathop {\lim }\limits_{N \to \infty } \frac{1}{N}\sum\limits_{n = 1}^N {f(x_n )} 1_E (x_n ) = \int\limits_E {f(x)d\mu (x)} ,\) where 1 _E denotes the characteristic function ofE andbdE the boundary ofE. Furthermore some quantitative aspects and generalizations of this theorem are discussed.     

Quasisymmetrically minimal uniform Cantor sets

The uniform Cantor set E(n,c) of Hausdorff dimension 1, defined by a bounded sequence n of positive integers and a gap sequence c, is shown to be minimal for 1-dimensional quasisymmetric maps.     

Degree sets of degree uniform graphs

A graphG isn-degree uniform if for every nonnegative integerr, there are either no vertices of degreer orn vertices of degreer. For any integern≥2, a necessary and sufficient condition for a (finite, nonempty) set of positive integers to be the degree set of ann-degree uniform graph is given. Research supported in part by the South African Council for Scientific and Industrial Research     

Construction of functions with uniform sublevel sets

In this paper, we study extended real-valued functions with uniform sublevel sets. The sublevel sets are defined by a linear shift of a set in a specified direction. We prove that the class of these functions coincides with the class of Gerstewitz functionals. In this way, we obtain a formula for the construction of such functions. The sublevel sets of Gerstewitz functionals are characterized and illustrated by examples. The results contain statements for translative functions, which are just the functions with uniform sublevel sets considered. The investigated functions are defined on an arbitrary real vector space without assuming any topology or convexity.     

Limit sets of automatic sequences

We show that for every k-automatic sequence there exists a natural number p>0 such that the sequences of the form (k^pn+j)_n?0 with j=0,…,p−1 are scaling sequences for f. Moreover, we demonstrate that every limit set is the union of certain basic limit sets.     

Strongly almost disjoint sets and weakly uniform bases

A combinatorial principle CECA is formulated and its equivalence with GCH + certain weakenings of for singular is proved. CECA is used to show that certain ``almost point-' families can be refined to point- families by removing a small set from each member of the family. This theorem in turn is used to show the consistency of ``every first countable -space with a weakly uniform base has a point-countable base.'

     

Strongly non-repetitive sequences and progression-free sets

By a simple method we show the existence of (1) a sequence on two symbols in which no four blocks occur consecutively that are permutations of each other, and (2) a sequence on three symbols in which no three blocks occur consecutively that are permutations of each other. The problem of the existence of a sequence on four symbols in which no two blocks occur consecutively that are permutations of each other remains open.     

Rotation sets and almost periodic sequences

We study the rotational behaviour on minimal sets of torus homeomorphisms and show that the associated rotation sets can be any type of line segment as well as non-convex and even plane-separating continua. This shows that the restriction which hold for rotation sets on the whole torus are not valid on minimal sets. The proof uses a construction of rotational horseshoes by Kwapisz to transfer the problem to a symbolic level, where the desired rotational behaviour is implemented by means of suitable irregular Toeplitz sequences.     

Julia sets and periodic kneading sequences

We construct abstract Julia sets homeomorphic to Julia sets for complex polynomials of the form f _c (z) = z ² + c, having an associated periodic kneading sequence of the form [`(a*)]{\overline{\alpha\ast}} which is not a period n-tupling. We show that there is a single simply-defined space of “itineraries” which contains homeomorphic copies of all such Julia sets in a natural combinatorial way, with dynamical properties which are derivable directly from the combinatorics. This also leads to a natural definition of abstract Julia sets even for those kneading sequences which are not realized by any polynomial f _c , with similar dynamical properties.