Hostname: page-component-74656f9884-2dmjx Total loading time: 0 Render date: 2026-11-09T12:02:00.759Z Has data issue: false hasContentIssue false

Minimal subdynamics and minimal flows without characteristic measures

Published online by Cambridge University Press:  10 May 2024

Joshua Frisch
Affiliation:
Dept. of Mathematics, University of California San Diego 9500 Gilman Dr, La Jolla, CA 92093, United States; E-mail: jfrisch@ucsd.edu
Brandon Seward
Affiliation:
Dept. of Mathematics, University of California San Diego 9500 Gilman Dr, La Jolla, CA 92093, United States; E-mail: bseward@ucsd.edu
Andy Zucker*
Affiliation:
Dept. of Pure Mathematics, University of Waterloo, 200 University Ave W, Waterloo, ON N2L3G1, Canada;
*
E-mail: a3zucker@uwaterloo.ca (corresponding author)

Abstract

Given a countable group G and a G-flow X, a probability measure $\mu $ on X is called characteristic if it is $\mathrm {Aut}(X, G)$-invariant. Frisch and Tamuz asked about the existence of a minimal G-flow, for any group G, which does not admit a characteristic measure. We construct for every countable group G such a minimal flow. Along the way, we are motivated to consider a family of questions we refer to as minimal subdynamics: Given a countable group G and a collection of infinite subgroups $\{\Delta _i: i\in I\}$, when is there a faithful G-flow for which every $\Delta _i$ acts minimally?

Information

Type
Dynamics
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2024. Published by Cambridge University Press
Figure 0

Figure 1 Sighting in Roswell; a $(\mathbb {Z}\times \mathbb {Z}, \mathbb {Z}\times \{0\})$-UFO subset of $\mathbb {Z}\times \mathbb {Z}$.

Figure 1

Figure 2 A pair of outgoing edges, drawn in solid red, is chosen at each of $v_{00}$, $v_{01}$, $v_{10}$ and $v_{11}$. Edges which must consequently be oriented in a particular direction are indicated with dashed red arrows. Most importantly, $v_{\varnothing }$ is forced to direct an edge to $u_\varnothing $. By considering the generalization of this picture for any length of binary string, we see that $X_{pdox}$ cannot be $D_n$-irreducible for any $n\in \mathbb {N}$.