Sarnak's conjecture on Möbius disjointness along polynomial iterates
Sarnak's conjecture on Möbius disjointness along polynomial iterates
Let be a minimal topological dynamical system, meaning that for every , the set is dense, with zero entropy. Let , let , and let be a polynomial. Polynomial Sarnak conjecture. One has
This was proposed as a stronger polynomial-iterate version of Sarnak's conjecture, with minimality added to exclude degenerate examples. The source states that it is false, citing separate counterexamples of Kanigowski, Lemanczyk, and Radziwill, and of Lian and Shi.
Sources & referencesView supporting material
Primary source
Ronnie Pavlov, “Minimal zero entropy subshifts can be unrestricted along any sparse set”, arXiv:2308.08013 (2023).
Additional references
25 papers in this index state this conjecture (2013–2023). The statement above is taken from the most recent of them; the others are arXiv:2304.03121, arXiv:2201.08800, arXiv:2109.01200, arXiv:2101.10134, arXiv:1905.02864, arXiv:1902.09712, arXiv:1809.05617, arXiv:1804.03851, arXiv:1711.01101, arXiv:1708.00677, arXiv:1707.07748, arXiv:1701.01984, and 12 more.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.