Bibliografie

(eng): The ergodic sequences consisting of vectors (X_n,Y_n), over a finite alphabet AxB are colored with exp(na) colors for A_n and xp(nb) colors for B_n. Generic behavior of the colorings in terms of probabilities of monochromatic rectangles intersected with typical sets is examined. When n increases a big majority of pairs of colorings produces rectangles whose probabilities are bounded uniformly from above. Limiting rates of bounds are worked out in all regimes of the rates a and b of colorings. As a consequence, generic behavior of the colorings in terms of Shannon entropies of the partitions into rectangles is described.