Independence and mean sensitivity in minimal systems under group actions

Chunlin Liu; Leiye Xu; Shuhao Zhang

REVIEW 1 major objections 6 minor 1 cited by

Independence and mean sensitivity in minimal systems under group actions

T0 review · 1 major / 6 minor · reviewed 2026-08-10 · 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 for incontractible or local-Bronstein minimal systems, almost every fiber of the maximal equicontinuous factor is an IT-set, and uses this to settle two conjectures and bound ergodic measures.

desk verdict Genuinely new proof technique and solid results that resolve two named conjectures; main risk is an imported theorem, but the paper deserves refereeing. read the letter →

arxiv 2501.15622 v2 pith:NUBVKV7T submitted 2025-01-26 math.DS

Chunlin Liu , Leiye Xu , Shuhao Zhang This is my paper · ORCID

classification math.DS MSC 37B0537A15

keywords independencesetIT-tuplemaximalequicontinuousfactormeansensitivityminimalsystemslocalBronsteinhyperspacedynamicsEllissemigroup

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

This paper proves a bridge between two notions that look unrelated: the regularity of a minimal system's maximal equicontinuous factor and the presence of infinite combinatorial independence. For minimal systems that are incontractible, or local Bronstein with an invariant Borel probability measure, almost every fiber of the maximal equicontinuous factor is an IT-set: every finite tuple of points in the fiber has an infinite independence set. This settles Conjecture 1.2 and verifies Conjecture 1.1 for virtually nilpotent acting groups, including all abelian groups. The same method gives sharp bounds on the number of ergodic measures and, for amenable groups under the local Bronstein condition, proves that mean-sensitive tuples are always IT-tuples.

What carries the argument

The engine is the hyperspace system $(2^X,G)$ of nonempty closed subsets of $X$ under the Hausdorff metric, and inside it the subsystem $\mathcal{X}$ of fibers $\pi_{\mathrm{eq}}^{-1}(y)$. The paper introduces the interior saturation property: a closed set $E$ satisfies $\pi_{\mathrm{eq}}^{-1}(\operatorname{int}(\pi_{\mathrm{eq}}(E)))\subset E$. Proposition 3.4 shows that minimal centers of orbit closures of open sets satisfy this property, and Lemma 3.5 converts it into a thickly syndetic return-time statement: for most $g$, the fiber over a slightly shrunk ball around $gy_*$ lies inside a slightly enlarged $gU$. The new step is Claim 4.5, which builds infinite independence sets by induction through the Ellis semigroup $E(X_{\mathrm{eq}})$ -- the closure of the action in the space of self-maps of $X_{\mathrm{eq}}$ -- a compact group carrying Haar measure $\tilde\nu$. The condition $\tilde\nu(\cap_{m=1}^M \tilde Z_* h_m^{-1})>0$ tells when a tuple of shifts can be extended one level deeper, and Lemma 4.4 promotes that measure condition to a syndetic set of group elements, so the induction never runs out of new elements. This is what forces the whole fiber to be an IT-set.

What would settle it

Take a minimal almost-two-to-one example of the kind used to show the $K-1$ bound is sharp, choose a fiber over a continuity point of $\pi_{\mathrm{eq}}^{-1}$, and test two points of that fiber: if for some $\varepsilon>0$ their $\varepsilon$-neighborhoods admit no infinite independence set, then Theorem 4.1 fails, because that fiber lies in the full-measure set where fibers are supposed to be IT-sets.

Watch

Extended reading notes

Core claim

The central claim is Theorem 1.3. Let $(X,G)$ be a minimal topological dynamical system and $\pi_{\mathrm{eq}}:X\to X_{\mathrm{eq}}$ the factor map to its maximal equicontinuous factor. If $(X,G)$ is incontractible, or is local Bronstein and carries an invariant probability measure, then there is a dense $G_\delta$ set $Z\subset X_{\mathrm{eq}}$ with $\nu_{\mathrm{eq}}(Z)=1$ such that $\pi_{\mathrm{eq}}^{-1}(y)$ is an IT-set for every $y\in Z$. A set is an IT-set when every tuple of its points is an IT-tuple, meaning every tuple of open neighborhoods around those points has an infinite independence set. The phrase ``regular $K$ to one'' means that fibers of cardinality $K$ have full $\nu_{\mathrm{eq}}$-measure, and ``essential'' means the points in the tuple are distinct. From the fiber statement the paper derives: no essential $K$-IT-tuples forces $\pi_{\mathrm{eq}}$ to be regular $K'$ to one with $1\le K'\le K-1$; an almost $N$-to-one $\pi_{\mathrm{eq}}$ forces every fiber to contain essential $K$-IT-tuples for $2\le K\le N$; and the number of ergodic measures is at most $K-1$. The later sections prove parallel mean-sensitivity results for amenable groups, culminating in Theorem 1.8: under the local Bronstein condition, every mean-sensitive $K$-tuple along a Følner sequence is an IT-tuple.

Load-bearing premise

The load-bearing premise is quoted Theorem 2.5: for a local Bronstein minimal system, if every pair $(x_1,x_k)$ is regionally proximal then the whole tuple is regionally proximal; the paper's construction of syndetic return sets in Claim 3.9 uses exactly this promotion, and without it the interior-saturation argument collapses.

Editorial extensions

If this is right

Conjecture 1.2 is answered affirmatively: if the maximal equicontinuous factor map of a minimal amenable system is proximal and not almost one to one, every fiber contains arbitrarily large essential IT-tuples.
Conjecture 1.1 is verified for virtually nilpotent groups: such minimal systems have no essential $K$-IT-tuples only if the maximal equicontinuous extension is regular finite to one.
The upper bound on ergodic measures drops from $N(K-1)$ to the optimal $K-1$ whenever no essential $K$-IT-tuple exists.
Under amenability plus local Bronstein, every mean-sensitive tuple along a Følner sequence is an IT-tuple, and if the factor map is open then essential IT-tuples, IN-tuples, sequence entropy tuples, sensitive tuples, and weakly mean-sensitive tuples coincide.
Minimal $\mathbb{Z}$-systems with finite maximal sequence entropy are of finite type.

Reading between the lines

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

The hyperspace method looks portable: any notion of special fiber that can be located by a positive-measure condition on the Ellis group should yield the same inductive independence construction for other tuple classes such as IN-tuples or sequence-entropy tuples.
The paper leaves open whether the quoted pairwise-to-tuple promotion can be reached from an invariant measure alone; if it could, Conjecture 1.1 would follow in full without the local Bronstein hypothesis, as the paper notes in Remark 2.7.
One could test whether the $K-1$ ergodic-measure bound is sharp for every $K$: the cited example establishes optimality at $K=3$, and a family achieving the bound at all orders would confirm that the independence hierarchy is the right organizing principle.
For non-amenable acting groups the mean-sensitivity statements have no Følner-density formulation; a possible extension is to replace Banach density with a combinatorial notion of size and ask whether weakly mean-sensitive tuples remain IT-tuples.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Desk Editor's Note

read the letter

Let me give you the short version: this is a strong paper. It resolves Huang-Lian-Shao-Ye Conjecture 1.2 and Conjecture 1.1 for virtually nilpotent groups, and confirms Li-Liu-Tu-Yu's conjecture that mean-sensitive tuples are IT-tuples without the almost-one-to-one condition. That is real progress, not incremental.

What's new: the hyperspace and interior saturation method. The authors prove that full-measure fibers of the maximal equicontinuous factor are IT-sets. Theorem 1.3 is the engine, and the inductive independence-set construction in Claim 4.5 is genuinely clever. The proof is detailed, and I traced the main chain from Lemma 3.5 through Theorem 4.1 to Corollaries 4.2. The logic holds up at the level I checked. The bound |Me(X,G)| <= K-1 in Corollary 4.2(iv) is a real improvement over the earlier N(K-1) bound, and the cited example shows it's optimal.

Soft spots: the load-bearing step is Claim 3.9, which uses Auslander's Theorem 2.5 to convert pairwise regionally proximal points in one fiber into a K-regionally proximal tuple. This theorem is imported, not proved, though the authors point to [39, Remark 7.2] for a proof. I didn't verify that source, so the residual risk is concentrated there: if Theorem 2.5 fails, the interior saturation construction collapses. But relying on a published theorem with a pointer is normal practice, so I don't treat it as a defect, just as the place I'd ask a referee to check carefully. There's also a minor wording slip in Claim 3.9: the text says 'ergodic probability measure' when only invariance is assumed. It's harmless because the lemma used only needs invariance, but it should be fixed.

The citation pattern looks fine. The self-reference to [43] is contextual and doesn't carry the proofs. No circularity burden.

Who is this for: anyone working in local entropy theory, IT-tuples, or mean sensitivity for non-abelian group actions. It's a solid contribution. My recommendation: send it out. The referee should be asked specifically to check the application of Theorem 2.5 in Claim 3.9 and the proof of Proposition 3.8. I'd accept with minor revision after that.

Referee Report

1 major / 6 minor

Summary. The paper studies minimal topological dynamical systems under countable discrete group actions. The main theorem (Theorem 1.3) states that if a minimal system is either incontractible or local Bronstein with an invariant Borel probability measure, then there is a dense Gδ subset Z of the maximal equicontinuous factor Xeq, with νeq(Z)=1, such that every fiber π_eq^{-1}(y) with y∈Z is an IT-set. This result is used to verify Conjectures 1.1 and 1.2 from Huang–Lian–Shao–Ye in the stated settings, and to prove optimal bounds on the number of ergodic measures (Corollary 4.2(iv)). In the amenable case, under the local Bronstein condition, the paper establishes parallel statements for weakly mean-sensitive sets (Theorem 1.6), shows that every mean-sensitive tuple is an IT-tuple (Theorem 1.8), and gives a coincidence result for several tuples when π_eq is open (Theorem 1.9). The proofs introduce a hyperspace method centered on an interior saturation property (Proposition 3.4).

Significance. If the results hold, they resolve two open conjectures in the field and improve existing bounds on the number of ergodic measures, which is a significant contribution. The proof technique, based on hyperspaces and interior saturation, appears novel and is carefully developed. The paper is well structured, and the main arguments are presented in detail, with explicit references to prior work. A notable strength is that the key claims are stated with precise hypotheses, and the dependence on external results is clearly flagged. In particular, the central use of Auslander's Theorem 2.5 is explicitly stated, and I have verified that its application in Claim 3.9 is logically correct. The residual uncertainty identified in the stress-test note is therefore not realized; the main theorems stand provided the cited external results are valid.

major comments (1)

[Section 3.3, Claim 3.9] The proof of Claim 3.9 (and hence Proposition 3.4 and Theorem 1.3) relies on the imported Theorem 2.5, which converts pairwise regional proximality within a fiber into a regionally proximal tuple. I have checked the application in the manuscript: under local Bronstein, RP2 is an equivalence relation coinciding with the fiber relation (as cited in Section 2.2), so the hypotheses of Theorem 2.5 are indeed satisfied for the dense subset {x_i} of π_eq^{-1}(y*), and Lemma 2.4 then yields the claimed open sets V_i. Thus the stress-test concern about a collapse is not realized. However, because this external theorem is a single load-bearing input not proved in the paper, I recommend that the authors add a proof sketch or at least a precise statement of the companion fact (that RP2 equals the fiber relation under local Bronstein) in an appendix, or cite the exact theorem number in [1] with a pointer to the proof in [39]. This would make the paper more self-contained without changing any argument.

minor comments (6)

[Section 3.3, Claim 3.9] In the invariant-measure case, the proof refers to an 'ergodic probability measure' although only invariance is used; since minimal systems have full support for every invariant measure, the argument is valid, but the wording should be changed to 'invariant' to avoid confusion.
[Section 2.2, proof of Lemma 3.1] The set Y* is written as an intersection over all ǫ>0; to be a Gδ set one should take a countable sequence, e.g., ǫ=1/n.
[Section 3.3, proof of Proposition 3.4] The opening sentence 'MU = Min(...)' appears to be a typo; it should state that it suffices to prove every minimal point of Orb(U,G) satisfies V(E*)=π_eq(E*), with the closure argument then following from compactness of V (Lemma 3.7).
[Section 3.3, Claim 3.9] The application of Theorem 2.5 and Lemma 2.4 implicitly requires the tuple length to be at least 2; the case where the ǫ/2-dense subset has a single point is trivial (by minimality) but should be mentioned for completeness.
[Section 5, proof of Theorem 5.1] The application of Lemma 3.5(2) is justified only because G is amenable, which implies the existence of an invariant probability measure and hence property (∗). This should be stated explicitly, as Lemma 3.5 is formulated under property (∗).
[Section 4, Corollary 4.2(iii) and Section 5, Corollary 5.3(iii)] The proofs of these corollaries are sketched in one sentence; a brief indication of the compactness/closedness argument for IT-tuples and weakly mean-sensitive tuples would improve readability.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the central proof relies on external theorems (Auslander's Theorem 2.5) and self-citations are contextual only.

full rationale

The derivation chain is self-contained relative to standard published results and does not reduce to its own inputs. The central mechanism, Proposition 3.4, is proved using Claim 3.9, which converts tuples lying in a single fiber of the maximal equicontinuous factor into regional proximal K-tuples via Theorem 2.5, quoted from Auslander [1, Theorem 8] and supported by [39, Remark 7.2]. This is an external, parameter-free theorem whose hypotheses (local Bronstein) do not include the target conclusion that the fiber is an IT-set. The interior saturation property (Lemma 3.5) is then derived from Proposition 3.4, and Theorem 4.1 constructs infinite independence sets explicitly through the inductive Claim 4.5. No step assumes the conclusion as an hypothesis, no fitted quantity is relabeled as a prediction, and no definition is circularly tied to the result. The only self-citation, reference [43] by two of the present authors, is contextual: it is mentioned as a previously improved upper bound N(K-1) that the paper then strengthens to K-1; it is not used as evidence in the proofs of Theorem 1.3 or Theorem 1.6. Remark 2.7 openly states a limitation about replacing the local Bronstein condition in Theorem 2.5, which is a correctness caveat rather than a circular maneuver. The reliance on the externally quoted Auslander theorem is a mathematical-risk point but not a circularity, because the cited theorem is independent published work with stated assumptions not containing the paper's conclusion. Thus the appropriate circularity score is 0.

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

No free parameters or invented entities. The proof borrows standard results from topological dynamics, including Ellis semigroup theory, maximal equicontinuous factors, and return-time lemmas, plus two domain-specific theorems, Auslander's RP_K theorem and Glasner's incontractibility theorem. None of these assume the conclusions.

assumptions (5)

domain assumption Auslander's RP_K theorem under local Bronstein (Theorem 2.5)
Quoted from [1], used in Claim 3.9 to relate pairwise regional proximality to K-tuple regional proximality.
domain assumption Virtually nilpotent minimal actions are incontractible
Quoted from Glasner [21], used to apply Theorem 1.3(1) to virtually nilpotent groups.
standard math Amenable actions on compact metrizable spaces admit invariant probability measures
Used in Section 5 to combine local Bronstein with an invariant measure.
standard math Every invariant Borel probability measure on a minimal tds has full support
Used in Claim 3.9 to show the product of neighborhoods has positive measure.
standard math Ellis semigroup of an equicontinuous minimal system is a compact metrizable group with Haar measure (Theorem 2.10)
Used in Lemma 4.3 and Lemma 4.4 for the measure estimates in Claim 4.5.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Independence and mean sensitivity in minimal systems under group actions." pith.science (2026). https://pith.science/paper/NUBVKV7T

@misc{pith2026250115622,
  author       = {Pith},
  title        = {Pith review of: Independence and mean sensitivity in minimal systems under group actions},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/NUBVKV7T}},
  note         = {Machine review of arXiv:2501.15622}
}

read the original abstract

In this paper, we mainly study the relation between regularity, independence and mean sensitivity for minimal systems. In the first part, we show that if a minimal system is incontractible, or local Bronstein with an invariant Borel probability measure, then the regularity is strictly bounded by the infinite independence. In particular, the following two types of minimal systems are applicable to our result: (1) The acting group of the minimal system is a virtually nilpotent group. (2) The minimal system is a proximal extension of its maximal equicontinuous factor and admits an invariant Borel probability measure. Items (1) and (2) correspond to Conjectures 1 and 2 from Huang, Lian, Shao, and Ye (J. Funct. Anal., 2021); item (1) verifies Conjecture 1 in the virtually nilpotent case, and item (2) gives an affirmative answer to Conjecture 2. In the second part, for a minimal system acting by an amenable group, under the local Bronstein condition, we establish parallel results regarding weak mean sensitivity and establish that every mean-sensitive tuple is an IT-tuple.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Conditional Topomorphic Degree and Multivariate Mean Equicontinuity for Minimal Amenable Group Actions
math.DS 2026-07 conditional novelty 8.0 of 10

For minimal actions of countably infinite discrete amenable groups, r-point mean equicontinuity (Weyl or along a Følner sequence) holds iff the conditional topomorphic degree is at most r−1; an exact degree formula an...

Reference graph

Works this paper leans on

52 extracted references · 50 canonical work pages · cited by 1 Pith paper

[43]

C. Liu, X. Wang and L. Xu, Sequence entropy and IT-tuples for minimal group actions. Adv. Math. 467 (2025), Paper No. 110183

work page 2025
[1]

Auslander, A group theoretic condition in topological dynamics , Proceedings of the 18th Summer Conference on Topology and its Applications

J. Auslander, A group theoretic condition in topological dynamics , Proceedings of the 18th Summer Conference on Topology and its Applications. Topology Proc . 28 (2004), no. 2, 327– 334

work page 2004
[39]

Li and Y

J. Li and Y. Yang, Stronger versions of sensitivity for minimal g roup actions, Acta Math. Sin. (Engl. Ser.) 37 (2021), no. 12, 1933–1946

work page 2021
[2]

Auslander, Minimal ﬂows and their extensions, Elsevier Science Ltd, 1988

J. Auslander, Minimal ﬂows and their extensions, Elsevier Science Ltd, 1988

work page 1988
[3]

Auslander, Minimal ﬂows with a closed proximal cell, Ergodic Theo ry Dynam

J. Auslander, Minimal ﬂows with a closed proximal cell, Ergodic Theo ry Dynam. Systems 21 (2001), no. 3, 641–645

work page 2001
[4]

Bergelson, N

V. Bergelson, N. Hindman and R. McCutcheon, Notions of size and combinatorial properties of quotient sets in semigroups, Proceedings of the 1998 Topology a nd Dynamics Conference (Fairfax, V A). Topology Proc. 23 (1998), Spring, 23–60

work page 1998
[5]

Blanchard, Fully positive topological entropy and topological m ixing, Symbolic dynamics and its applications (New Haven, CT, 1991), 95–105, Contemp

F. Blanchard, Fully positive topological entropy and topological m ixing, Symbolic dynamics and its applications (New Haven, CT, 1991), 95–105, Contemp. Mat h., 135, Amer. Math. Soc., Providence, RI, 1992

work page 1991
[6]

Blanchard, B

F. Blanchard, B. Host and A. Maass, Topological complexity, Erg odic Theory Dynam. Systems 20 (2000), 641–662

work page 2000

Show all 52 references

[7]

Blanchard, B

F. Blanchard, B. Host, A. Maass, S. Martinez and D. J. Rudolph, Entropy pairs for a measure, Ergodic Theory Dynam. Systems 15 (1995), 621–632

1995
[8]

Cao and S

Y. Cao and S. Shao, Almost proximal extensions of minimal ﬂows, E rgodic Theory Dynam. Systems 43 (2023), no. 12, 4041–4073

2023
[9]

de Vries, Elements of Topological Dynamics, Kluwer Academic Pu blishers (993), Dordrecht

J. de Vries, Elements of Topological Dynamics, Kluwer Academic Pu blishers (993), Dordrecht
[10]

Ellis and W

R. Ellis and W. Gottschalk, Homomorphisms of transformation gr oups, Trans. Amer. Math. Soc. 94, 1960, 258–271

1960
[11]

Følner, On groups with full Banach mean value, Math

E. Følner, On groups with full Banach mean value, Math. Scand. 3 (1955), 243–254

1955
[12]

Fuhrmann, E

G. Fuhrmann, E. Glasner, T. J¨ ager and C. Oertel, Irregular m odel sets and tame dynamics, Trans. Amer. Math. Soc. 374 (2021), no. 5, 3703–3734

2021
[13]

Fuhrmann and D

G. Fuhrmann and D. Kwietniak, On tameness of almost automorp hic dynamical systems for general groups, Bull. Lond. Math. Soc. 52, 1 (2020), 2–42

2020
[14]

Furstenberg, Recurrence in ergodic theory and combinato rial number theory,M

H. Furstenberg, Recurrence in ergodic theory and combinato rial number theory,M. B. Porter Lectures. Princeton University Press, Princeton, NJ, 1981. xi+2 03 pp

1981
[15]

Garc ´ ıa-Ramos, Weak forms of topological and measure-th eoretical equicontinuity: rela- tionships with discrete spectrum and sequence entropy

F. Garc ´ ıa-Ramos, Weak forms of topological and measure-th eoretical equicontinuity: rela- tionships with discrete spectrum and sequence entropy. Ergodic T heory Dynam. Systems 37 (2017), no. 4, 1211–1237

2017
[16]

Garc ´ ıa-Ramos and H

F. Garc ´ ıa-Ramos and H. Li, Local entropy theory and applicat ions, arXiv:2401.10012. INDEPENDENCE AND MEAN SENSITIVITY 29

arXiv
[17]

Glasner, The structure of tame minimal dynamical systems f or general groups, Invent

E. Glasner, The structure of tame minimal dynamical systems f or general groups, Invent. Math. 211 (2018), no. 1, 213–244

2018
[18]

Glasner, Structure theory as a tool in topological dynamics , Descriptive set theory and dynamical systems (Marseille-Luminy, 1996), 173–209, London Ma th

E. Glasner, Structure theory as a tool in topological dynamics , Descriptive set theory and dynamical systems (Marseille-Luminy, 1996), 173–209, London Ma th. Soc. Lecture Note Ser. 277, Cambridge Univ. Press, Cambridge, 2000

1996
[19]

Glasner, Topological weak mixing and quasi-Bohr systems, Pr obability in mathematics

E. Glasner, Topological weak mixing and quasi-Bohr systems, Pr obability in mathematics. Israel J. Math. 148 (2005), 277–304

2005
[20]

Glasner, On tame dynamical systems, Colloq

E. Glasner, On tame dynamical systems, Colloq. Math. 105 (200 6), no. 2, 283–295
[21]

Glasner, Compressibility properties in topological dynamics, A mer

S. Glasner, Compressibility properties in topological dynamics, A mer. J. Math. 97 (1975), 148–171

1975
[22]

Glasner and M

E. Glasner and M. Megrelishvili, Circularly ordered dynamical syst ems, Monatsh. Math. 185 (2018), no. 3, 415–441

2018
[23]

Glasner and B

E. Glasner and B. Weiss, Topological entropy of extensions, Er godic theory and its connections with harmonic analysis (Alexandria, 1993), 299–307, London Math. Soc. Lecture Note Ser., 205, Cambridge Univ. Press, Cambridge, 1995

1993
[24]

Glasner and X

E. Glasner and X. Ye, Local entropy theory, Ergodic Theory D ynam. Systems 29 (2009), 321–356

2009
[25]

G´ omez, I

J. G´ omez, I. Le´ on-Torres and V. Mu˜ noz-L´ opez, Sequence entropy and independence in free and minimal actions, arXiv:2504.00960

arXiv
[26]

Hewitt and K

E. Hewitt and K. A. Ross, Abstract harmonic analysis, Vol. I: St ructure of topological groups. Integration theory, group representations. Die Grund lehren der mathematischen Wis- senschaften, Bd. 115. Academic Press, Inc., Publishers, New Yor k; Springer-Verlag, Berlin- G¨ ot...

1963
[27]

Huang, Tame systems and scrambled pairs under an Abelian gr oup action, Ergodic Theory Dynam

W. Huang, Tame systems and scrambled pairs under an Abelian gr oup action, Ergodic Theory Dynam. Systems 26 (2006), no. 5, 1549–1567

2006
[28]

Huang, S

W. Huang, S. Li, S. Shao and X. Ye, Null systems and sequence e ntropy pairs, Ergodic Theory Dynam. Systems 23 (2003), no. 5, 1505–1523

2003
[29]

Huang, P

W. Huang, P. Lu and X. Ye, Measure-theoretical sensitivity an d equicontinuity, Israel J. Math. 183 (2011), 233–283

2011
[30]

Huang, Z

W. Huang, Z. Lian, S. Shao and X. Ye, Minimal systems with ﬁnitely many ergodic measures, J. Funct. Anal. 280 (2021), no. 12, Paper No. 109000, 42 pp

2021
[31]

Huang, A

W. Huang, A. Maass and X. Ye, Sequence entropy pairs and com plexity pairs for a measure, Ann. Inst. Fourier (Grenoble), 54 (2004), 1005–1028

2004
[32]

Huang and X

W. Huang and X. Ye, Topological complexity, return times and we ak disjointness, Ergodic Theory Dynam. Systems, 24 (2004), 825–846

2004
[33]

Huang and X

W. Huang and X. Ye, A local variational relation and applications, Israel J. Math. 151 (2006), 237–279

2006
[34]

Kerr and H

D. Kerr and H. Li, Combinatorial independence and soﬁc entrop y, Commun. Math. Stat. 1 (2013), no. 2, 213–257

2013
[35]

Kerr and H

D. Kerr and H. Li, Independence in topological and C∗ -dynamics, Math. Ann. 338 (2007), no. 4, 869–926

2007
[36]

Kuratowski, Topology, Vol

K. Kuratowski, Topology, Vol. I, Acad. Press, New York, N.Y., 1 966
[37]

Kuratowski, Topology, Vol

K. Kuratowski, Topology, Vol. II, Acad. Press, New York, N.Y., 1968

1968
[38]

J. Li, S. Tu and X. Ye, Mean equicontinuity and mean sensitivity, E rgodic Theory and Dy- namical Systems 35 (2015), 2587–2612

2015
[40]

Li and T

J. Li and T. Yu, On mean sensitive tuples, J. Diﬀerential Equatio ns, 297 (2021), 175–200

2021
[41]

J. Li, C. Liu, S. Tu and T. Yu, Sequence entropy tuples and mean sensitive tuples, Ergodic Theory Dynam. Systems 44 (2024), no. 1, 184–203

2024
[42]

J. Li, X. Ye and T. Yu, Equicontinuity and sensitivity in mean forms , J. Dynam. Diﬀerential Equations, 34 (2022), 133–154. 30 CHUNLIN LIU, LEIYE XU, AND SHUHAO ZHANG

2022
[44]

Maass and S

A. Maass and S. Shao, Structure of bounded topological-sequ ence-entropy minimal systems, J. Lond. Math. Soc. (2) 76 (2007), no. 3, 702–718

2007
[45]

McMahon, Relativized weak disjointness and relatively invarian t measures, Trans

D. McMahon, Relativized weak disjointness and relatively invarian t measures, Trans. Amer. Math. Soc. 236 (1978), 225–237

1978
[46]

Qiu, Independence and almost automorphy of higher order, Ergodic Theory Dynam

J. Qiu, Independence and almost automorphy of higher order, Ergodic Theory Dynam. Sys- tems 43 (2023), no. 4, 1363–1381

2023
[47]

Qiu and J

J. Qiu and J. Yu, Saturated theorem along cubes for a measure and applications, arXiv:2311.14198

arXiv
[48]

W. A. Veech, Point-distal ﬂows, Amer. J. Math. 92 (1970) 205 –242

1970
[49]

W. A. Veech, The equicontinuous structure relation for minimal Abelian transformation groups, Amer. J. Math. 90 (1968), 723–732

1968
[50]

Wang, Thickly syndetic sensitivity of semigorup actions, Bull

H. Wang, Thickly syndetic sensitivity of semigorup actions, Bull. K orean Math. Soc. 55 (2018), no. 4, 1125–1135

2018
[51]

Walters, An Introduction to Ergodic Theory (Graduate Tex ts in Mathematic, 79), Springer- Verlag, New York, 1982

P. Walters, An Introduction to Ergodic Theory (Graduate Tex ts in Mathematic, 79), Springer- Verlag, New York, 1982

1982
[52]

Ye and R

X. Ye and R. Zhang, On sensitive sets in topological dynamics, No nlinearity 21 (2008), 1601– 1620. (C. Liu) School of Mathematical Sciences, Dalian University of Tech nology, Dalian, 116024, P.R. China Email address : chunlinliu@mail.ustc.edu.cn (L. Xu) School of Mathematical...

2008

Pith tools

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

[1] [43]

C. Liu, X. Wang and L. Xu, Sequence entropy and IT-tuples for minimal group actions. Adv. Math. 467 (2025), Paper No. 110183

work page 2025

[2] [1]

Auslander, A group theoretic condition in topological dynamics , Proceedings of the 18th Summer Conference on Topology and its Applications

J. Auslander, A group theoretic condition in topological dynamics , Proceedings of the 18th Summer Conference on Topology and its Applications. Topology Proc . 28 (2004), no. 2, 327– 334

work page 2004

[3] [39]

Li and Y

J. Li and Y. Yang, Stronger versions of sensitivity for minimal g roup actions, Acta Math. Sin. (Engl. Ser.) 37 (2021), no. 12, 1933–1946

work page 2021

[4] [2]

Auslander, Minimal ﬂows and their extensions, Elsevier Science Ltd, 1988

J. Auslander, Minimal ﬂows and their extensions, Elsevier Science Ltd, 1988

work page 1988

[5] [3]

Auslander, Minimal ﬂows with a closed proximal cell, Ergodic Theo ry Dynam

J. Auslander, Minimal ﬂows with a closed proximal cell, Ergodic Theo ry Dynam. Systems 21 (2001), no. 3, 641–645

work page 2001

[6] [4]

Bergelson, N

V. Bergelson, N. Hindman and R. McCutcheon, Notions of size and combinatorial properties of quotient sets in semigroups, Proceedings of the 1998 Topology a nd Dynamics Conference (Fairfax, V A). Topology Proc. 23 (1998), Spring, 23–60

work page 1998

[7] [5]

Blanchard, Fully positive topological entropy and topological m ixing, Symbolic dynamics and its applications (New Haven, CT, 1991), 95–105, Contemp

F. Blanchard, Fully positive topological entropy and topological m ixing, Symbolic dynamics and its applications (New Haven, CT, 1991), 95–105, Contemp. Mat h., 135, Amer. Math. Soc., Providence, RI, 1992

work page 1991

[8] [6]

Blanchard, B

F. Blanchard, B. Host and A. Maass, Topological complexity, Erg odic Theory Dynam. Systems 20 (2000), 641–662

work page 2000