Pith. sign in

REVIEW 1 major objections 4 minor 79 references

Flows with minimal subdynamics

T0 review · 1 major / 4 minor · reviewed 2026-08-05 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper proves that any countable family of infinite subsets of a countably infinite group admits a single free flow whose partial orbits along all these subsets are dense, and derives new results on disjoint flows and Borel complete sect

desk verdict Strong paper with a real gap: the continuity step in the continuous LLL (Thm 6.6) is not justified, and the main theorem leans on it. read the letter →

arxiv 2509.03139 v2 pith:MLX3R7NH submitted 2025-09-03 math.DS math.LO

Anton Bernshteyn , Joshua Frisch This is my paper · ORCID
classification math.DSmath.LO MSC 37B0537B1003E1505D40
keywords minimalsubdynamicsS-minimalflowsfreesubshiftsasymptoticseparationindexcontinuousLovászLocalLemmadisjointBorelcompletesectionstopologicaldynamics
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper shows that minimal subdynamics has no hidden restrictions: for any countable list of infinite subsets S_n of a countably infinite group, there is one free flow in which the partial orbit S_n·x is dense for every point x and every n. This removes the normality assumption that a 2024 result required, and it even replaces subgroups by arbitrary infinite subsets, or by arbitrary unbounded families of finite subsets. The proof is indirect: it builds a non-compact space whose free part is 'amply syndetic' and then shows that generic subflows of a compact flow inherit the desired partial-density properties. If correct, the result answers the minimal subdynamics problem in full generality and yields the first complete characterization of which Polish flows are disjoint from some free flow.

What carries the argument

The main technical object is the space Sepp(s) of asymptotic s-separators: a point of this space is an infinite tuple of colorings of the group, each coloring separating the group into finite components in the sense of a finite window, and the free part of this space is shown to be amply syndetic. An amply syndetic Gamma-space is a Polish Gamma-space in which every finite tuple of open sets can be made F-syndetic by a continuous equivariant self-map for all sufficiently large finite F. The proof combines this with the continuous asymptotic separation index—a clopen version of the asymptotic separation index—and a continuous version of the Lovász Local Lemma, which together produce continuous

What would settle it

Inspect the continuity step in the proof of Theorem 6.6: take a simple free action with continuous asymptotic separation index at most 1, such as the shift action on the free part of 2^Z, and check whether the lexicographically minimal good function on each finite component glues to a continuous function across accumulating components; exhibiting a configuration where it does not would break the main chain.

Watch

Extended reading notes

Core claim

The central claim is Theorem 1.10: if (F_n) is a sequence of unbounded families of finite subsets of a countably infinite group, then there exists a free flow that is F_n-minimal for every n; in particular, for any countable family of infinite subsets S_n there is a free flow whose partial orbits along S_n are dense. The same construction can be placed inside the binary shift, giving a free subshift of 2^Gamma with these properties. From this, the paper derives a complete answer to a disjointness question of Glasner, Tsankov, Weiss, and Zucker: a Polish flow is disjoint from some free minimal subflow of 2^Gamma exactly when it has no wandering points, and this extends simultaneously to count

Load-bearing premise

The continuous version of the Lovász Local Lemma relies on a lexicographic tie-breaking rule that is asserted to produce a continuous function; if that continuity assertion fails, the main construction collapses.

Editorial extensions

If this is right

  • There exists a free F2-flow that is minimal for the cyclic subgroup generated by each nonidentity element simultaneously.
  • For any countable family of Polish flows with no wandering points, one free minimal subflow of 2^Gamma is disjoint from all of them.
  • Every Borel complete section B in the free part of 2^Gamma has a threshold n such that F·B traps a point for every finite set F of size at least n.
  • Given Borel complete sections B_n and finite sets F_n of unbounded sizes, some point lies in F_n·B_n for infinitely many n.
  • For groups with only countably many infinite locally finite subgroups, one free flow is minimal for all infinite subgroups simultaneously.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The paper notes that its complete-section arguments only need Baire-measurability relative to free subshifts, so the Borel assumptions in the section theorems can likely be relaxed further.
  • The non-compact amply syndetic space construction is a reusable template: other generic dynamical properties expressed by open constraints might be realized through the same Baire-category route.
  • The continuous Lovász Local Lemma under finite continuous asymptotic separation index probably applies to definable coloring and embedding problems beyond flows, wherever continuous solutions are needed instead of merely Borel ones.
  • The paper leaves open the exact class of groups admitting one free flow minimal for every infinite subgroup; its countability condition on locally finite subgroups suggests locally finite subgroups are the only possible obstruction, but the boundary is not yet characterized.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

1 major / 4 minor

Summary. The paper proves Theorem 1.10: for any sequence (F_n) of unbounded families of finite subsets of a countably infinite group Γ, there exists a free Γ-flow that is F_n-minimal for all n, and moreover this flow can be taken to be a subflow of 2^Γ (Corollary 1.11). This generalizes the normality assumption in Frisch–Seward–Zucker to arbitrary infinite subsets and even to unbounded families of finite sets. The proof is structured around (i) a genericity argument showing that in a suitable space of subflows, F-minimal subflows are dense G_δ; (ii) the construction of an amply syndetic zero-dimensional free Γ-space, namely the free part of the space of asymptotic s-separators; (iii) a continuous version of the Lovász Local Lemma under a finite continuous asymptotic separation index assumption. The paper also derives two applications: a Polish flow is disjoint from some free minimal subflow of 2^Γ iff it has no wandering points (Theorem 1.14), and two strengthenings of results of Gao–Jackson–Krohne–Seward on Borel complete sections (Theorems 1.18 and 1.20).

Significance. Conditional on the proof being correct, this is a substantial advance. It removes the normality assumption that was central to previous minimal-subdynamics results, answers the explicit open question about F_2 and all its cyclic subgroups, and gives a complete disjointness characterization for Polish flows. The proof architecture is genuinely novel in bringing asymptotic separation index and the Lovász Local Lemma to bear on a purely topological-dynamical problem, and the paper makes a serious effort to be self-contained, including a full proof of the needed continuous LLL. The applications to Borel complete sections are clean and strengthen known results in a surprising way.

major comments (1)
  1. [§6.2, proof of Theorem 6.6] The continuity of f_i is the load-bearing point of the continuous LLL, but the final paragraph of the proof does not establish it. The components C of G_i are finite, but they are not shown to be clopen; finite components of an induced subgraph of a Schreier graph on a clopen set need not be open even when the edge relation is closed (e.g. the two-point components of the flipping involution on 2^N are not clopen). Consequently R_x, the set of group elements whose translates stay in the same component as x, need not be locally constant, and the lexicographically minimal good function on a nearby component could differ. The assertion that the listed finite data determine f_i(x) on a neighborhood is therefore unjustified. This is not a peripheral remark: Theorem 6.6 feeds Lemma 2.15 (§6.3), then Lemma 2.11 (§2.4), then Theorem 2.7 (§7), then Theorem 2.2 and Theorem 1.10. The authors need to
minor comments (4)
  1. [§5, Eq. (5.1)] The definition of Φ immediately before Claim 5 is hard to parse, especially the expression Φ˚_n D D^{-1} Φ˚_n. It should be written with explicit product-set notation and, if intended, with the inclusions needed for the path argument (e.g. Φ ⊇ D^{-1}Φ_n D).
  2. [§6.2] The strict inequality 'p < (ed)^{-(s+1)} because p is rational while (ed)^{s+1} is not' is true but should be phrased as relying on the irrationality of e; as written it is slightly cryptic.
  3. [§7] The reduction to sets of the form U_i = V_i × ∏_{n≥N} (s+1)^Γ uses that basic open sets depend on finitely many coordinates; this should be stated explicitly, since it is the justification for the 'without loss of generality' assertion.
  4. [§10, proof of Theorem 1.20] After establishing that M is meager and meets every orbit, the proof should add that Γ·M is therefore meager (a countable union of meager sets) and equals X, contradicting the Baire category theorem. The present wording leaves this final step implicit.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the main theorem is derived from independent constructions and does not assume its own conclusion; self-citations are genuine prior work, not fitted inputs.

full rationale

The derivation of Theorem 1.10 is not circular. It proceeds by introducing independently defined notions (F-minimality, amply syndetic spaces, continuous asymptotic separation index, and the separator spaces Sepp(s)) and proving Theorem 2.3 (generational F-minimality) and Theorem 2.2/2.7 (existence of amply syndetic free spaces) from them. The central reduction chain—Lemma 2.11 from Lemmas 2.14 and 2.15—rests on the continuous Lovász Local Lemma (Theorem 6.6), whose proof is written out in the paper and depends only on the assumption asicp(X)≤s, the classical LLL, and a lexicographic choice; it never invokes F-minimality or the target theorem. The prior works cited by the authors—[BW25] for the Borel LLL pattern, [Ber20a] for the D-spaced subset lemma, [Ber23c] for continuous colorings, and [FSZ24] for motivation—are independent results with their own statements and proofs, and none of them is a restatement, special case, or fitted version of Theorem 1.10. The use of [ST16] for the universal free subshift of 2^Γ is external. There is, however, a genuine non-circularity concern in the manuscript: the final paragraph of §6.2 asserts that f_i is continuous because its value at x is determined by finite data (R_x, restrictions of f_0,...,f_{i-1} to ΦR_x·x, and the order ≤ on R_x·x), and claims 'this shows' local constancy. This is not fully justified as written, since the components of G_i need not be clopen, and the component R_x could change under arbitrarily small perturbations. That is a potential correctness gap in the proof of the continuous LLL, and it is load-bearing for Lemma 2.15, Lemma 2.11, Theorem 2.7, and ultimately Theorem 1.10. But a proof gap is not circularity: there is no exhibited reduction of the target theorem to its own assertion, and no fitted parameter is being renamed as a prediction. Under the hard rules, this gap does not raise the circularity score.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The central claim rests on standard set-theoretic and dynamical background and on several published theorems from descriptive combinatorics, some by the first author. No free parameters are fitted; the proof introduces new definitions rather than unexplained entities.

assumptions (5)
  • standard math Baire category theorem and Zorn's lemma
    Used to assert minimal subflows exist (Section 1.1) and that the intersection of dense G_delta sets is nonempty (Theorem 2.3, proof of Theorem 1.10).
  • standard math Lovasz Local Lemma (finite and infinite versions)
    Theorem 6.3 and Corollary 6.4 are used in the proofs of Proposition 6.5, Theorem 6.6, and Claim 6.7.
  • standard math Closed linear order on zero-dimensional Polish spaces
    Proposition 3.2 is used in Theorem 6.6 for lexicographic tie-breaking of good functions on finite components.
  • domain assumption External results on free subshifts and continuous colorings
    Prop 3.1 uses [Ber23c, Lem. 2.3]; Corollary 1.11 uses the Seward-Tucker-Drob universal free subshift [ST16]; Lemma 2.15 uses [Ber20a, Lem. 4.1]; Theorem 6.6 adapts [BW25, Thm. 1.29].
  • domain assumption Enumeration of finite subsets of Gamma with each set appearing infinitely often
    Definition 2.5 fixes such an enumeration; it underlies the definition of Sepp(s) and the proof of Lemma 2.14 and Theorem 2.7.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Flows with minimal subdynamics." pith.science (2026). https://pith.science/paper/MLX3R7NH

@misc{pith2026250903139,
  author       = {Pith},
  title        = {Pith review of: Flows with minimal subdynamics},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/MLX3R7NH}},
  note         = {Machine review of arXiv:2509.03139}
}
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.

Figures

Figures reproduced from arXiv: 2509.03139 by the authors.

Figure 1
Figure 1. A piece of a p1, Φq-separator x: Z 2 Ñ 2 in the group Z 2 , where Φ :“ tp1, 0q,p0, 1qu is the standard generating set. Here each element γ P Z 2 is labeled red or blue depending on the value xpγq, splitting the Cayley graph CaypZ 2 , Φq into finite monochromatic components. is a dense Gδ subset of SubXpY q for each n P N. By the Baire category theorem, the intersection of all these sets is also dense Gδ, so, in part… view at source ↗
Figure 2
Figure 2. A flowchart for the proof of Theorem 1.10. 2.5. Summary and a road map for the remainder of the paper [PITH_FULL_IMAGE:figures/full_fig_p013_2.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

79 extracted references · 70 canonical work pages

  1. [1]

    [AGW08] E. Akin,E. Glasner, andB. Weiss.Generically there is but one self homeomorphism of the Cantor set, Trans. Am. Math. Soc.,360(2008), 3613–3630 (cit. on p

    work page 2008

  2. [2]

    Brandt,C

    25 [BGR20] S. Brandt,C. Grunau, andV. Rozhoň.Generalizing the sharp threshold phenomenon for the distributed complexity of the Lovász Local Lemma, ACM Symposium on Principles of Distributed Computing (PODC), (2020), 329–338. Full version:https://arxiv.org/abs/2006. 04625(cit. on p

    work page 2020

  3. [3]

    AlonandJ.H

    [AS16] N. AlonandJ.H. Spencer.The Probabilistic Method. 4th ed. John Wiley & Sons, 2016 (cit. on pp. 7, 17,

    work page 2016

  4. [4]

    [Gao+22] S. Gao,S. Jackson,E. Krohne, andB. Seward.Forcing constructions and countable Borel equivalence relations, J. Symb. Log.,87(3) (2022), 873–893 (cit. on pp. 5,

    work page 2022

  5. [5]

    Aubrun,S

    [ABT19] N. Aubrun,S. Barbieri, andS. Thomassé.Realization of aperiodic subshifts and uniform densities in groups, Groups Geom. Dyn.,13(1) (2019), 107–129 (cit. on pp. 3,

    work page 2019

  6. [6]

    [AHK03] E. Akin,M. Hurley, andJ.A. Kennedy.Dynamics of topologically generic homeomor- phisms, Mem. Am. Math. Soc.,167(783) (2003) (cit. on p

    work page 2003

  7. [7]

    Beck.An algorithmic approach to the Lovász Local Lemma

    [Bec91] J. Beck.An algorithmic approach to the Lovász Local Lemma. I, Rand. Str. & Alg.,2(4) (1991), 343–365 (cit. on p

    1991

  8. [8]

    Bernshteyn.Building large free subshifts using the Local Lemma, Groups Geom

    [Ber19a] A. Bernshteyn.Building large free subshifts using the Local Lemma, Groups Geom. Dyn., 13(4) (2019), 1417–1436 (cit. on pp. 3,

    work page 2019

Show all 79 references
  1. [9]

    Bernshteyn.Measurable versions of the Lovász Local Lemma and measurable graph colorings, Adv

    [Ber19b] A. Bernshteyn.Measurable versions of the Lovász Local Lemma and measurable graph colorings, Adv. Math.,353(2019), 153–223 (cit. on p

    2019

  2. [10]

    Bernshteyn.A short proof of Bernoulli disjointness via the Local Lemma, Proc

    [Ber20a] A. Bernshteyn.A short proof of Bernoulli disjointness via the Local Lemma, Proc. Am. Math. Soc.,148(12) (2020), 5235–5240 (cit. on pp. 4–7,

    2020

  3. [11]

    Bernshteyn.Descriptive combinatorics and distributed algorithms, Not

    [Ber22] A. Bernshteyn.Descriptive combinatorics and distributed algorithms, Not. Am. Math. Soc., 69(9) (2022), 1496–1507 (cit. on p

    2022

  4. [12]

    Bernshteyn.Distributed algorithms, the Lovász Local Lemma, and descriptive combina- torics, Invent

    [Ber23a] A. Bernshteyn.Distributed algorithms, the Lovász Local Lemma, and descriptive combina- torics, Invent. Math.,233(2023), 495–542 (cit. on p

    2023

  5. [13]

    Bernshteyn.Equivariant maps to subshifts whose points have small stabilizers, J

    [Ber23b] A. Bernshteyn.Equivariant maps to subshifts whose points have small stabilizers, J. Mod. Dyn.,19(2023), 1–30 (cit. on pp. 3,

    2023

  6. [14]

    Bernshteyn.Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms, Adv

    [Ber23c] A. Bernshteyn.Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms, Adv. Math.,415(2023), #108895 (cit. on pp. 7, 13, 18,

    2023

  7. [16]

    BernshteynandJ

    [BY24a] A. BernshteynandJ. Yu.Borel Local Lemma: arbitrary random variables and limited exponential growth,https://arxiv.org/abs/2412.11571(preprint), 2024 (cit. on p

    2024 arXiv

  8. [17]

    BernshteynandJ

    [BY24b] A. BernshteynandJ. Yu.Embedding Borel graphs into grids of asymptotically optimal dimension,https://arxiv.org/abs/2407.19785(preprint), 2024 (cit. on p

    2024

  9. [18]

    Artigue.Generic dynamics on compact metric spaces, Topol

    [Art19] A. Artigue.Generic dynamics on compact metric spaces, Topol. Its Appl.,255(2019), 1–14 (cit. on p

    2019

  10. [19]

    BowenandF

    [BW23] M. BowenandF. Weilacher.Definable Kőnig Theorems, Proc. Am. Math. Soc.,151 (2023), 4991–4996 (cit. on pp. 7,

    2023

  11. [20]

    Bernshteyn.Ergodic theorems for the shift action and pointwise versions of the Abért–Weiss theorem, Isr

    [Ber20b] A. Bernshteyn.Ergodic theorems for the shift action and pointwise versions of the Abért–Weiss theorem, Isr. J. Math.,235(2020), 255–293 (cit. on p

    2020

  12. [21]

    BoyleandD

    [BL97] M. BoyleandD. Lind.Expansive subdynamics, Trans. Am. Math. Soc.,349(1) (1997), 55–102 (cit. on p

    1997

  13. [22]

    BernshteynandF

    [BW25] A. BernshteynandF. Weilacher.Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index, Trans. Am. Math. Soc., (2025). url: https://doi.org/10.1090/tran/9455 . Published electronically, preprint at https: //arxiv.org/abs/230...

    2025 arXiv

  14. [23]

    Brandt,Y

    [BMU19] S. Brandt,Y. Maus, andJ. Uitto.A sharp threshold phenomenon for the distributed complexity of the Lovász Local Lemma, ACM Symposium on Principles of Distributed Computing (PODC), (2019), 389–398. Full version:https://arxiv.org/abs/1908.06270(cit. on p

    2019 arXiv

  15. [24]

    Ceccherini-SilbersteinandM

    [CC10] T. Ceccherini-SilbersteinandM. Coornaert.Cellular Automata and Groups. Berlin, Heidelberg: Springer, 2010 (cit. on pp. 3,

    2010

  16. [25]

    Colle.On periodic decompositions, one-sided nonexpansive directions and Nivat’s conjec- ture, Discrete Contin

    [Col23] C.F. Colle.On periodic decompositions, one-sided nonexpansive directions and Nivat’s conjec- ture, Discrete Contin. Dyn. Syst.,43(12) (2023), 4299–4327 (cit. on p

    2023

  17. [26]

    Conley,S

    [Con+23] C.T. Conley,S. Jackson,A.S. Marks,B. Seward, andR.D. Tucker-Drob.Borel asymptotic dimension and hyperfinite equivalence relations, Duke Math. J.,172(16) (2023), 3175–3226 (cit. on pp. 7, 10,

    2023

  18. [27]

    [Csó+24] E. Csóka,Ł. Grabowski,A. Máthé,O. Pikhurko, andK. Tyros.Moser–Tardos Algorithm with small number of random bits,https://arxiv.org/abs/2203.05888 (preprint), 2024 (cit. on p

    2024 arXiv

  19. [28]

    [CK15] V. CyrandD. Kra.Nonexpansive Z2-subdynamics and Nivat’s conjecture, Trans. Am. Math. Soc.,367(9) (2015), 6487–6537 (cit. on p

    2015

  20. [29]

    DranishnikovandV

    [DS07] A. DranishnikovandV. Schroeder.Aperiodic colorings and tilings of Coxeter groups, Groups Geom. Dyn.,1(2007), 301–318 (cit. on p

    2007

  21. [30]

    Einsiedler,D

    [Ein+01] M. Einsiedler,D. Lind,R. Miles, andT. Ward.Expansive subdynamics for algebraic Zd-actions, Ergod. Theory Dyn. Syst.,21(6) (2001), 1695–1729 (cit. on p

    2001

  22. [31]

    Elek.Uniformly recurrent subgroups and simple C ˚-algebras, J

    [Ele18] G. Elek.Uniformly recurrent subgroups and simple C ˚-algebras, J. Funct. Anal.,274(6) (2018), 1657–1689 (cit. on p

    2018

  23. [32]

    ErdősandL

    [EL75] P. ErdősandL. Lovász.Problems and results on3-chromatic hypergraphs and some related questions, Infinite and Finite Sets, Colloq. Math. Soc. J. Bolyai, (1975). Ed. byA. Hajnal, R. Rado, andV.T. Sós, 609–627 (cit. on pp. 7,

    1975

  24. [33]

    FischerandM

    [FG17] M. FischerandM. Ghaffari.Sublogarithmic distributed algorithms for Lovász Local Lemma, and the complexity hierarchy, International Symposium on DIStributed Computing (DISC),91 (2017), 18:1–18:16. Full version:https://arxiv.org/abs/1705.04840(cit. on pp. 7,

    2017 arXiv

  25. [34]

    Frisch,A

    [Fri+25] J. Frisch,A. Kechris,F. Shinko, andZ. Vidnyánszky.Realizations of countable Borel equivalence relations,https://arxiv.org/abs/2109.12486(preprint), 2025 (cit. on p

    2025 arXiv

  26. [35]

    Frisch,B

    [FSZ24] J. Frisch,B. Seward, andA. Zucker.Minimal subdynamics and minimal flows without characteristic measures, Forum Math. Sigma,12(2024), #e58 (cit. on pp. 1, 2,

    2024

  27. [36]

    FrischandO

    [FT17] J. FrischandO. Tamuz.Symbolic dynamics on amenable groups: the entropy of generic shifts, Ergod. Theory Dyn. Syst.,37(4) (2017), 1187–1210 (cit. on p

    2017

  28. [37]

    Frisch,O

    [FTF19] J. Frisch,O. Tamuz, andP. Vahidi Ferdowsi.Strong amenability and the infinite conjugacy class property, Invent. Math.,218(2019), 833–851 (cit. on p

    2019

  29. [38]

    Furstenberg.Disjointness in ergodic theory, minimal sets, and a problem in Diophantine approximation, Math

    [Fur67] H. Furstenberg.Disjointness in ergodic theory, minimal sets, and a problem in Diophantine approximation, Math. Syst. Theory,1(1967), 1–49 (cit. on p

    1967

  30. [39]

    [Gao+25] S. Gao,S. Jackson,E. Krohne, andB. Seward.Continuous combinatorics of abelian group actions, Mem. Am. Math. Soc.,311(1573) (2025) (cit. on p

    2025

  31. [40]

    [GJS09] S. Gao,S. Jackson, andB. Seward.A coloring property for countable groups, Math. Proc. Camb. Philos. Soc.,147(2009), 579–592 (cit. on pp. 3,

    2009

  32. [41]

    [GJS16] S. Gao,S. Jackson, andB. Seward.Group colorings and Bernoulli subflows, Mem. Am. Math. Soc.,241(1141) (2016) (cit. on pp. 3,

    2016

  33. [42]

    Glasner,T

    [Gla+21] E. Glasner,T. Tsankov,B. Weiss, andA. Zucker.Bernoulli disjointness, Duke Math. J.,170(4) (2021), 615–651 (cit. on pp. 4,

    2021

  34. [43]

    GlasnerandV.V

    [GU09] E. GlasnerandV.V. Uspenskij.Effective minimal subflows of Bernoulli flows, Proc. Am. Math. Soc.,137(2009), 3147–3154 (cit. on p

    2009

  35. [44]

    GottschalkandG.A

    26 [GH55] W.H. GottschalkandG.A. Hedlund.Topological Dynamics. Providence: Am. Math. Soc., 1955 (cit. on p

    1955

  36. [45]

    Gromov.Geometric group theory, Vol

    [Gro93] M. Gromov.Geometric group theory, Vol. 2: Asymptotic invariants of infinite groups. Ed. by A. NibloandM.A. Roller. Cambridge: Cambridge Univ. Press, 1993 (cit. on p

    1993

  37. [46]

    Halmos.Approximation theories for measure preserving transformations, Trans

    [Hal44a] P.R. Halmos.Approximation theories for measure preserving transformations, Trans. Am. Math. Soc.,55(1) (1944), 1–18 (cit. on p

    1944

  38. [47]

    Halmos.In general a measure preserving transformation is mixing, Ann

    [Hal44b]P.R. Halmos.In general a measure preserving transformation is mixing, Ann. Math.,45(4) (1944), 786–792 (cit. on p

    1944

  39. [48]

    Hedlund.Sturmian minimal sets, Am

    [Hed44]G.A. Hedlund.Sturmian minimal sets, Am. J. Math.,66(4) (1944), 605–620 (cit. on p

    1944

  40. [49]

    Hochman.Genericity in topological dynamics, Ergod

    [Hoc08] M. Hochman.Genericity in topological dynamics, Ergod. Theory Dyn. Syst.,28(1) (2008), 125–165 (cit. on p

    2008

  41. [50]

    Hochman.On the dynamics and recursive properties of multidimensional symbolic systems, Invent

    [Hoc09] M. Hochman.On the dynamics and recursive properties of multidimensional symbolic systems, Invent. Math.,176(2009), 131–167 (cit. on p

    2009

  42. [51]

    Hochman.Non-expansive directions for Z2 actions, Ergod

    [Hoc11] M. Hochman.Non-expansive directions for Z2 actions, Ergod. Theory Dyn. Syst.,31(1) (2011), 91–112 (cit. on p

    2011

  43. [52]

    IyerandF

    [IS25] S. IyerandF. Shinko.Asymptotic dimension and hyperfiniteness of generic Cantor actions, Groups Geom. Dyn., (2025). Published online first, preprint athttps://arxiv.org/abs/2409. 03078(cit. on p

    2025

  44. [53]

    Bernardes Jr.andU.B

    [JD12] N.C. Bernardes Jr.andU.B. Darji.Graph theoretic structure of maps of the Cantor space, Adv. Math.,231(3–4) (2012), 1655–1680 (cit. on p

    2012

  45. [54]

    Kechris.Classical Descriptive Set Theory

    [Kec95] A.S. Kechris.Classical Descriptive Set Theory. New York: Springer-Verlag, 1995 (cit. on pp. 8,

    1995

  46. [55]

    KechrisandA.S

    [KM20] A.S. KechrisandA.S. Marks.Descriptive Graph Combinatorics, https://math.berkeley. edu/~marks/papers/combinatorics20book.pdf(preprint), 2020 (cit. on p

    2020

  47. [56]

    KechrisandC

    [KR06] A.S. KechrisandC. Rosendal.Turbulence, amalgamation, and generic automorphisms of homogeneous structures, Proc. Lond. Math. Soc.,94(2) (2006), 302–350 (cit. on p

    2006

  48. [57]

    Kechris,S

    [KST99] A.S. Kechris,S. Solecki, andS. Todorcevic.Borel chromatic numbers, Adv. Math., 141(1) (1999), 1–44 (cit. on pp. 7,

    1999

  49. [58]

    LindandB

    [LM95] D. LindandB. Marcus.An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, 1995 (cit. on pp. 3,

    1995

  50. [59]

    Marks.A determinacy approach to Borel combinatorics, J

    [Mar16] A.S. Marks.A determinacy approach to Borel combinatorics, J. Am. Math. Soc.,29(2016), 579–600 (cit. on p

    2016

  51. [60]

    MolloyandB

    [MR02] M. MolloyandB. Reed.Graph Colouring and the Probabilistic Method. Berlin Heidelberg: Springer-Verlag, 2002 (cit. on pp. 7,

    2002

  52. [61]

    Morse.Recurrent geodesics on a surface of negative curvature, Trans

    [Mor21] H.M. Morse.Recurrent geodesics on a surface of negative curvature, Trans. Am. Math. Soc., 22(1) (1921), 84–100 (cit. on p

    1921

  53. [62]

    MorseandG.A

    [MH44] M. MorseandG.A. Hedlund.Unending chess, symbolic dynamics and a problem in semigroups, Duke Math. J.,11(1944), 1–7 (cit. on p

    1944

  54. [63]

    MoserandG

    [MT10] R. MoserandG. Tardos.A constructive proof of the general Lovász Local Lemma, J. ACM, 57(2) (2010) (cit. on p

    2010

  55. [64]

    MotwaniandP

    [MR95] R. MotwaniandP. Raghavan.Randomized Algorithms. Cambridge University Press, 1995 (cit. on p

    1995

  56. [65]

    OxtobyandS.M

    [OU41] J.C. OxtobyandS.M. Ulam.Measure-preserving homeomorphisms and metrical transitivity, Ann. Math.,42(4) (1941), 874–920 (cit. on p

    1941

  57. [66]

    PavlovandS

    [PS23] R. PavlovandS. Schmieding.On the structure of generic subshifts, Nonlinearity,36(9) (2023), 4904–4953 (cit. on p

    2023

  58. [67]

    PavlovandM

    [PS15] R. PavlovandM. Schraudner.Classification of sofic projective subdynamics of multi- dimensional shifts of finite type, Trans. Am. Math. Soc.,367(5) (2015), 3371–3421 (cit. on p

    2015

  59. [68]

    Pikhurko.Borel combinatorics of locally finite graphs, Surveys in Combinatorics, 28th British Combinatorial Conference, (2021)

    [Pik21] O. Pikhurko.Borel combinatorics of locally finite graphs, Surveys in Combinatorics, 28th British Combinatorial Conference, (2021). Ed. byK.K. Dabrowski et al., 267–319 (cit. on p

    2021

  60. [69]

    QianandF

    [QW22] L. QianandF. Weilacher.Descriptive combinatorics, computable combinatorics, and ASI algorithms,https://arxiv.org/abs/2206.08426(preprint), 2022 (cit. on pp. 7,

    2022 arXiv

  61. [70]

    27 [Rok48] V.A. Rokhlin. Общее преобразование с инвариантной мерой не есть перемешивание (Russian) [A general measure preserving transformation is not mixing], Proc. USSR Acad. Sci., 60(3) (1948), 349–351 (cit. on p

    1948

  62. [71]

    Rosenthal.On strictly ergodic models for commuting ergodic transformations, Ann

    [Ros89] A. Rosenthal.On strictly ergodic models for commuting ergodic transformations, Ann. Henri Poincare,25(1) (1989), 73–92 (cit. on p

    1989

  63. [72]

    Rubinstein-Salzedo.Ergodic Theory

    [Rub25]S. Rubinstein-Salzedo.Ergodic Theory. Providence: Am. Math. Soc., 2025 (cit. on p

    2025

  64. [73]

    RumyantsevandA

    [RS14] A. RumyantsevandA. Shen.Probabilistic constructions of computable objects and a computable version of Lovász Local Lemma, Fundamenta Informaticae,132(1) (2014), 1–14 (cit. on p

    2014

  65. [74]

    Salo.Subshifts with sparse traces, Studia Math.,255(2) (2020), 159–207 (cit

    [Sal20]V. Salo.Subshifts with sparse traces, Studia Math.,255(2) (2020), 159–207 (cit. on p

    2020

  66. [75]

    Schraudner.One-dimensional projective subdynamics of uniformly mixing Zd shifts of finite type, Ergod

    [Sch15] M.H. Schraudner.One-dimensional projective subdynamics of uniformly mixing Zd shifts of finite type, Ergod. Theory Dyn. Syst.,35(6) (2015), 1962–1999 (cit. on p

    2015

  67. [76]

    SewardandR.D

    [ST16] B. SewardandR.D. Tucker-Drob.Borel structurability on the 2-shift of a countable group, Ann. Pure Appl. Log.,167(1) (2016), 1–21 (cit. on pp. 3,

    2016

  68. [77]

    Spencer.Asymptotic lower bounds for Ramsey functions, Disc

    [Spe77] J. Spencer.Asymptotic lower bounds for Ramsey functions, Disc. Math.,20(1977), 69–76 (cit. on p

    1977

  69. [78]

    Thue.Über unendliche Zeichenreihen(German) [On infinite strings of symbols], Norske Vid

    [Thu06] A. Thue.Über unendliche Zeichenreihen(German) [On infinite strings of symbols], Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiania,7(1906), 1–22 (cit. on p

    1906

  70. [79]

    Weilacher.Borel edge colorings for finite-dimensional groups, Isr

    [Wei24] F. Weilacher.Borel edge colorings for finite-dimensional groups, Isr. J. Math.,263(2024), 737–780 (cit. on pp. 7,

    2024

  71. [80]

    Zucker.Minimal flows with arbitrary centralizer, Ergod

    [Zuc22] A. Zucker.Minimal flows with arbitrary centralizer, Ergod. Theory Dyn. Syst.,42(1) (2022), 310–320 (cit. on p

    2022

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.