Glasner's problem for Polish groups with metrizable universal minimal flow

Lionel Nguyen van Thé (1)

1 I2M - Institut de Mathématiques de Marseille

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.

Mots clés: Glasner’s problem; Minimal almost periodicity; Bohr compactification.

Domaines: Systèmes dynamiques [math.DS]

Lionel Nguyen van Thé. Glasner's problem for Polish groups with metrizable universal minimal flow. Annales de l'Institut Fourier, 2019, 69 (2). ⟨hal-01526218⟩