Papers
Topics
Authors
Recent
Search
2000 character limit reached

Flows with minimal subdynamics

Published 3 Sep 2025 in math.DS and math.LO | (2509.03139v1)

Abstract: Let $\Gamma$ be a countably infinite discrete group. A $\Gamma$-flow $X$ (i.e., a nonempty compact Hausdorff space equipped with a continuous action of $\Gamma$) is called $S$-minimal for a subset $S \subseteq \Gamma$ if the partial orbit $S \cdot x$ is dense for every point $x \in X$. We show that for any countable family $(S_n)_{n \in \mathbb{N}}$ of infinite subsets of $\Gamma$, there exists a free $\Gamma$-flow $X$ that is $S_n$-minimal for all $n \in \mathbb{N}$; additionally, $X$ can be taken to be a subflow of $2\Gamma$. This vastly generalizes a result of Frisch, Seward, and Zucker, in which each $S_n$ is required to be a normal subgroup of $\Gamma$. As a corollary, we show that for a given Polish $\Gamma$-flow $X$, there exists a free $\Gamma$-flow $Y$ disjoint from $X$ in the sense of Furstenberg if and only if $X$ has no wandering points. This completes a line of inquiry started by Glasner, Tsankov, Weiss, and Zucker. As another application, we strengthen some of the results of Gao, Jackson, Krohne, and Seward on the structure of Borel complete sections. For example, we show that if $B$ is a Borel complete section in the free part of $2\Gamma$, then every union of sufficiently many shifts of $B$ contains an orbit (previously, this was only known for open sets $B$). Although our main results are purely dynamical, their proofs rely on recently developed machinery from descriptive set-theoretic combinatorics, namely the asymptotic separation index introduced by Conley, Jackson, Marks, Seward, and Tucker-Drob and its links to the Lov\'{a}sz Local Lemma.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 2 tweets with 0 likes about this paper.