vix.ing · top · new · best · stats · spec

Counterexamples to double recurrence for non-commuting deterministic transformations

2025/07/21 by Zemer Kosloff, Kosloff, Zemer, Shrey Sanadhya +1
Computer Science · Mathematics · #28D05 #37A05 #37A30 #37A50 #60F05 #60G10 #60G15 #Advanced Combinatorial Mathematics #Dynamical Systems (math.DS) #FOS: Mathematics #Mathematical Dynamics and Fractals #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.2507.15528

openalex publication_date 2025/07/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We show that if <i>p</i><sub>1</sub>, <i>p</i><sub>2</sub> are injective, integer polynomials that vanish at the origin, such that either both are of degree 1 or both are of degree 2 or higher, then double recurrence fails for non-commuting, mixing, zero entropy transformations. This answers a question of Frantzikinakis and Host completely.

Citations

Related