Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Resolving the joint ergodicity problem for Hardy sequences (2506.20459v1)

Published 25 Jun 2025 in math.DS

Abstract: The joint ergodicity classification problem aims to characterize those sequences which are jointly ergodic along an arbitrary dynamical system if and only if they satisfy two natural, simpler-to-verify conditions on this system. These two conditions, dubbed the difference and product ergodicity conditions, naturally arise from Berend and Bergelson's pioneering work on joint ergodicity. Elaborating on our earlier work, we investigate this problem for Hardy sequences of polynomial growth, this time without making any independence assumptions on the sequences. Our main result establishes the "difficult" direction of the problem: if a Hardy family satisfies the difference and product ergodicity conditions on a given system, then it is jointly ergodic for this system. We also find that, surprisingly, the converse fails for certain pathological families of Hardy sequences, even though it holds for all "reasonable" Hardy families. We conclude by suggesting potential fixes to the statement of this problem. New ideas of independent interest developed in this paper include the structure theory of a family of factors generalizing Host-Kra and box factors; a strengthening of Tao-Ziegler's concatenation results; and the most robust extension of a seminorm smoothing argument.

Summary

We haven't generated a summary for this paper yet.