Glasner's problem for Polish groups with metrizable universal minimal flow
classification
🧮 math.DS
math.LO
keywords
glasnerproblemflowgroupsmetrizableminimalpolishuniversal
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.