Counterexamples to double recurrence for non-commuting deterministic transformations
Zemer Kosloff, Shrey Sanadhya

TL;DR
This paper demonstrates that double recurrence properties fail for certain non-commuting, mixing, zero entropy transformations when using specific polynomial iterates, answering a longstanding open question.
Contribution
It provides the first comprehensive counterexamples to double recurrence for non-commuting transformations with polynomial iterates of degree at least one.
Findings
Double recurrence fails for non-commuting, mixing, zero entropy transformations.
Counterexamples are constructed for polynomial iterates of degree 1 or ≥2.
Answers a question posed by Frantzikinakis and Host.
Abstract
We show that if are injective, integer polynomials that vanish at the origin, such that either both are of degree or both are of degree or higher, then double recurrence fails for non-commuting, mixing, zero entropy transformations. This answers a question of Frantzikinakis and Host completely.
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.
