Glasner's problem for Polish groups with metrizable universal minimal flow
arXiv:1705.05739
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.
arXiv comment9 pages; post-refereed version, incorporating various suggestions