Covering Finite Sets by Ergodic Images
Canadian mathematical bulletin, Tome 21 (1978) no. 1, pp. 85-91

Voir la notice de l'article provenant de la source Cambridge University Press

For any ergodic transformation T a set A of measure less than ∈ is constructed with the property that for every finite set F there is a j = j(F) such that F ⊂ T-iA. The basic tool used to prove this is a purely combinatorial result which says there is a small subset of { l, 2, ..., n } which can be shifted a small amount to cover any k set in {j: δn ≤j≤n}. Applications are given to the theory of combinatorial entropy.
DOI : 10.4153/CMB-1978-013-3
Mots-clés : Ergodic, aperiodic, entropy, combinatorial method
Steele, J. Michael. Covering Finite Sets by Ergodic Images. Canadian mathematical bulletin, Tome 21 (1978) no. 1, pp. 85-91. doi: 10.4153/CMB-1978-013-3
@article{10_4153_CMB_1978_013_3,
     author = {Steele, J. Michael},
     title = {Covering {Finite} {Sets} by {Ergodic} {Images}},
     journal = {Canadian mathematical bulletin},
     pages = {85--91},
     year = {1978},
     volume = {21},
     number = {1},
     doi = {10.4153/CMB-1978-013-3},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1978-013-3/}
}
TY  - JOUR
AU  - Steele, J. Michael
TI  - Covering Finite Sets by Ergodic Images
JO  - Canadian mathematical bulletin
PY  - 1978
SP  - 85
EP  - 91
VL  - 21
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1978-013-3/
DO  - 10.4153/CMB-1978-013-3
ID  - 10_4153_CMB_1978_013_3
ER  - 
%0 Journal Article
%A Steele, J. Michael
%T Covering Finite Sets by Ergodic Images
%J Canadian mathematical bulletin
%D 1978
%P 85-91
%V 21
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1978-013-3/
%R 10.4153/CMB-1978-013-3
%F 10_4153_CMB_1978_013_3

[1] 1. Billingsley, P., Ergodic Theory and Information, Wiley, New York, 1965. Google Scholar

[2] 2. Halmos, P. R., Lectures on Ergodic Theory, Chelsea Publishing, New York, 1956. Google Scholar

[3] 3. Jones, L. K. and Krengel, U., On transformations without invariant measure, Adv. in Math., 12 (1974), 275-295. Google Scholar

[4] 4. Steele, J. M., Combinatorial Entropy and Uniform Limit Laws, Stanford University (Thesis), 1975. Google Scholar

[5] 5. Vapnik, V. N. and Chervonenkis, A. Ya., On the uniform convergence of relative frequencies of events to their probabilities, Theory Prob. and Appl., 16 (1971), 264-280. Google Scholar

[6] 6. Vapnik, V. N. and Chervonenkis, A. Ya., Teoriya Raspoznavaniya Obrazov, Nauka, Moscow, 1974. Google Scholar

Cité par Sources :