Strong ergodicity phenomena for Bernoulli shifts of bounded algebraic dimension
Aristotelis Panagiotopoulos, Assaf Shani

TL;DR
This paper investigates ergodic properties of Bernoulli shifts for permutation groups with bounded algebraic dimension, establishing criteria for generic ergodicity and exploring implications for Borel reducibility of certain equivalence relations.
Contribution
It introduces new criteria for generic ergodicity of Bernoulli shifts related to algebraic dimension and applies these to analyze the Borel hierarchy of equivalence relations.
Findings
Sequence of pairwise $*$-reduction-incomparable equivalence relations is strictly increasing in Borel hierarchy.
Constructs an equivalence relation with pinned cardinal $eth_1^{+}$ that does not Borel reduce to a known relation.
Shows symmetric models with locally finite symmetry groups admit a Cohen-like support theory.
Abstract
The algebraic dimension of a Polish permutation group is the smallest , so that for all of size , the orbit of every under the pointwise stabilizer of is finite. We study the Bernoulli shift for various Polish permutation groups and we provide criteria under which the -shift is generically ergodic relative to the injective part of the -shift, when has algebraic dimension . We use this to show that the sequence of pairwise -reduction-incomparable equivalence relations defined in [KP21] is a strictly increasing sequence in the Borel reduction hierarchy. We also use our main theorem to exhibit an equivalence relation of pinned cardinal which strongly resembles the equivalence relation of pinned cardinal…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Mathematical Dynamics and Fractals · Computability, Logic, AI Algorithms
