Glasner's problem for Polish groups with metrizable universal minimal flow
Dynamical Systems
2018-10-26 v2 Logic
Abstract
A problem of Glasner, now known as Glasner's problem, asks whether every minimally almost periodic, monothetic, Polish groups is extremely amenable. The purpose of this short note is to observe that a positive answer is obtained under the additional assumption that the universal minimal flow is metrizable.
Keywords
Cite
@article{arxiv.1705.05739,
title = {Glasner's problem for Polish groups with metrizable universal minimal flow},
author = {Lionel Nguyen Van Thé},
journal= {arXiv preprint arXiv:1705.05739},
year = {2018}
}
Comments
9 pages; post-refereed version, incorporating various suggestions