Simple mixing actions
with uncountably many prime factors
Colloquium Mathematicum, Tome 139 (2015) no. 1, pp. 37-54
Voir la notice de l'article provenant de la source Institute of Mathematics Polish Academy of Sciences
Via the $(C,F)$-construction we produce a 2-fold simple mixing transformation which has uncountably many non-trivial proper factors and all of them are prime.
Keywords:
via construction produce fold simple mixing transformation which has uncountably many non trivial proper factors prime
Affiliations des auteurs :
Alexandre I. Danilenko 1 ; Anton V. Solomko 1
@article{10_4064_cm139_1_3,
author = {Alexandre I. Danilenko and Anton V. Solomko},
title = {Simple mixing actions
with uncountably many prime factors},
journal = {Colloquium Mathematicum},
pages = {37--54},
publisher = {mathdoc},
volume = {139},
number = {1},
year = {2015},
doi = {10.4064/cm139-1-3},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.4064/cm139-1-3/}
}
TY - JOUR AU - Alexandre I. Danilenko AU - Anton V. Solomko TI - Simple mixing actions with uncountably many prime factors JO - Colloquium Mathematicum PY - 2015 SP - 37 EP - 54 VL - 139 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/articles/10.4064/cm139-1-3/ DO - 10.4064/cm139-1-3 LA - en ID - 10_4064_cm139_1_3 ER -
Alexandre I. Danilenko; Anton V. Solomko. Simple mixing actions with uncountably many prime factors. Colloquium Mathematicum, Tome 139 (2015) no. 1, pp. 37-54. doi: 10.4064/cm139-1-3
Cité par Sources :